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.r147-tall-162089138100349.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 Peterson-COL-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089138100349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K May 5 16:51 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 1620948507078

Running Version 0
[2021-05-13 23:28:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -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, 1800]
[2021-05-13 23:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:28:28] [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.
[2021-05-13 23:28:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-13 23:28:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2021-05-13 23:28:29] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 18 ms.
[2021-05-13 23:28:29] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 4 ms.
[2021-05-13 23:28:29] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_9448965276466720813.dot
[2021-05-13 23:28:29] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 19 ms.
[2021-05-13 23:28:29] [INFO ] Unfolded HLPN properties in 0 ms.
[2021-05-13 23:28:29] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 9 ms.
[2021-05-13 23:28:29] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_1473861192334718515.dot
[2021-05-13 23:28:29] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 1 ms.
[2021-05-13 23:28:29] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1002_6827335191960904718.dot
Reduce places removed 2 places and 0 transitions.
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
[2021-05-13 23:28:29] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 2 ms.
[2021-05-13 23:28:29] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1003_12620290639515807049.dot
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 1 ms.12856KB memory used
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 126/126 transitions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-13 23:28:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-13 23:28:29] [INFO ] Computed 11 place invariants in 11 ms
[2021-05-13 23:28:29] [INFO ] Implicit Places using invariants in 119 ms returned []
[2021-05-13 23:28:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-13 23:28:29] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-13 23:28:29] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-13 23:28:29] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2021-05-13 23:28:29] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-13 23:28:29] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-13 23:28:29] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-13 23:28:29] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 126/126 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2015 ms (no deadlock found). (steps per millisecond=620 )
Random directed walk for 1250000 steps, including 0 resets, run took 1163 ms (no deadlock found). (steps per millisecond=1074 )
[2021-05-13 23:28:32] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-13 23:28:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-13 23:28:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:28:32] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned unsat
[2021-05-13 23:28:32] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 2 ms.
[2021-05-13 23:28:32] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1004_587315297398821729.dot
[2021-05-13 23:28:33] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2021-05-13 23:28:33] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-13 23:28:33] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 23:28:33] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-13 23:28:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:28:33] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-13 23:28:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-13 23:28:33] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:28:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:28:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-13 23:28:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:28:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-13 23:28:33] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:28:33] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
[2021-05-13 23:28:33] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:28:33] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:28:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2021-05-13 23:28:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 153 ms
[2021-05-13 23:28:33] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 9 ms.
[2021-05-13 23:28:33] [INFO ] Added : 61 causal constraints over 13 iterations in 138 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 7200 steps, including 405 resets, run finished after 27 ms. (steps per millisecond=266 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 64 place count 70 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 50 transition count 74
Applied a total of 104 rules in 11 ms. Remains 50 /102 variables (removed 52) and now considering 74/126 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/102 places, 74/126 transitions.
[2021-05-13 23:28:33] [INFO ] Flatten gal took : 27 ms
[2021-05-13 23:28:33] [INFO ] Flatten gal took : 9 ms
[2021-05-13 23:28:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2184811134440672521.gal : 4 ms
[2021-05-13 23:28:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4731980407741452841.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2184811134440672521.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4731980407741452841.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2184811134440672521.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4731980407741452841.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4731980407741452841.prop.
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
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 33
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 33 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,45,0.019401,4276,2,217,10,1331,6,0,277,708,0
Total reachable state count : 45

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,2,0.020247,4648,2,56,10,1331,7,0,284,708,0
Able to resolve query QuasiLiveness after proving 14 properties.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 12 transitions.
[2021-05-13 23:28:33] [INFO ] Flatten gal took : 12 ms
[2021-05-13 23:28:33] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:28:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15902147190145842206.gal : 3 ms
[2021-05-13 23:28:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7777921687428969694.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/CTLFireability15902147190145842206.gal, -t, CGAL, -ctl, /tmp/CTLFireability7777921687428969694.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/CTLFireability15902147190145842206.gal -t CGAL -ctl /tmp/CTLFireability7777921687428969694.ctl --gen-order FOLLOW
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.215173,12472,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>=1)&&(WantSection_4>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions UpdateTurnj0k0i0, UpdateTurnj0k0i1, UpdateTurnj0k0i2, UpdateTurnj0k1i0, UpdateTurnj0k1i1, UpdateTurnj0k1i2, UpdateTurnj0k2i0, UpdateTurnj0k2i1, UpdateTurnj0k2i2, UpdateTurnj1k0i0, UpdateTurnj1k0i1, UpdateTurnj1k0i2, UpdateTurnj1k1i0, UpdateTurnj1k1i1, UpdateTurnj1k1i2, UpdateTurnj1k2i0, UpdateTurnj1k2i1, UpdateTurnj1k2i2, BecomeIdlei0, BecomeIdlei1, BecomeIdlei2, NotAlonej0k1i2, NotAlonej0k2i0, NotAlonej0k2i1, NotAlonej1k1i2, NotAlonej1k2i0, NotAlonej1k2i1, EndLoopj0i0, EndLoopj0i1, EndLoopj0i2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/30/126
(forward)formula 0,1,1.69608,61276,1,0,271,315178,273,139,3130,214663,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)))||((AskForSection_2>=1)&&(Turn_1>=1)))||((AskForSection_0>=1)&&(Turn_0>=1)))||((AskForSection_2>=1)&&(Turn_2>=1)))||((AskForSection_0>=1)&&(Turn_1>=1)))||((AskForSection_0>=1)&&(Turn_2>=1)))||((AskForSection_4>=1)&&(Turn_0>=1)))||((AskForSection_4>=1)&&(Turn_1>=1)))||((AskForSection_4>=1)&&(Turn_2>=1)))||((AskForSection_5>=1)&&(Turn_5>=1)))||((AskForSection_5>=1)&&(Turn_3>=1)))||((AskForSection_5>=1)&&(Turn_4>=1)))||((AskForSection_1>=1)&&(Turn_5>=1)))||((AskForSection_1>=1)&&(Turn_3>=1)))||((AskForSection_3>=1)&&(Turn_5>=1)))||((AskForSection_1>=1)&&(Turn_4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((((((((((((((AskForSection_3>=1)&&(Turn_3>=1))||((AskForSection_3>=1)&&(Turn_4>=1)))||((AskForSection_2>=1)&&(Turn_0>=1)))||((AskForSection_2>=1)&&(Turn_1>=1)))||((AskForSection_0>=1)&&(Turn_0>=1)))||((AskForSection_2>=1)&&(Turn_2>=1)))||((AskForSection_0>=1)&&(Turn_1>=1)))||((AskForSection_0>=1)&&(Turn_2>=1)))||((AskForSection_4>=1)&&(Turn_0>=1)))||((AskForSection_4>=1)&&(Turn_1>=1)))||((AskForSection_4>=1)&&(Turn_2>=1)))||((AskForSection_5>=1)&&(Turn_5>=1)))||((AskForSection_5>=1)&&(Turn_3>=1)))||((AskForSection_5>=1)&&(Turn_4>=1)))||((AskForSection_1>=1)&&(Turn_5>=1)))||((AskForSection_1>=1)&&(Turn_3>=1)))||((AskForSection_3>=1)&&(Turn_5>=1)))||((AskForSection_1>=1)&&(Turn_4>=1))))))] = FALSE
(forward)formula 1,1,1.89623,69144,1,0,279,371709,274,143,3138,244800,302
Formula is TRUE !

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

original formula: AG(EF((((((((Turn_1>=1)&&(TestTurn_2>=1))||((Turn_5>=1)&&(TestTurn_5>=1)))||((Turn_4>=1)&&(TestTurn_3>=1)))||((Turn_3>=1)&&(TestTurn_1>=1)))||((Turn_0>=1)&&(TestTurn_0>=1)))||((Turn_2>=1)&&(TestTurn_4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((Turn_1>=1)&&(TestTurn_2>=1))||((Turn_5>=1)&&(TestTurn_5>=1)))||((Turn_4>=1)&&(TestTurn_3>=1)))||((Turn_3>=1)&&(TestTurn_1>=1)))||((Turn_0>=1)&&(TestTurn_0>=1)))||((Turn_2>=1)&&(TestTurn_4>=1))))))] = FALSE
(forward)formula 2,1,2.05486,74952,1,0,283,412152,275,145,3143,267126,309
Formula is TRUE !

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

original formula: AG(EF((((((((((((((Turn_0>=1)&&(TestTurn_4>=1))||((Turn_1>=1)&&(TestTurn_0>=1)))||((Turn_2>=1)&&(TestTurn_0>=1)))||((Turn_5>=1)&&(TestTurn_3>=1)))||((Turn_5>=1)&&(TestTurn_1>=1)))||((Turn_4>=1)&&(TestTurn_1>=1)))||((Turn_3>=1)&&(TestTurn_3>=1)))||((Turn_4>=1)&&(TestTurn_5>=1)))||((Turn_2>=1)&&(TestTurn_2>=1)))||((Turn_1>=1)&&(TestTurn_4>=1)))||((Turn_0>=1)&&(TestTurn_2>=1)))||((Turn_3>=1)&&(TestTurn_5>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((((((((Turn_0>=1)&&(TestTurn_4>=1))||((Turn_1>=1)&&(TestTurn_0>=1)))||((Turn_2>=1)&&(TestTurn_0>=1)))||((Turn_5>=1)&&(TestTurn_3>=1)))||((Turn_5>=1)&&(TestTurn_1>=1)))||((Turn_4>=1)&&(TestTurn_1>=1)))||((Turn_3>=1)&&(TestTurn_3>=1)))||((Turn_4>=1)&&(TestTurn_5>=1)))||((Turn_2>=1)&&(TestTurn_2>=1)))||((Turn_1>=1)&&(TestTurn_4>=1)))||((Turn_0>=1)&&(TestTurn_2>=1)))||((Turn_3>=1)&&(TestTurn_5>=1))))))] = FALSE
(forward)formula 3,1,2.59971,90528,1,0,293,520059,276,151,3150,323948,325
Formula is TRUE !
Detected timeout of ITS tools.
[2021-05-13 23:28:36] [INFO ] Flatten gal took : 9 ms
[2021-05-13 23:28:36] [INFO ] Applying decomposition
[2021-05-13 23:28:36] [INFO ] Flatten gal took : 13 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/graph12263440879776390340.txt, -o, /tmp/graph12263440879776390340.bin, -w, /tmp/graph12263440879776390340.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/graph12263440879776390340.bin, -l, -1, -v, -w, /tmp/graph12263440879776390340.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:28:36] [INFO ] Decomposing Gal with order
[2021-05-13 23:28:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:28:36] [INFO ] Removed a total of 66 redundant transitions.
[2021-05-13 23:28:37] [INFO ] Flatten gal took : 26 ms
[2021-05-13 23:28:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2021-05-13 23:28:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1543668954110153170.gal : 3 ms
[2021-05-13 23:28:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16364428013578580515.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/CTLFireability1543668954110153170.gal, -t, CGAL, -ctl, /tmp/CTLFireability16364428013578580515.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/CTLFireability1543668954110153170.gal -t CGAL -ctl /tmp/CTLFireability16364428013578580515.ctl
No direction supplied, using forward translation only.
Parsed 10 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.070612,7064,390,51,4632,332,381,7886,70,989,0


Converting to forward existential form...Done !
original formula: AG(EF((((i4.i0.u22.EndTurn_3>=1)||(i7.u21.EndTurn_5>=1))||(i1.u19.EndTurn_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i4.i0.u22.EndTurn_3>=1)||(i7.u21.EndTurn_5>=1))||(i1.u19.EndTurn_1>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions UpdateTurnj0k0i1, UpdateTurnj0k0i2, UpdateTurnj0k1i0, UpdateTurnj0k1i2, UpdateTurnj0k2i0, UpdateTurnj0k2i1, UpdateTurnj1k0i0, UpdateTurnj1k1i1, UpdateTurnj1k2i0, UpdateTurnj1k2i1, BecomeIdlei0, BecomeIdlei1, BecomeIdlei2, NotAlonej0k1i2, NotAlonej0k2i0, NotAlonej0k2i1, NotAlonej1k1i2, NotAlonej1k2i0, NotAlonej1k2i1, i0.u30.EndLoopj0i2, i1.u18.EndLoopj0i0, i2.i0.u3.UpdateTurnj0k0i0, i5.i0.u4.UpdateTurnj0k1i1, i5.i0.u20.EndLoopj0i1, i6.u5.UpdateTurnj0k2i2, i7.u21.UpdateTurnj1k0i2, i7.u21.UpdateTurnj1k1i2, i7.u21.UpdateTurnj1k2i2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/28/124
(forward)formula 0,1,0.195007,11672,1,0,12683,693,1779,23768,332,1942,43516
Formula is TRUE !

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

original formula: AG(EF((((i0.u30.EndTurn_4>=1)||(i1.u18.EndTurn_0>=1))||(i5.i0.u20.EndTurn_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u30.EndTurn_4>=1)||(i1.u18.EndTurn_0>=1))||(i5.i0.u20.EndTurn_2>=1)))))] = FALSE
(forward)formula 1,1,0.233579,12992,1,0,15010,737,1787,28082,332,2059,50493
Formula is TRUE !

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

original formula: AG(EF(((((i2.i1.u1.WantSection_3>=1)&&(i4.i0.u22.CS_1>=1))||((i6.u0.WantSection_1>=1)&&(i1.u19.CS_0>=1)))||((i1.u2.WantSection_5>=1)&&(i7.u21.CS_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i2.i1.u1.WantSection_3>=1)&&(i4.i0.u22.CS_1>=1))||((i6.u0.WantSection_1>=1)&&(i1.u19.CS_0>=1)))||((i1.u2.WantSection_5>=1)&&(i7.u21.CS_2>=1))))))] = FALSE
(forward)formula 2,1,0.258546,13784,1,0,17051,739,1802,30420,332,2096,55796
Formula is TRUE !

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

original formula: AG(EF(((((((((((((((((((i3.u11.BeginLoop_5>=1)||(i5.i0.u25.BeginLoop_6>=1))||(i5.i1.u12.BeginLoop_7>=1))||(i5.i1.u13.BeginLoop_8>=1))||(i4.i0.u14.BeginLoop_9>=1))||(i4.i1.u15.BeginLoop_10>=1))||(i6.u28.BeginLoop_12>=1))||(i4.i1.u16.BeginLoop_11>=1))||(i0.u17.BeginLoop_14>=1))||(i6.u29.BeginLoop_13>=1))||(i8.u32.BeginLoop_16>=1))||(i7.u31.BeginLoop_15>=1))||(i8.u33.BeginLoop_17>=1))||(i2.i0.u23.BeginLoop_0>=1))||(i2.i0.u7.BeginLoop_1>=1))||(i2.i1.u8.BeginLoop_2>=1))||(i3.u9.BeginLoop_3>=1))||(i3.u10.BeginLoop_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((((((i3.u11.BeginLoop_5>=1)||(i5.i0.u25.BeginLoop_6>=1))||(i5.i1.u12.BeginLoop_7>=1))||(i5.i1.u13.BeginLoop_8>=1))||(i4.i0.u14.BeginLoop_9>=1))||(i4.i1.u15.BeginLoop_10>=1))||(i6.u28.BeginLoop_12>=1))||(i4.i1.u16.BeginLoop_11>=1))||(i0.u17.BeginLoop_14>=1))||(i6.u29.BeginLoop_13>=1))||(i8.u32.BeginLoop_16>=1))||(i7.u31.BeginLoop_15>=1))||(i8.u33.BeginLoop_17>=1))||(i2.i0.u23.BeginLoop_0>=1))||(i2.i0.u7.BeginLoop_1>=1))||(i2.i1.u8.BeginLoop_2>=1))||(i3.u9.BeginLoop_3>=1))||(i3.u10.BeginLoop_4>=1)))))] = FALSE
(forward)formula 3,1,0.286326,14840,1,0,19100,759,1871,34245,332,2151,62060
Formula is TRUE !

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

original formula: AG(EF(((((((i4.i1.u15.TestIdentity_10>=1)||(i0.u17.TestIdentity_14>=1))||(i8.u34.TestIdentity_17>=1))||(i2.i0.u23.TestIdentity_0>=1))||(i3.u9.TestIdentity_3>=1))||(i5.i1.u26.TestIdentity_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i4.i1.u15.TestIdentity_10>=1)||(i0.u17.TestIdentity_14>=1))||(i8.u34.TestIdentity_17>=1))||(i2.i0.u23.TestIdentity_0>=1))||(i3.u9.TestIdentity_3>=1))||(i5.i1.u26.TestIdentity_7>=1)))))] = FALSE
(forward)formula 4,1,0.32115,16424,1,0,22385,759,1886,38798,332,2152,70303
Formula is TRUE !

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

original formula: AG(EF(((((((((((((i4.i1.u27.TestIdentity_11>=1)||(i6.u29.TestIdentity_13>=1))||(i6.u28.TestIdentity_12>=1))||(i7.u31.TestIdentity_15>=1))||(i2.i0.u7.TestIdentity_1>=1))||(i8.u32.TestIdentity_16>=1))||(i2.i1.u8.TestIdentity_2>=1))||(i3.u11.TestIdentity_5>=1))||(i3.u24.TestIdentity_4>=1))||(i5.i0.u25.TestIdentity_6>=1))||(i4.i0.u14.TestIdentity_9>=1))||(i5.i1.u13.TestIdentity_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((i4.i1.u27.TestIdentity_11>=1)||(i6.u29.TestIdentity_13>=1))||(i6.u28.TestIdentity_12>=1))||(i7.u31.TestIdentity_15>=1))||(i2.i0.u7.TestIdentity_1>=1))||(i8.u32.TestIdentity_16>=1))||(i2.i1.u8.TestIdentity_2>=1))||(i3.u11.TestIdentity_5>=1))||(i3.u24.TestIdentity_4>=1))||(i5.i0.u25.TestIdentity_6>=1))||(i4.i0.u14.TestIdentity_9>=1))||(i5.i1.u13.TestIdentity_8>=1)))))] = FALSE
(forward)formula 5,1,0.342935,17216,1,0,23736,764,1928,41246,332,2168,75312
Formula is TRUE !

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

original formula: AG(EF(((((((((((((i5.i1.u26.IsEndLoop_7>=1)||(i5.i1.u12.IsEndLoop_6>=1))||(i4.i1.u15.IsEndLoop_9>=1))||(i4.i1.u16.IsEndLoop_10>=1))||(i0.u17.IsEndLoop_13>=1))||(i6.u29.IsEndLoop_12>=1))||(i8.u33.IsEndLoop_16>=1))||(i2.i1.u8.IsEndLoop_1>=1))||(i2.i0.u23.IsEndLoop_0>=1))||(i8.u32.IsEndLoop_15>=1))||(i3.u10.IsEndLoop_3>=1))||(i3.u11.IsEndLoop_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((i5.i1.u26.IsEndLoop_7>=1)||(i5.i1.u12.IsEndLoop_6>=1))||(i4.i1.u15.IsEndLoop_9>=1))||(i4.i1.u16.IsEndLoop_10>=1))||(i0.u17.IsEndLoop_13>=1))||(i6.u29.IsEndLoop_12>=1))||(i8.u33.IsEndLoop_16>=1))||(i2.i1.u8.IsEndLoop_1>=1))||(i2.i0.u23.IsEndLoop_0>=1))||(i8.u32.IsEndLoop_15>=1))||(i3.u10.IsEndLoop_3>=1))||(i3.u11.IsEndLoop_4>=1)))))] = FALSE
(forward)formula 6,1,0.396308,18800,1,0,27205,781,1963,46333,332,2206,83863
Formula is TRUE !

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

original formula: AG(EF((((((((((((((i2.i1.u1.WantSection_3>=1)&&(i2.i0.u7.TestAlone_1>=1))||((i2.i1.u1.WantSection_3>=1)&&(i6.u29.TestAlone_13>=1)))||((i1.u2.WantSection_5>=1)&&(i3.u11.TestAlone_5>=1)))||((i1.u2.WantSection_5>=1)&&(i2.i1.u8.TestAlone_2>=1)))||((i6.u0.WantSection_1>=1)&&(i7.u31.TestAlone_15>=1)))||((i2.i1.u1.WantSection_3>=1)&&(i8.u32.TestAlone_16>=1)))||((i6.u0.WantSection_1>=1)&&(i6.u28.TestAlone_12>=1)))||((i2.i1.u1.WantSection_3>=1)&&(i3.u24.TestAlone_4>=1)))||((i6.u0.WantSection_1>=1)&&(i4.i0.u14.TestAlone_9>=1)))||((i6.u0.WantSection_1>=1)&&(i5.i0.u25.TestAlone_6>=1)))||((i1.u2.WantSection_5>=1)&&(i4.i1.u27.TestAlone_11>=1)))||((i1.u2.WantSection_5>=1)&&(i5.i1.u13.TestAlone_8>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((((((((i2.i1.u1.WantSection_3>=1)&&(i2.i0.u7.TestAlone_1>=1))||((i2.i1.u1.WantSection_3>=1)&&(i6.u29.TestAlone_13>=1)))||((i1.u2.WantSection_5>=1)&&(i3.u11.TestAlone_5>=1)))||((i1.u2.WantSection_5>=1)&&(i2.i1.u8.TestAlone_2>=1)))||((i6.u0.WantSection_1>=1)&&(i7.u31.TestAlone_15>=1)))||((i2.i1.u1.WantSection_3>=1)&&(i8.u32.TestAlone_16>=1)))||((i6.u0.WantSection_1>=1)&&(i6.u28.TestAlone_12>=1)))||((i2.i1.u1.WantSection_3>=1)&&(i3.u24.TestAlone_4>=1)))||((i6.u0.WantSection_1>=1)&&(i4.i0.u14.TestAlone_9>=1)))||((i6.u0.WantSection_1>=1)&&(i5.i0.u25.TestAlone_6>=1)))||((i1.u2.WantSection_5>=1)&&(i4.i1.u27.TestAlone_11>=1)))||((i1.u2.WantSection_5>=1)&&(i5.i1.u13.TestAlone_8>=1))))))] = FALSE
(forward)formula 7,1,0.412141,19328,1,0,27980,781,2039,47475,332,2206,87163
Formula is TRUE !

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

original formula: AG(EF((((((((((((((i2.i1.u1.WantSection_2>=1)&&(i8.u32.TestAlone_16>=1))||((i1.u2.WantSection_4>=1)&&(i4.i1.u27.TestAlone_11>=1)))||((i2.i1.u1.WantSection_2>=1)&&(i6.u29.TestAlone_13>=1)))||((i1.u2.WantSection_4>=1)&&(i2.i1.u8.TestAlone_2>=1)))||((i2.i1.u1.WantSection_2>=1)&&(i3.u24.TestAlone_4>=1)))||((i1.u2.WantSection_4>=1)&&(i3.u11.TestAlone_5>=1)))||((i1.u2.WantSection_4>=1)&&(i5.i1.u13.TestAlone_8>=1)))||((i6.u0.WantSection_0>=1)&&(i5.i0.u25.TestAlone_6>=1)))||((i2.i1.u1.WantSection_2>=1)&&(i2.i0.u7.TestAlone_1>=1)))||((i6.u0.WantSection_0>=1)&&(i4.i0.u14.TestAlone_9>=1)))||((i6.u0.WantSection_0>=1)&&(i6.u28.TestAlone_12>=1)))||((i6.u0.WantSection_0>=1)&&(i7.u31.TestAlone_15>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((((((((i2.i1.u1.WantSection_2>=1)&&(i8.u32.TestAlone_16>=1))||((i1.u2.WantSection_4>=1)&&(i4.i1.u27.TestAlone_11>=1)))||((i2.i1.u1.WantSection_2>=1)&&(i6.u29.TestAlone_13>=1)))||((i1.u2.WantSection_4>=1)&&(i2.i1.u8.TestAlone_2>=1)))||((i2.i1.u1.WantSection_2>=1)&&(i3.u24.TestAlone_4>=1)))||((i1.u2.WantSection_4>=1)&&(i3.u11.TestAlone_5>=1)))||((i1.u2.WantSection_4>=1)&&(i5.i1.u13.TestAlone_8>=1)))||((i6.u0.WantSection_0>=1)&&(i5.i0.u25.TestAlone_6>=1)))||((i2.i1.u1.WantSection_2>=1)&&(i2.i0.u7.TestAlone_1>=1)))||((i6.u0.WantSection_0>=1)&&(i4.i0.u14.TestAlone_9>=1)))||((i6.u0.WantSection_0>=1)&&(i6.u28.TestAlone_12>=1)))||((i6.u0.WantSection_0>=1)&&(i7.u31.TestAlone_15>=1))))))] = FALSE
(forward)formula 8,1,0.461538,21176,1,0,31828,789,2097,52330,332,2236,96787
Formula is TRUE !

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

original formula: AG(EF(((((((i5.i0.u20.IsEndLoop_8>=1)||(i4.i0.u22.IsEndLoop_11>=1))||(i0.u30.IsEndLoop_14>=1))||(i8.u34.IsEndLoop_17>=1))||(i1.u18.IsEndLoop_2>=1))||(i1.u19.IsEndLoop_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i5.i0.u20.IsEndLoop_8>=1)||(i4.i0.u22.IsEndLoop_11>=1))||(i0.u30.IsEndLoop_14>=1))||(i8.u34.IsEndLoop_17>=1))||(i1.u18.IsEndLoop_2>=1))||(i1.u19.IsEndLoop_5>=1)))))] = FALSE
(forward)formula 9,0,0.492926,21968,1,0,33535,794,2111,54518,332,2244,101516
FORMULA Liveness FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620948518695

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 Liveness -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 1800 -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="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-4028"
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 r147-tall-162089138100349"
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 ;