Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r277-smll-171654416800129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Peterson-COL-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r277-smll-171654416800129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.1K Apr 12 02:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 1716764441914

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202405141337
[2024-05-26 23:00:44] [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]
[2024-05-26 23:00:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:00:44] [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.
[2024-05-26 23:00:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 23:00:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1261 ms
[2024-05-26 23:00:45] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 43 ms.
[2024-05-26 23:00:45] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 10 ms.
[2024-05-26 23:00:45] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-26 23:00:45] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 38 ms.
[2024-05-26 23:00:45] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-26 23:00:45] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 15 ms.
[2024-05-26 23:00:45] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-26 23:00:45] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 0 ms.
[2024-05-26 23:00:45] [INFO ] Skeletonized 14 HLPN properties in 2 ms.
Reduce places removed 2 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 [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2024-05-26 23:00:45] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 31 ms.
[2024-05-26 23:00:45] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.21807KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 29 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 54 ms. Remains : 102/102 places, 126/126 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 23:00:46] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 23:00:46] [INFO ] Computed 11 invariants in 23 ms
[2024-05-26 23:00:46] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-26 23:00:46] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 23:00:46] [INFO ] Invariant cache hit.
[2024-05-26 23:00:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 23:00:46] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-26 23:00:46] [INFO ] Redundant transitions in 6 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-26 23:00:46] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 23:00:46] [INFO ] Invariant cache hit.
[2024-05-26 23:00:46] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 29 ms to minimize.
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 3 ms to minimize.
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-26 23:00:48] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-26 23:00:49] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-26 23:00:49] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-26 23:00:49] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-26 23:00:49] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-26 23:00:49] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-05-26 23:00:49] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-26 23:00:49] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-26 23:00:49] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 23:00:50] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 4 ms to minimize.
[2024-05-26 23:00:50] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 23:00:51] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 23:00:51] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 12347 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6902 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 19412ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 19446ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 20128 ms. Remains : 102/102 places, 126/126 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1304 ms (no deadlock found). (steps per millisecond=958 )
Random directed walk for 1250000 steps, including 0 resets, run took 848 ms (no deadlock found). (steps per millisecond=1474 )
[2024-05-26 23:01:08] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 23:01:08] [INFO ] Invariant cache hit.
[2024-05-26 23:01:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-26 23:01:08] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 6 ms returned unsat
[2024-05-26 23:01:08] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 5 ms.
[2024-05-26 23:01:08] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
[2024-05-26 23:01:08] [INFO ] Flatten gal took : 106 ms
RANDOM walk for 40000 steps (8 resets) in 1151 ms. (34 steps per ms) remains 1/13 properties
[2024-05-26 23:01:08] [INFO ] Flatten gal took : 37 ms
[2024-05-26 23:01:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6329560425887680218.gal : 16 ms
[2024-05-26 23:01:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10299852670768154291.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6329560425887680218.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10299852670768154291.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10299852670768154291.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 1/1 properties
[2024-05-26 23:01:08] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
[2024-05-26 23:01:08] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 23
[2024-05-26 23:01:08] [INFO ] State equation strengthened by 22 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 59
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :59 after 594
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :594 after 976
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Reachability property qltransition_13 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1559,0.1192,5068,2,1080,13,6318,6,0,537,4035,0
Total reachable state count : 1559

Verifying 1 reachability properties.
Reachability property qltransition_13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_13,1,0.121195,5328,2,103,13,6318,7,0,544,4035,0
After SMT solving in domain Real declared 93/222 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 6/8 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/102 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Able to resolve query QuasiLiveness after proving 14 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
[2024-05-26 23:01:09] [INFO ] Flatten gal took : 28 ms
[2024-05-26 23:01:09] [INFO ] Flatten gal took : 26 ms
[2024-05-26 23:01:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15335898706263218002.gal : 7 ms
[2024-05-26 23:01:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6115959827997497250.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15335898706263218002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6115959827997497250.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.449022,11492,2,3064,5,29503,6,0,537,38664,0


Converting to forward existential form...Done !
original formula: AG(EF(((((Idle_0==1)&&(Idle_1==1))&&((Idle_2==1)&&(WantSection_0==1)))&&(((WantSection_2==1)&&(WantSection_4==1))&&((Turn_0==1)&&(Turn_3=...163
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((Idle_0==1)&&(Idle_1==1))&&((Idle_2==1)&&(WantSection_0==1)))&&(((WantSection_...223
Reverse transition relation is NOT exact ! Due to transitions UpdateTurnj0i0k0, UpdateTurnj0i0k1, UpdateTurnj0i0k2, UpdateTurnj0i1k0, UpdateTurnj0i1k1, Upd...662
(forward)formula 0,0,1.94781,43544,1,0,283,185650,273,148,3146,132489,305
ITS tools runner thread asked to quit. Dying gracefully.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 12 transitions.
[2024-05-26 23:01:11] [INFO ] Flatten gal took : 15 ms
[2024-05-26 23:01:11] [INFO ] Flatten gal took : 15 ms
[2024-05-26 23:01:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11170544321434401473.gal : 3 ms
[2024-05-26 23:01:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16564963784399318613.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11170544321434401473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16564963784399318613.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 14 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,20754,0.306209,11564,2,3064,5,29503,6,0,537,38664,0


Converting to forward existential form...Done !
original formula: AG(EF(((((Idle_1>=1)&&(WantSection_2>=1))||((Idle_0>=1)&&(WantSection_0>=1)))||((Idle_2>=1)&&(WantSection_4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((Idle_1>=1)&&(WantSection_2>=1))||((Idle_0>=1)&&(WantSection_0>=1)))||((Idle_2...193
Reverse transition relation is NOT exact ! Due to transitions UpdateTurnj0i0k0, UpdateTurnj0i0k1, UpdateTurnj0i0k2, UpdateTurnj0i1k0, UpdateTurnj0i1k1, Upd...662
(forward)formula 0,1,2.64867,60040,1,0,271,315178,273,139,3123,214691,290
Formula is TRUE !

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

original formula: AG(EF((((((((AskForSection_3>=1)&&(Turn_3>=1))||((AskForSection_3>=1)&&(Turn_4>=1)))||(((AskForSection_2>=1)&&(Turn_0>=1))||((AskForSecti...724
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((AskForSection_3>=1)&&(Turn_3>=1))||((AskForSection_3>=1)&&(Turn_4>=1)))||(...784
(forward)formula 1,1,2.89938,68192,1,0,279,371709,274,143,3131,244828,302
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-26 23:01:14] [INFO ] Flatten gal took : 13 ms
[2024-05-26 23:01:14] [INFO ] Applying decomposition
[2024-05-26 23:01:14] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph807472811144150828.txt' '-o' '/tmp/graph807472811144150828.bin' '-w' '/tmp/graph807472811144150828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph807472811144150828.bin' '-l' '-1' '-v' '-w' '/tmp/graph807472811144150828.weights' '-q' '0' '-e' '0.001'
[2024-05-26 23:01:14] [INFO ] Decomposing Gal with order
[2024-05-26 23:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 23:01:14] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-26 23:01:14] [INFO ] Flatten gal took : 47 ms
[2024-05-26 23:01:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 13 ms.
[2024-05-26 23:01:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3335354848545253359.gal : 6 ms
[2024-05-26 23:01:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13996881302920022616.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3335354848545253359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13996881302920022616.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 12 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,20754,0.236366,10596,532,55,9743,209,382,40806,69,808,0


Converting to forward existential form...Done !
original formula: AG(EF((((((i2.u4.Turn_1>=1)&&(i2.u4.TestTurn_2>=1))||((i3.u6.Turn_5>=1)&&(i3.u6.TestTurn_5>=1)))||(((i3.u6.Turn_4>=1)&&(i5.i1.u28.TestTur...305
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i2.u4.Turn_1>=1)&&(i2.u4.TestTurn_2>=1))||((i3.u6.Turn_5>=1)&&(i3.u6.TestTur...365
Reverse transition relation is NOT exact ! Due to transitions UpdateTurnj0i2k1, UpdateTurnj0i2k2, UpdateTurnj1i1k0, UpdateTurnj1i1k1, BecomeIdlei0, BecomeI...662
(forward)formula 0,1,0.469917,12972,1,0,13532,499,1789,56538,323,1904,45632
Formula is TRUE !

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

original formula: AG(EF(((((((i2.u4.Turn_0>=1)&&(i1.i0.u5.TestTurn_4>=1))||((i2.u4.Turn_1>=1)&&(i2.u7.TestTurn_0>=1)))||(((i2.u4.Turn_2>=1)&&(i2.u7.TestTur...588
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i2.u4.Turn_0>=1)&&(i1.i0.u5.TestTurn_4>=1))||((i2.u4.Turn_1>=1)&&(i2.u7.Tes...648
(forward)formula 1,1,0.557924,15084,1,0,16759,554,1871,70054,333,2079,55210
Formula is TRUE !

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

original formula: AG(EF((((i5.i1.u23.EndTurn_3>=1)||(i3.u21.EndTurn_5>=1))||(i3.u22.EndTurn_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i5.i1.u23.EndTurn_3>=1)||(i3.u21.EndTurn_5>=1))||(i3.u22.EndTurn_1>=1)))))] = ...160
(forward)formula 2,1,0.657061,17724,1,0,21327,559,1880,83693,333,2124,66629
Formula is TRUE !

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

original formula: AG(EF((((i1.i2.u35.EndTurn_4>=1)||(i2.u19.EndTurn_0>=1))||(i2.u20.EndTurn_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i1.i2.u35.EndTurn_4>=1)||(i2.u19.EndTurn_0>=1))||(i2.u20.EndTurn_2>=1)))))] = ...160
(forward)formula 3,1,0.726869,19572,1,0,24226,563,1889,93834,333,2138,74272
Formula is TRUE !

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

original formula: AG(EF(((((i6.i0.u1.WantSection_3>=1)&&(i5.i1.u23.CS_1>=1))||((i1.i1.u0.WantSection_1>=1)&&(i3.u22.CS_0>=1)))||((i2.u2.WantSection_5>=1)&&...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i6.i0.u1.WantSection_3>=1)&&(i5.i1.u23.CS_1>=1))||((i1.i1.u0.WantSection_1>=1...235
(forward)formula 4,1,0.776896,20628,1,0,26589,563,1904,96867,333,2140,79803
Formula is TRUE !

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

original formula: AG(EF(((((((i0.u26.BeginLoop_5>=1)||(i2.u27.BeginLoop_6>=1))||((i7.u11.BeginLoop_7>=1)||(i7.u12.BeginLoop_8>=1)))||(((i5.i1.u28.BeginLoop...547
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i0.u26.BeginLoop_5>=1)||(i2.u27.BeginLoop_6>=1))||((i7.u11.BeginLoop_7>=1)|...607
(forward)formula 5,1,0.823154,21948,1,0,28822,577,1967,102097,333,2189,86460
Formula is TRUE !

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

original formula: AG(EF(((((i5.i0.u29.TestIdentity_10>=1)||(i1.i2.u16.TestIdentity_14>=1))||((i6.i0.u18.TestIdentity_17>=1)||(i4.i1.u24.TestIdentity_0>=1))...216
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i5.i0.u29.TestIdentity_10>=1)||(i1.i2.u16.TestIdentity_14>=1))||((i6.i0.u18.T...276
(forward)formula 6,1,0.889555,23268,1,0,30977,582,1983,109812,333,2205,91872
Formula is TRUE !

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

original formula: AG(EF((((((i5.i0.u14.TestIdentity_11>=1)||(i1.i1.u31.TestIdentity_13>=1))||((i1.i0.u30.TestIdentity_12>=1)||(i3.u17.TestIdentity_15>=1)))...408
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i5.i0.u14.TestIdentity_11>=1)||(i1.i1.u31.TestIdentity_13>=1))||((i1.i0.u30....468
(forward)formula 7,1,0.923101,24324,1,0,32538,594,2020,113300,333,2221,96820
Formula is TRUE !

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

original formula: AG(EF((((((i7.u34.IsEndLoop_7>=1)||(i7.u11.IsEndLoop_6>=1))||((i5.i0.u13.IsEndLoop_9>=1)||(i5.i0.u29.IsEndLoop_10>=1)))||(((i1.i2.u16.IsE...373
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i7.u34.IsEndLoop_7>=1)||(i7.u11.IsEndLoop_6>=1))||((i5.i0.u13.IsEndLoop_9>=1...433
(forward)formula 8,1,0.960699,25116,1,0,34537,598,2055,116241,333,2233,101837
Formula is TRUE !

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

original formula: AG(EF(((((((i6.i0.u1.WantSection_3>=1)&&(i4.i1.u25.TestAlone_1>=1))||((i6.i0.u1.WantSection_3>=1)&&(i1.i1.u31.TestAlone_13>=1)))||(((i2.u...732
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i6.i0.u1.WantSection_3>=1)&&(i4.i1.u25.TestAlone_1>=1))||((i6.i0.u1.WantSec...792
(forward)formula 9,1,0.998087,26172,1,0,35345,601,2128,117829,333,2237,105023
Formula is TRUE !

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

original formula: AG(EF(((((((i6.i0.u1.WantSection_2>=1)&&(i6.i1.u32.TestAlone_16>=1))||((i2.u2.WantSection_4>=1)&&(i5.i0.u14.TestAlone_11>=1)))||(((i6.i0....732
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i6.i0.u1.WantSection_2>=1)&&(i6.i1.u32.TestAlone_16>=1))||((i2.u2.WantSecti...792
(forward)formula 10,1,1.05269,27228,1,0,38325,604,2185,122918,333,2238,111985
Formula is TRUE !

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

original formula: AG(EF(((((i2.u20.IsEndLoop_8>=1)||(i5.i1.u23.IsEndLoop_11>=1))||((i1.i2.u35.IsEndLoop_14>=1)||(i3.u21.IsEndLoop_17>=1)))||((i2.u19.IsEndL...193
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i2.u20.IsEndLoop_8>=1)||(i5.i1.u23.IsEndLoop_11>=1))||((i1.i2.u35.IsEndLoop_1...253
(forward)formula 11,0,1.08618,28548,1,0,40369,604,2205,128390,333,2244,117348
FORMULA Liveness FALSE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL INITIAL_STATE USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 31627 ms.

BK_STOP 1716764475763

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="Peterson-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-5568"
echo " Executing tool itstools"
echo " Input is Peterson-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 r277-smll-171654416800129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;