Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r119-tall-174876430400374.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is LamportFastMutEx-COL-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r119-tall-174876430400374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 38K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748770856940

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LamportFastMutEx-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202505121319
[2025-06-01 09:40:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-01 09:40:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:40:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 09:40:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 09:40:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2025-06-01 09:40:58] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 17 ms.
[2025-06-01 09:40:58] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2025-06-01 09:40:58] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-01 09:40:58] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 14 ms.
[2025-06-01 09:40:58] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-01 09:40:58] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 5 ms.
[2025-06-01 09:40:58] [INFO ] Unfolded 17 HLPN properties in 0 ms.
[2025-06-01 09:40:58] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 0 ms.
[2025-06-01 09:40:58] [INFO ] Skeletonized 17 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 09:40:58] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 11 ms.
[2025-06-01 09:40:58] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
Built sparse matrix representations for Structural reductions in 0 ms.16437KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 44/44 places, 62/62 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Applied a total of 0 rules in 9 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 18 ms. Remains : 44/44 places, 62/62 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 44/44 places, 62/62 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-01 09:40:58] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2025-06-01 09:40:59] [INFO ] Computed 10 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 09:40:59] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-01 09:40:59] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-01 09:40:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 09:40:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-01 09:40:59] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 09:40:59] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-01 09:40:59] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-01 09:40:59] [INFO ] Invariant cache hit.
[2025-06-01 09:40:59] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 10 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:40:59] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 18/28 constraints. Problems are: Problem set: 11 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/100 variables, 44/73 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 16/89 constraints. Problems are: Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:00] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/90 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 90 constraints, problems are : Problem set: 12 solved, 48 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 11/15 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/21 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/30 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 56/100 variables, 44/74 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 16/90 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 48/138 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/100 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 138 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4068ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 4074ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 44/44 places, 50/62 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 09:41:03] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 4395 ms. Remains : 44/44 places, 50/62 transitions.
Random walk for 1250000 steps, including 0 resets, run took 917 ms (no deadlock found). (steps per millisecond=1363 )
Random directed walk for 1250000 steps, including 0 resets, run took 640 ms (no deadlock found). (steps per millisecond=1953 )
[2025-06-01 09:41:04] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2025-06-01 09:41:04] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 09:41:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 09:41:04] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 09:41:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 09:41:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 09:41:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 09:41:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 09:41:05] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:41:05] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 3 ms to minimize.
[2025-06-01 09:41:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 505 ms
[2025-06-01 09:41:05] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 2 ms.
[2025-06-01 09:41:05] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
RANDOM walk for 225 steps (0 resets) in 33 ms. (6 steps per ms) remains 0/16 properties
[2025-06-01 09:41:05] [INFO ] Flatten gal took : 28 ms
[2025-06-01 09:41:05] [INFO ] Flatten gal took : 9 ms
[2025-06-01 09:41:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5839060459117450635.gal : 6 ms
[2025-06-01 09:41:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6385601921153026140.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5839060459117450635.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6385601921153026140.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 17 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
[2025-06-01 09:41:05] [INFO ] Flatten gal took : 6 ms
[2025-06-01 09:41:05] [INFO ] Flatten gal took : 11 ms
[2025-06-01 09:41:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2632494919456877779.gal : 2 ms
[2025-06-01 09:41:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5084971753741351600.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2632494919456877779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5084971753741351600.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,380,0.0264,4540,2,479,5,2275,6,0,240,2421,0


Converting to forward existential form...Done !
original formula: AG(EF((((((((P_start_1_1==1)&&(P_start_1_2==1))&&((x_0==1)&&(x_1==0)))&&(((x_2==0)&&(y_0==1))&&((y_1==0)&&(y_2==0))))&&((((P_b_2==1)&&(P_...802
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((P_start_1_1==1)&&(P_start_1_2==1))&&((x_0==1)&&(x_1==0)))&&(((x_2==0)&&(y_...862
Reverse transition relation is NOT exact ! Due to transitions T_setx_3x0i1, T_setx_3x0i2, T_setx_3x1i1, T_setx_3x1i2, T_setx_3x2i1, T_setx_3x2i2, T_awaityi...551
(forward)formula 0,0,0.078895,6588,1,0,127,12746,131,52,1666,10148,118
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
[2025-06-01 09:41:05] [INFO ] Flatten gal took : 13 ms
[2025-06-01 09:41:05] [INFO ] Flatten gal took : 8 ms
[2025-06-01 09:41:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9068037975384532949.gal : 2 ms
[2025-06-01 09:41:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17861456932627088703.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9068037975384532949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17861456932627088703.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 17 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,380,0.019461,4588,2,479,5,2275,6,0,240,2421,0


Converting to forward existential form...Done !
original formula: AG(EF(((((P_start_1_2>=1)&&(P_b_5>=1))||((P_start_1_2>=1)&&(P_b_4>=1)))||(((P_start_1_1>=1)&&(P_b_3>=1))||((P_start_1_1>=1)&&(P_b_2>=1)))...158
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_start_1_2>=1)&&(P_b_5>=1))||((P_start_1_2>=1)&&(P_b_4>=1)))||(((P_start_1_1...218
Reverse transition relation is NOT exact ! Due to transitions T_setx_3x0i1, T_setx_3x0i2, T_setx_3x1i1, T_setx_3x1i2, T_setx_3x2i1, T_setx_3x2i2, T_awaityi...551
(forward)formula 0,1,0.090579,8300,1,0,138,22073,131,58,1588,19010,138
Formula is TRUE !

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

original formula: AG(EF((((((x_1>=1)&&(P_setx_3_2>=1))||((x_1>=1)&&(P_setx_3_1>=1)))||(((x_2>=1)&&(P_setx_3_1>=1))||((x_2>=1)&&(P_setx_3_2>=1))))||(((x_0>=...208
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((x_1>=1)&&(P_setx_3_2>=1))||((x_1>=1)&&(P_setx_3_1>=1)))||(((x_2>=1)&&(P_setx...268
(forward)formula 1,1,0.105737,9196,1,0,151,26099,132,64,1591,23053,155
Formula is TRUE !

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

original formula: AG(EF(((((y_1>=1)&&(P_ify0_4_1>=1))||((y_1>=1)&&(P_ify0_4_2>=1)))||(((y_2>=1)&&(P_ify0_4_1>=1))||((y_2>=1)&&(P_ify0_4_2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((y_1>=1)&&(P_ify0_4_1>=1))||((y_1>=1)&&(P_ify0_4_2>=1)))||(((y_2>=1)&&(P_ify0_...206
(forward)formula 2,1,0.159683,11372,1,0,182,39446,133,81,1593,35497,201
Formula is TRUE !

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

original formula: AG(EF(((((P_b_3>=1)&&(P_setbi_5_1>=1))||((P_b_5>=1)&&(P_setbi_5_2>=1)))||(((P_b_4>=1)&&(P_setbi_5_2>=1))||((P_b_2>=1)&&(P_setbi_5_1>=1)))...158
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_b_3>=1)&&(P_setbi_5_1>=1))||((P_b_5>=1)&&(P_setbi_5_2>=1)))||(((P_b_4>=1)&&...218
(forward)formula 3,1,0.186463,12908,1,0,209,46904,134,95,1596,43434,237
Formula is TRUE !

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

original formula: AG(EF((((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_2>=1))))))] = FALSE
(forward)formula 4,1,0.23682,14700,1,0,228,57206,135,107,1597,53030,268
Formula is TRUE !

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

original formula: AG(EF((((y_0>=1)&&(P_ify0_4_1>=1))||((y_0>=1)&&(P_ify0_4_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((y_0>=1)&&(P_ify0_4_1>=1))||((y_0>=1)&&(P_ify0_4_2>=1))))))] = FALSE
(forward)formula 5,1,0.260897,16108,1,0,244,64017,136,116,1598,59854,294
Formula is TRUE !

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

original formula: AG(EF((((((y_2>=1)&&(P_sety_9_2>=1))||((y_0>=1)&&(P_sety_9_1>=1)))||(((y_2>=1)&&(P_sety_9_1>=1))||((y_1>=1)&&(P_sety_9_1>=1))))||(((y_1>=...208
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((y_2>=1)&&(P_sety_9_2>=1))||((y_0>=1)&&(P_sety_9_1>=1)))||(((y_2>=1)&&(P_sety...268
(forward)formula 6,1,0.293958,17096,1,0,259,67735,137,124,1601,63634,315
Formula is TRUE !

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

original formula: AG(EF(((((x_0>=1)&&(P_ifxi_10_2>=1))||((x_2>=1)&&(P_ifxi_10_1>=1)))||(((x_0>=1)&&(P_ifxi_10_1>=1))||((x_1>=1)&&(P_ifxi_10_2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((x_0>=1)&&(P_ifxi_10_2>=1))||((x_2>=1)&&(P_ifxi_10_1>=1)))||(((x_0>=1)&&(P_ifx...210
(forward)formula 7,1,0.324944,18376,1,0,290,77206,138,141,1603,72631,361
Formula is TRUE !

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

original formula: AG(EF(((((P_b_4>=1)&&(P_setbi_11_2>=1))||((P_b_3>=1)&&(P_setbi_11_1>=1)))||(((P_b_5>=1)&&(P_setbi_11_2>=1))||((P_b_2>=1)&&(P_setbi_11_1>=...162
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_b_4>=1)&&(P_setbi_11_2>=1))||((P_b_3>=1)&&(P_setbi_11_1>=1)))||(((P_b_5>=1)...222
(forward)formula 8,1,0.350413,19528,1,0,322,83785,139,158,1606,79637,407
Formula is TRUE !

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

original formula: AG(EF(((P_fordo_12_1>=1)||(P_fordo_12_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((P_fordo_12_1>=1)||(P_fordo_12_2>=1)))))] = FALSE
(forward)formula 9,1,0.368787,20424,1,0,354,89161,140,175,1607,84535,453
Formula is TRUE !

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

original formula: AG(EF((((((P_b_2>=1)&&(P_wait_7>=1))&&(P_await_13_2>=1))||(((P_b_4>=1)&&(P_wait_8>=1))&&(P_await_13_2>=1)))||((((P_b_4>=1)&&(P_wait_5>=1)...230
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((P_b_2>=1)&&(P_wait_7>=1))&&(P_await_13_2>=1))||(((P_b_4>=1)&&(P_wait_8>=1))&...290
(forward)formula 10,1,0.38496,21064,1,0,382,92694,141,189,1613,88927,490
Formula is TRUE !

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

original formula: AG(EF(((((P_await_13_1>=1)&&(P_done_4>=1))&&(P_done_5>=1))||(((P_await_13_2>=1)&&(P_done_7>=1))&&(P_done_8>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_await_13_1>=1)&&(P_done_4>=1))&&(P_done_5>=1))||(((P_await_13_2>=1)&&(P_don...192
(forward)formula 11,1,0.40291,21832,1,0,409,96924,142,203,1616,93668,526
Formula is TRUE !

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

original formula: AG(EF(((((y_2>=1)&&(P_ifyi_15_1>=1))||((y_0>=1)&&(P_ifyi_15_1>=1)))||(((y_1>=1)&&(P_ifyi_15_2>=1))||((y_0>=1)&&(P_ifyi_15_2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((y_2>=1)&&(P_ifyi_15_1>=1))||((y_0>=1)&&(P_ifyi_15_1>=1)))||(((y_1>=1)&&(P_ify...210
(forward)formula 12,1,0.430852,22984,1,0,437,103336,143,221,1618,99945,573
Formula is TRUE !

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

original formula: AG(EF((((y_2>=1)&&(P_ifyi_15_2>=1))||((y_1>=1)&&(P_ifyi_15_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((y_2>=1)&&(P_ifyi_15_2>=1))||((y_1>=1)&&(P_ifyi_15_1>=1))))))] = FALSE
(forward)formula 13,1,0.496759,24392,1,0,462,109688,144,235,1619,106579,608
Formula is TRUE !

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

original formula: AG(EF((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1))))))] = FALSE
(forward)formula 14,1,0.514405,25288,1,0,477,114558,145,243,1620,111431,630
Formula is TRUE !

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

original formula: AG(EF((((((y_1>=1)&&(P_CS_21_2>=1))||((y_0>=1)&&(P_CS_21_1>=1)))||(((y_0>=1)&&(P_CS_21_2>=1))||((y_2>=1)&&(P_CS_21_1>=1))))||(((y_2>=1)&&...202
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((y_1>=1)&&(P_CS_21_2>=1))||((y_0>=1)&&(P_CS_21_1>=1)))||(((y_0>=1)&&(P_CS_21_...262
(forward)formula 15,1,0.538934,26440,1,0,490,120666,146,249,1623,117389,647
Formula is TRUE !

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

original formula: AG(EF(((((P_b_3>=1)&&(P_setbi_24_1>=1))||((P_b_5>=1)&&(P_setbi_24_2>=1)))||(((P_b_4>=1)&&(P_setbi_24_2>=1))||((P_b_2>=1)&&(P_setbi_24_1>=...162
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_b_3>=1)&&(P_setbi_24_1>=1))||((P_b_5>=1)&&(P_setbi_24_2>=1)))||(((P_b_4>=1)...222
(forward)formula 16,1,0.55957,27464,1,0,502,125982,147,255,1626,122866,664
Formula is TRUE !

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

Able to resolve query Liveness after proving 18 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS TOPOLOGICAL INITIAL_STATE
Total runtime 8402 ms.

BK_STOP 1748770866605

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="LamportFastMutEx-COL-2"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-2, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r119-tall-174876430400374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;