fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r311-tall-162132108100282
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for TwoPhaseLocking-PT-nC00100vN

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5700.123 2879663.00 2899622.00 5871.80 FFTFTTFTFTTFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132108100282.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TwoPhaseLocking-PT-nC00100vN, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108100282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC00100vN-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621453203142

Running Version 0
[2021-05-19 19:40:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 19:40:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:40:05] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-19 19:40:05] [INFO ] Transformed 8 places.
[2021-05-19 19:40:05] [INFO ] Transformed 6 transitions.
[2021-05-19 19:40:05] [INFO ] Parsed PT model containing 8 places and 6 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 8 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:40:05] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-19 19:40:05] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:40:05] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-19 19:40:05] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:40:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:40:05] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:40:06] [INFO ] Flatten gal took : 18 ms
[2021-05-19 19:40:06] [INFO ] Flatten gal took : 5 ms
[2021-05-19 19:40:06] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=436 ) properties (out of 60) seen :53
Running SMT prover for 7 properties.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:40:06] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-19 19:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-19 19:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-19 19:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 19:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-19 19:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:40:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
Applied a total of 0 rules in 4 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:40:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:40:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:40:06] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:40:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:40:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:40:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13651982685253716304.gal : 1 ms
[2021-05-19 19:40:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13360505878394549962.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13651982685253716304.gal, -t, CGAL, -ctl, /tmp/CTLFireability13360505878394549962.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13651982685253716304.gal -t CGAL -ctl /tmp/CTLFireability13360505878394549962.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-19 19:40:36] [INFO ] Flatten gal took : 10 ms
[2021-05-19 19:40:36] [INFO ] Applying decomposition
[2021-05-19 19:40:36] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph31188407097809802.txt, -o, /tmp/graph31188407097809802.bin, -w, /tmp/graph31188407097809802.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph31188407097809802.bin, -l, -1, -v, -w, /tmp/graph31188407097809802.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:40:36] [INFO ] Decomposing Gal with order
[2021-05-19 19:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:40:36] [INFO ] Flatten gal took : 20 ms
[2021-05-19 19:40:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-19 19:40:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7447432073166212843.gal : 1 ms
[2021-05-19 19:40:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11659726369610035486.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7447432073166212843.gal, -t, CGAL, -ctl, /tmp/CTLFireability11659726369610035486.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7447432073166212843.gal -t CGAL -ctl /tmp/CTLFireability11659726369610035486.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:41:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:41:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:41:06] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:41:06] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:41:06] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:41:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4003344926595383469.gal : 0 ms
[2021-05-19 19:41:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15764351156520566499.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4003344926595383469.gal, -t, CGAL, -ctl, /tmp/CTLFireability15764351156520566499.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4003344926595383469.gal -t CGAL -ctl /tmp/CTLFireability15764351156520566499.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-19 19:41:36] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:41:36] [INFO ] Applying decomposition
[2021-05-19 19:41:36] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12224776951035766807.txt, -o, /tmp/graph12224776951035766807.bin, -w, /tmp/graph12224776951035766807.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12224776951035766807.bin, -l, -1, -v, -w, /tmp/graph12224776951035766807.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:41:36] [INFO ] Decomposing Gal with order
[2021-05-19 19:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:41:36] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:41:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12014420920249483306.gal : 1 ms
[2021-05-19 19:41:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5115623616939051787.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12014420920249483306.gal, -t, CGAL, -ctl, /tmp/CTLFireability5115623616939051787.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12014420920249483306.gal -t CGAL -ctl /tmp/CTLFireability5115623616939051787.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:42:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:42:06] [INFO ] Flatten gal took : 1 ms
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:42:06] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:42:06] [INFO ] Input system was already deterministic with 6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:42:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:42:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:42:06] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:42:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:42:06] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:42:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7448193479894162168.gal : 1 ms
[2021-05-19 19:42:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1899901261744593074.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7448193479894162168.gal, -t, CGAL, -ctl, /tmp/CTLFireability1899901261744593074.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7448193479894162168.gal -t CGAL -ctl /tmp/CTLFireability1899901261744593074.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-19 19:42:36] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:42:37] [INFO ] Applying decomposition
[2021-05-19 19:42:37] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15065136282981888280.txt, -o, /tmp/graph15065136282981888280.bin, -w, /tmp/graph15065136282981888280.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15065136282981888280.bin, -l, -1, -v, -w, /tmp/graph15065136282981888280.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:42:37] [INFO ] Decomposing Gal with order
[2021-05-19 19:42:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:42:37] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:42:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:42:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16485592705207409800.gal : 1 ms
[2021-05-19 19:42:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15658118087119212144.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16485592705207409800.gal, -t, CGAL, -ctl, /tmp/CTLFireability15658118087119212144.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16485592705207409800.gal -t CGAL -ctl /tmp/CTLFireability15658118087119212144.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:43:07] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:43:07] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:43:07] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:43:07] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:43:07] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:43:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2194470579743867863.gal : 0 ms
[2021-05-19 19:43:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3599185148142230386.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2194470579743867863.gal, -t, CGAL, -ctl, /tmp/CTLFireability3599185148142230386.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2194470579743867863.gal -t CGAL -ctl /tmp/CTLFireability3599185148142230386.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-19 19:43:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:43:37] [INFO ] Applying decomposition
[2021-05-19 19:43:37] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10926914336153398019.txt, -o, /tmp/graph10926914336153398019.bin, -w, /tmp/graph10926914336153398019.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10926914336153398019.bin, -l, -1, -v, -w, /tmp/graph10926914336153398019.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:43:37] [INFO ] Decomposing Gal with order
[2021-05-19 19:43:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:43:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:43:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1010443491562825664.gal : 0 ms
[2021-05-19 19:43:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16384255616250357135.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability1010443491562825664.gal, -t, CGAL, -ctl, /tmp/CTLFireability16384255616250357135.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability1010443491562825664.gal -t CGAL -ctl /tmp/CTLFireability16384255616250357135.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-19 19:44:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:44:07] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:44:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:44:07] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:44:07] [INFO ] Applying decomposition
[2021-05-19 19:44:07] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9790385137065567777.txt, -o, /tmp/graph9790385137065567777.bin, -w, /tmp/graph9790385137065567777.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9790385137065567777.bin, -l, -1, -v, -w, /tmp/graph9790385137065567777.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:44:07] [INFO ] Decomposing Gal with order
[2021-05-19 19:44:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:44:07] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:44:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:44:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15156661198589351136.gal : 1 ms
[2021-05-19 19:44:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16732119072644780475.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15156661198589351136.gal, -t, CGAL, -ctl, /tmp/CTLFireability16732119072644780475.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15156661198589351136.gal -t CGAL -ctl /tmp/CTLFireability16732119072644780475.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-19 20:05:27] [INFO ] Flatten gal took : 2 ms
[2021-05-19 20:05:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10201902274648688970.gal : 1 ms
[2021-05-19 20:05:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4460965180416135627.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability10201902274648688970.gal, -t, CGAL, -ctl, /tmp/CTLFireability4460965180416135627.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability10201902274648688970.gal -t CGAL -ctl /tmp/CTLFireability4460965180416135627.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.012e+07,171.551,1615512,2,190010,5,6.45838e+06,6,0,41,7.81049e+06,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(AG(((((haveAandB>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(!(E(TRUE U !(((((haveAandB>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,222.146,1615512,1,0,6,6.45838e+06,22,0,647,7.81049e+06,8
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(!(EF((A(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))&&(((resA>=1)&&(Clients>=1))||(haveA2andB>=1))) U EG(((resA>=1)&&(haveB>=1)))) + EG(((((((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!((E(!(EG(((resA>=1)&&(haveB>=1)))) U (!(((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))&&(((resA>=1)&&(Clients>=1))||(haveA2andB>=1)))) * !(EG(((resA>=1)&&(haveB>=1)))))) + EG(!(EG(((resA>=1)&&(haveB>=1))))))) + EG(((((((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||(haveA2>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 1,0,650.721,3085892,1,0,125,1.42996e+07,17,78,592,1.7977e+07,4
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (E(E(((resA>=1)&&(Clients>=1)) U (((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))) U (((EF((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + AG(AX((((resA>=1)&&(Clients>=1))||(haveA2andB>=1))))) * ((((E(AG((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) U EF(((haveA2andB>=1)||((resA>=1)&&(haveB>=1))))) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(Clients>=1))) + (haveA2andB>=1)) + ((resA>=1)&&(haveB>=1)))) * ((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1)))) * AX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))))
=> equivalent forward existential formula: ([(Init * !(E(E(((resA>=1)&&(Clients>=1)) U (((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))) U (((E(TRUE U (((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))) + !(E(TRUE U !(!(EX(!((((resA>=1)&&(Clients>=1))||(haveA2andB>=1))))))))) * ((((E(!(E(TRUE U !((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))) U E(TRUE U ((haveA2andB>=1)||((resA>=1)&&(haveB>=1))))) + ((resB>=1)&&(haveA>=1))) + ((resA>=1)&&(Clients>=1))) + (haveA2andB>=1)) + ((resA>=1)&&(haveB>=1)))) * ((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))))))] = FALSE * [(EY(Init) * !(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))))] = FALSE)
Hit Full ! (commute/partial/dont) 2/2/4
(forward)formula 2,1,1051.04,5423568,1,0,125,2.99817e+07,25,78,598,3.45289e+07,23
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(((AX(!(EX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))) + (((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))) * (EG(((resA<1)||(haveB<1))) + EG(((haveAandB<1)&&((resA<1)||(haveB<1)))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * (!(EX(!(!(EX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))))) + (((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))),((resA<1)||(haveB<1)))] != FALSE + [FwdG((FwdU(Init,TRUE) * (!(EX(!(!(EX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))))))) + (((((haveAandB<1)&&(haveA2andB<1))&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1))))),((haveAandB<1)&&((resA<1)||(haveB<1))))] != FALSE)
Hit Full ! (commute/partial/dont) 2/0/4
Hit Full ! (commute/partial/dont) 1/1/5
(forward)formula 3,0,1056.88,5423568,1,0,125,2.99817e+07,43,78,647,3.45289e+07,35
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(((AX(EF((((resA<1)||(Clients<1))&&((resA<1)||(haveB<1))))) + AX((((resB>=1)&&(haveA>=1))||(haveA2andB>=1)))) + (haveAandB>=1)))
=> equivalent forward existential formula: (([(EY(Init) * !(EX(!(E(TRUE U (((resA<1)||(Clients<1))&&((resA<1)||(haveB<1))))))))] != FALSE + [(EY(Init) * !(EX(!((((resB>=1)&&(haveA>=1))||(haveA2andB>=1))))))] != FALSE) + [(EY(Init) * (haveAandB>=1))] != FALSE)
(forward)formula 4,1,1058.75,5423568,1,0,125,2.99817e+07,44,78,648,3.45289e+07,39
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E(((haveAandB<1)&&(haveA2andB<1)) U (!(EF((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))))) + (AF(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) * ((((haveAandB>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))
=> equivalent forward existential formula: ([(FwdU(Init,((haveAandB<1)&&(haveA2andB<1))) * !(E(TRUE U (((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1))))))] != FALSE + [((FwdU(Init,((haveAandB<1)&&(haveA2andB<1))) * ((((haveAandB>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * !(EG(!(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))))] != FALSE)
Hit Full ! (commute/partial/dont) 2/4/4
(forward)formula 5,1,1062.87,5423568,1,0,125,2.99817e+07,61,78,683,3.45289e+07,47
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (AG((EF((((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))||(((haveA2<1)&&(haveAandB<1))&&((resA<1)||(Clients<1))))&&(((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&((resA<1)||(haveB<1)))||(haveA2andB<1)))) * EF(AG((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveA2andB<1)))))) + AX((EX((((((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) * AG(!(EF(((((haveA2>=1)||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))))
=> equivalent forward existential formula: ([(EY((Init * !(!(E(TRUE U !((E(TRUE U (((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))||(((haveA2<1)&&(haveAandB<1))&&((resA<1)||(Clients<1))))&&(((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&((resA<1)||(haveB<1)))||(haveA2andB<1)))) * E(TRUE U !(E(TRUE U !((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveA2andB<1))))))))))))) * !(EX((((((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))))] = FALSE * [(FwdU(FwdU(EY((Init * !(!(E(TRUE U !((E(TRUE U (((((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveA2andB<1))&&((resA<1)||(Clients<1)))&&((resA<1)||(haveB<1)))||(((haveA2<1)&&(haveAandB<1))&&((resA<1)||(Clients<1))))&&(((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveAandB<1))&&((resA<1)||(haveB<1)))||(haveA2andB<1)))) * E(TRUE U !(E(TRUE U !((((haveA2<1)&&((resB<1)||(haveA<1)))&&(haveA2andB<1))))))))))))),TRUE),TRUE) * ((((haveA2>=1)||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))] = FALSE)
(forward)formula 6,0,1200.48,5423568,1,0,125,2.99817e+07,69,78,702,3.45289e+07,57
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(E(((haveAandB>=1)||((resB>=1)&&(haveA>=1))) U AF(EX((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))))) U ((haveA2>=1)||(((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(((haveA2>=1)||(((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))))))) * !(E(!(((haveA2>=1)||(((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1))))) U (!(E(((haveAandB>=1)||((resB>=1)&&(haveA>=1))) U !(EG(!(EX((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1))))))))) * !(((haveA2>=1)||(((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))))))))] != FALSE
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 2/0/4
Detected timeout of ITS tools.
[2021-05-19 20:26:47] [INFO ] Flatten gal took : 3 ms
[2021-05-19 20:26:47] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 20:26:47] [INFO ] Transformed 8 places.
[2021-05-19 20:26:47] [INFO ] Transformed 6 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-19 20:26:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9701448569355699179.gal : 1 ms
[2021-05-19 20:26:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9048572069576556416.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9701448569355699179.gal, -t, CGAL, -ctl, /tmp/CTLFireability9048572069576556416.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9701448569355699179.gal -t CGAL -ctl /tmp/CTLFireability9048572069576556416.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.012e+07,2.50409,57932,2,34188,5,390290,6,0,41,399322,0


Converting to forward existential form...Done !
original formula: A(E(((haveAandB>=1)||((resB>=1)&&(haveA>=1))) U AF(EX((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))))) U ((haveA2>=1)||(((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(((haveA2>=1)||(((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))))))) * !(E(!(((haveA2>=1)||(((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1))))) U (!(E(((haveAandB>=1)||((resB>=1)&&(haveA>=1))) U !(EG(!(EX((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1))))))))) * !(((haveA2>=1)||(((haveA2<1)&&((resB<1)||(haveA<1)))&&((resA<1)||(Clients<1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 2/0/4
(forward)formula 0,1,33.7553,475864,1,0,11,2.30293e+06,32,3,669,2.12772e+06,11
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (!(AG((EF(!(AX((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))) + !(AF((haveAandB>=1)))))) * AF((EF(((((resB>=1)&&(haveA>=1))||((resA>=1)&&(haveB>=1)))&&((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1)))) + A(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1)) U (haveAandB>=1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !((E(TRUE U !(!(EX(!((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))))))) + !(!(EG(!((haveAandB>=1))))))))))] = FALSE * [FwdG(Init,!((E(TRUE U ((((resB>=1)&&(haveA>=1))||((resA>=1)&&(haveB>=1)))&&((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||(haveA2andB>=1)))) + !((E(!((haveAandB>=1)) U (!(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))) * !((haveAandB>=1)))) + EG(!((haveAandB>=1))))))))] = FALSE)
Hit Full ! (commute/partial/dont) 4/0/2
(forward)formula 1,0,68.4493,1012204,1,0,18,5.40805e+06,56,5,709,5.20986e+06,22
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG((EG((!(EX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1))))) + !(E(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) U ((resB>=1)&&(haveA>=1)))))) + ((AG(A((((resB>=1)&&(haveA>=1))||(haveAandB>=1)) U (((haveA2>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) * (((haveA2andB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))) * ((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))
=> equivalent forward existential formula: ((([(FwdU(FwdU((FwdU(Init,TRUE) * !(EG((!(EX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1))))) + !(E(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) U ((resB>=1)&&(haveA>=1)))))))),TRUE),!((((haveA2>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) * (!((((resB>=1)&&(haveA>=1))||(haveAandB>=1))) * !((((haveA2>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))] = FALSE * [FwdG(FwdU((FwdU(Init,TRUE) * !(EG((!(EX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1))))) + !(E(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) U ((resB>=1)&&(haveA>=1)))))))),TRUE),!((((haveA2>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))] = FALSE) * [((FwdU(Init,TRUE) * !(EG((!(EX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1))))) + !(E(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) U ((resB>=1)&&(haveA>=1)))))))) * !((((haveA2andB>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))] = FALSE) * [((FwdU(Init,TRUE) * !(EG((!(EX(((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(haveB>=1))))) + !(E(((((haveA2>=1)||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))) U ((resB>=1)&&(haveA>=1)))))))) * !(((((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1)))))] = FALSE)
Hit Full ! (commute/partial/dont) 1/0/5
Using saturation style SCC detection
(forward)formula 2,0,69.7893,1028548,1,0,29,5.4554e+06,72,10,734,5.28932e+06,29
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EG((((((!(EG((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))&&((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))||(((((resA>=1)&&(Clients>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))))) + !(EG(AF((haveA2>=1))))) + (haveA2>=1)) + (haveAandB>=1)) + (haveA2andB>=1)) + ((resB>=1)&&(haveA>=1))))
=> equivalent forward existential formula: [FwdG(Init,(((((!(EG((((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))&&((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))||(((((resA>=1)&&(Clients>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))&&((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveA2andB>=1))||((resA>=1)&&(Clients>=1))))))) + !(EG(!(EG(!((haveA2>=1))))))) + (haveA2>=1)) + (haveAandB>=1)) + (haveA2andB>=1)) + ((resB>=1)&&(haveA>=1))))] != FALSE
(forward)formula 3,0,71.8707,1048612,1,0,39,5.50409e+06,92,16,750,5.40953e+06,36
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(AF((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((haveA2>=1)||(haveAandB>=1))||((resA>=1)&&(haveB>=1)))))] != FALSE
Hit Full ! (commute/partial/dont) 0/4/6
(forward)formula 4,0,71.9489,1050460,1,0,41,5.51067e+06,99,17,774,5.41238e+06,40
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EX((!(AF(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))) + AG((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1)))))) + EX(((((((haveA2<1)&&(haveA2andB<1))&&((resA<1)||(haveB<1))) * ((!(E((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1))) U (((haveA2>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))) + (resA<1)) + (haveB<1))) + (haveA2andB>=1)) + E((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1)) U ((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))))
=> equivalent forward existential formula: (([FwdG(EY(Init),!(((((((resB>=1)&&(haveA>=1))||(haveAandB>=1))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))))] != FALSE + [(EY(Init) * !(E(TRUE U !((((resA>=1)&&(Clients>=1))||((resA>=1)&&(haveB>=1)))))))] != FALSE) + (((([((EY(Init) * (((haveA2<1)&&(haveA2andB<1))&&((resA<1)||(haveB<1)))) * !(E((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1))) U (((haveA2>=1)||((resA>=1)&&(Clients>=1)))||((resA>=1)&&(haveB>=1))))))] != FALSE + [((EY(Init) * (((haveA2<1)&&(haveA2andB<1))&&((resA<1)||(haveB<1)))) * (resA<1))] != FALSE) + [((EY(Init) * (((haveA2<1)&&(haveA2andB<1))&&((resA<1)||(haveB<1)))) * (haveB<1))] != FALSE) + [(EY(Init) * (haveA2andB>=1))] != FALSE) + [(FwdU(EY(Init),(((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))) * ((((haveA2>=1)||(haveAandB>=1))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1))))] != FALSE))
Hit Full ! (commute/partial/dont) 0/0/6
(forward)formula 5,1,74.1792,1087088,1,0,52,5.61036e+06,119,23,791,5.51531e+06,52
FORMULA TwoPhaseLocking-PT-nC00100vN-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1621456082805

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="TwoPhaseLocking-PT-nC00100vN"
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-4028"
echo " Executing tool itstools"
echo " Input is TwoPhaseLocking-PT-nC00100vN, 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 r311-tall-162132108100282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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