fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r136-tall-171631133200706
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DrinkVendingMachine-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
304.548 11392.00 26123.00 58.80 TTTFTFTTFFFTFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631133200706.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 DrinkVendingMachine-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631133200706
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.1K Apr 12 23:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 12 23:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 23:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 23:13 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 6.5K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 23:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 23:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 23:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 23:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 51K 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 DrinkVendingMachine-PT-02-CTLFireability-2024-00
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-01
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-02
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-03
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-04
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-05
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-06
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-07
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-08
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-09
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-10
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-11
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-12
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-13
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-14
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716424693190

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 00:38:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:38:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:38:14] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-23 00:38:14] [INFO ] Transformed 24 places.
[2024-05-23 00:38:14] [INFO ] Transformed 72 transitions.
[2024-05-23 00:38:14] [INFO ] Parsed PT model containing 24 places and 72 transitions and 440 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Initial state reduction rules removed 4 formulas.
[2024-05-23 00:38:14] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-23 00:38:14] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-23 00:38:14] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-23 00:38:14] [INFO ] Reduced 16 identical enabling conditions.
[2024-05-23 00:38:14] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-23 00:38:14] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-23 00:38:14] [INFO ] Reduced 16 identical enabling conditions.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 9 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Running 36 sub problems to find dead transitions.
// Phase 1: matrix 52 rows 24 cols
[2024-05-23 00:38:14] [INFO ] Computed 12 invariants in 9 ms
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD31 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 8/8 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 4/24 variables, 4/12 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 52/76 variables, 24/36 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/36 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/36 constraints. Problems are: Problem set: 24 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 36 constraints, problems are : Problem set: 24 solved, 12 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 52/76 variables, 24/36 constraints. Problems are: Problem set: 24 solved, 12 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 12/48 constraints. Problems are: Problem set: 26 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/48 constraints. Problems are: Problem set: 26 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/48 constraints. Problems are: Problem set: 26 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 48 constraints, problems are : Problem set: 26 solved, 10 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 12/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 589ms problems are : Problem set: 26 solved, 10 unsolved
Search for dead transitions found 26 dead transitions in 600ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 26 transitions.
// Phase 1: matrix 26 rows 24 cols
[2024-05-23 00:38:15] [INFO ] Computed 14 invariants in 1 ms
[2024-05-23 00:38:15] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 00:38:15] [INFO ] Invariant cache hit.
[2024-05-23 00:38:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/24 places, 26/52 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 732 ms. Remains : 24/24 places, 26/52 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 20 out of 20 places after structural reductions.
[2024-05-23 00:38:15] [INFO ] Flatten gal took : 20 ms
[2024-05-23 00:38:15] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:38:15] [INFO ] Input system was already deterministic with 26 transitions.
Reduction of identical properties reduced properties to check from 36 to 35
RANDOM walk for 40000 steps (8 resets) in 2962 ms. (13 steps per ms) remains 13/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 389 ms. (102 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
// Phase 1: matrix 26 rows 20 cols
[2024-05-23 00:38:17] [INFO ] Computed 10 invariants in 1 ms
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 13/46 variables, and 4 constraints, problems are : Problem set: 13 solved, 0 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 4/10 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 13 atomic propositions for a total of 12 simplifications.
[2024-05-23 00:38:17] [INFO ] Flatten gal took : 21 ms
[2024-05-23 00:38:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 00:38:17] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:38:17] [INFO ] Input system was already deterministic with 26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:17] [INFO ] Invariant cache hit.
[2024-05-23 00:38:17] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-23 00:38:17] [INFO ] Invariant cache hit.
[2024-05-23 00:38:18] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2909 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 3060ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 3061ms
Finished structural reductions in LTL mode , in 1 iterations and 3715 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:38:21] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4225706097859846794.gal : 2 ms
[2024-05-23 00:38:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7942416770921687975.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4225706097859846794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7942416770921687975.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,1024,0.020827,3444,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: EX(EF(((((ready_4>=1)||(ready_6>=1))||((ready_1>=1)||(ready_3>=1)))||(((ready_2>=1)||(ready_5>=1))||(((((wait_2>=1)&&(theProducts_2>=1))|...310
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((((ready_4>=1)||(ready_6>=1))||((ready_1>=1)||(ready_3>=1)))||(((ready_2>=1)||(ready_5>...362
(forward)formula 0,1,0.024826,3792,1,0,8,591,9,1,231,439,4
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:21] [INFO ] Invariant cache hit.
[2024-05-23 00:38:21] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 00:38:21] [INFO ] Invariant cache hit.
[2024-05-23 00:38:21] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 313ms
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:38:21] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:38:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13503316990051988014.gal : 2 ms
[2024-05-23 00:38:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2465562153636585998.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/CTLFireability13503316990051988014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2465562153636585998.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,1024,0.005017,3560,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: EF(AX(E(EG(EF(((((((wait_3>=1)&&(theProducts_2>=1))&&(theOptions_1>=1))||(((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||((((wai...590
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(EG(E(TRUE U ((((((wait_3>=1)&&(theProducts_2>=1))&&(theOptions_1>=1))||(((wait_3>=1...660
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 12/0/14
(forward)formula 0,1,0.018127,4140,1,0,10,936,24,2,664,663,14
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:21] [INFO ] Invariant cache hit.
[2024-05-23 00:38:21] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 00:38:21] [INFO ] Invariant cache hit.
[2024-05-23 00:38:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 250ms
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:38:22] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:22] [INFO ] Time to serialize gal into /tmp/CTLFireability462834542355876587.gal : 0 ms
[2024-05-23 00:38:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1124491035690524287.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/CTLFireability462834542355876587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1124491035690524287.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,1024,0.004937,3556,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: E((AF(EX(((optionSlots_1>=1)||(optionSlots_2>=1)))) * (AF((AG((((((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((wait_5>=1)&&...2145
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!(EG(!(EX(((optionSlots_1>=1)||(optionSlots_2>=1)))))) * (!(EG(!((!(E(TRUE U !((((((((wait_6>=1...2554
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 8/0/18
Using saturation style SCC detection
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 6/10/20
(forward)formula 0,0,0.062235,5132,1,0,49,7079,53,46,784,8996,83
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
[2024-05-23 00:38:22] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
[2024-05-23 00:38:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:22] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1601134698354438734.gal : 1 ms
[2024-05-23 00:38:22] [INFO ] Time to serialize properties into /tmp/CTLFireability18177767543382240676.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/CTLFireability1601134698354438734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18177767543382240676.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,1024,0.004959,3560,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * ((!(A(((productSlots_1>=1)||(productSlots_2>=1)) U ((((wait_2>=1)&&(theProducts_2>=1))||((wait_2>=1)&&(theProducts_1>=1)))||(...1979
=> equivalent forward existential formula: ((([(FwdU((Init * EX(TRUE)),!(((((wait_2>=1)&&(theProducts_2>=1))||((wait_2>=1)&&(theProducts_1>=1)))||(((wait_1...5200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 6/16/20
(forward)formula 0,1,0.013146,3876,1,0,13,1040,30,6,648,719,11
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
[2024-05-23 00:38:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
[2024-05-23 00:38:22] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 192ms
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:22] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:22] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:38:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2133172977914019440.gal : 1 ms
[2024-05-23 00:38:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17272715162496237366.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/CTLFireability2133172977914019440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17272715162496237366.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,1024,0.013192,3560,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: EX(AX(AG(EX(((productSlots_1<1)&&(productSlots_2<1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(TRUE U !(EX(((productSlots_1<1)&&(productSlots_2<1))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.016557,3876,1,0,8,728,14,1,570,383,6
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
[2024-05-23 00:38:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
[2024-05-23 00:38:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 190ms
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:23] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability1163029039381838667.gal : 0 ms
[2024-05-23 00:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4788081434560754789.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/CTLFireability1163029039381838667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4788081434560754789.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,1024,0.005048,3560,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: EG(EX(((((wait_2>=1)&&(theProducts_2>=1))||((wait_2>=1)&&(theProducts_1>=1)))||(((wait_1>=1)&&(theProducts_2>=1))||((wait_1>=1)&&(theProd...170
=> equivalent forward existential formula: [FwdG(Init,EX(((((wait_2>=1)&&(theProducts_2>=1))||((wait_2>=1)&&(theProducts_1>=1)))||(((wait_1>=1)&&(theProduc...213
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.020351,4140,1,0,42,4419,16,37,601,5934,46
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
[2024-05-23 00:38:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
[2024-05-23 00:38:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:23] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability18187000008780813677.gal : 1 ms
[2024-05-23 00:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13204681867498443926.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/CTLFireability18187000008780813677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13204681867498443926.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,1024,0.005122,3560,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.005568,3560,1,0,6,328,7,1,188,249,1
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
[2024-05-23 00:38:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
[2024-05-23 00:38:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:23] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:23] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16585350019980430001.gal : 1 ms
[2024-05-23 00:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10650119596427247587.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/CTLFireability16585350019980430001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10650119596427247587.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,1024,0.004912,3560,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: EX((EF(((wait_2<1)||(theProducts_1<1))) + (((wait_5>=1)&&(theProducts_1>=1))&&((theOptions_1>=1)&&(theOptions_2>=1)))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * ((wait_2<1)||(theProducts_1<1)))] != FALSE + [(EY(Init) * (((wait_5>=1)&&(theProducts_1...213
(forward)formula 0,1,0.006536,3876,1,0,8,532,9,1,220,344,4
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
[2024-05-23 00:38:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
[2024-05-23 00:38:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 215ms
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:38:24] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:38:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5542978953995585339.gal : 4 ms
[2024-05-23 00:38:24] [INFO ] Time to serialize properties into /tmp/CTLFireability165976919648354488.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/CTLFireability5542978953995585339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability165976919648354488.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,1024,0.005065,3560,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: !(E(EF(EX(AG((ready_5>=1)))) U EG(EF((ready_1>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U EX(!(E(TRUE U !((ready_5>=1))))))),E(TRUE U (ready_1>=1)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.009403,3876,1,0,7,758,24,1,641,459,16
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 10 transition count 21
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 21 place count 10 transition count 15
Applied a total of 21 rules in 13 ms. Remains 10 /20 variables (removed 10) and now considering 15/26 (removed 11) transitions.
// Phase 1: matrix 15 rows 10 cols
[2024-05-23 00:38:24] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 00:38:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 00:38:24] [INFO ] Invariant cache hit.
[2024-05-23 00:38:24] [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-23 00:38:24] [INFO ] Redundant transitions in 18 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-23 00:38:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/20 places, 15/26 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 167 ms. Remains : 10/20 places, 15/26 transitions.
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:24] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:24] [INFO ] Time to serialize gal into /tmp/CTLFireability18275305488148767145.gal : 1 ms
[2024-05-23 00:38:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6484869991334804309.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/CTLFireability18275305488148767145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6484869991334804309.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,32,0.002901,3416,2,16,5,109,6,0,58,85,0


Converting to forward existential form...Done !
original formula: AG((EG(AG((productSlots_2>=1))) + AG((((wait_6>=1)&&(theProducts_1>=1))&&((theOptions_1>=1)&&(theOptions_2>=1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG(!(E(TRUE U !((productSlots_2>=1))))))),TRUE) * !((((wait_6>=1)&&(theProducts_1>=1...209
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.005225,3732,1,0,9,233,25,2,315,165,10
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2024-05-23 00:38:24] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 00:38:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 00:38:24] [INFO ] Invariant cache hit.
[2024-05-23 00:38:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-23 00:38:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 149ms
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 20/20 places, 26/26 transitions.
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:38:24] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3595670122482456376.gal : 0 ms
[2024-05-23 00:38:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6643750731038671254.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/CTLFireability3595670122482456376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6643750731038671254.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,1024,0.005175,3560,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: EX(((AX(FALSE) + EX(TRUE)) * (EF(((((theProducts_2<1)||(theOptions_1<2))||(theOptions_2<1))&&(ready_1<1))) + (((wait_3>=1)&&(theProducts_...184
=> equivalent forward existential formula: ([(FwdU((EY(Init) * (!(EX(!(FALSE))) + EX(TRUE))),TRUE) * ((((theProducts_2<1)||(theOptions_1<2))||(theOptions_2...299
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.008903,3876,1,0,8,925,11,2,619,603,6
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:38:24] [INFO ] Flatten gal took : 1 ms
Total runtime 10265 ms.

BK_STOP 1716424704582

--------------------
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="DrinkVendingMachine-PT-02"
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 DrinkVendingMachine-PT-02, 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 r136-tall-171631133200706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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