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

About the Execution of ITS-Tools for LeafsetExtension-PT-S08C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2532.104 138281.00 148700.00 837.10 FFFTTFFFFFTFFFTT 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.r292-tall-162124156500473.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 LeafsetExtension-PT-S08C2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156500473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 31K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.4K May 11 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 11 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 647K 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 LeafsetExtension-PT-S08C2-CTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C2-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1621298912876

Running Version 0
[2021-05-18 00:48:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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-18 00:48:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 00:48:34] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2021-05-18 00:48:34] [INFO ] Transformed 462 places.
[2021-05-18 00:48:34] [INFO ] Transformed 409 transitions.
[2021-05-18 00:48:34] [INFO ] Parsed PT model containing 462 places and 409 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 363 out of 462 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 449 transition count 409
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 447 transition count 407
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 447 transition count 407
Applied a total of 17 rules in 30 ms. Remains 447 /462 variables (removed 15) and now considering 407/409 (removed 2) transitions.
// Phase 1: matrix 407 rows 447 cols
[2021-05-18 00:48:34] [INFO ] Computed 43 place invariants in 42 ms
[2021-05-18 00:48:35] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 407 rows 447 cols
[2021-05-18 00:48:35] [INFO ] Computed 43 place invariants in 12 ms
[2021-05-18 00:48:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
// Phase 1: matrix 407 rows 447 cols
[2021-05-18 00:48:35] [INFO ] Computed 43 place invariants in 16 ms
[2021-05-18 00:48:35] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/462 places, 407/409 transitions.
[2021-05-18 00:48:35] [INFO ] Flatten gal took : 67 ms
[2021-05-18 00:48:35] [INFO ] Flatten gal took : 29 ms
[2021-05-18 00:48:35] [INFO ] Input system was already deterministic with 407 transitions.
Incomplete random walk after 100000 steps, including 5413 resets, run finished after 1621 ms. (steps per millisecond=61 ) properties (out of 76) seen :20
Running SMT prover for 56 properties.
// Phase 1: matrix 407 rows 447 cols
[2021-05-18 00:48:37] [INFO ] Computed 43 place invariants in 7 ms
[2021-05-18 00:48:38] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-18 00:48:38] [INFO ] [Real]Absence check using 8 positive and 35 generalized place invariants in 10 ms returned sat
[2021-05-18 00:48:38] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:56
[2021-05-18 00:48:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 00:48:38] [INFO ] [Nat]Absence check using 8 positive and 35 generalized place invariants in 11 ms returned sat
[2021-05-18 00:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:48:39] [INFO ] [Nat]Absence check using state equation in 261 ms returned unsat :55 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-18 00:48:39] [INFO ] SMT Verify possible in nat domain returned unsat :55 sat :1
Successfully simplified 55 atomic propositions for a total of 16 simplifications.
[2021-05-18 00:48:39] [INFO ] Initial state test concluded for 5 properties.
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Graph (complete) has 932 edges and 447 vertex of which 377 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.6 ms
Discarding 70 places :
Also discarding 0 output transitions
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 377 transition count 278
Reduce places removed 129 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 132 rules applied. Total rules applied 262 place count 248 transition count 275
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 265 place count 245 transition count 275
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 265 place count 245 transition count 257
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 301 place count 227 transition count 257
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 346 place count 182 transition count 212
Iterating global reduction 3 with 45 rules applied. Total rules applied 391 place count 182 transition count 212
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 397 place count 179 transition count 209
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 401 place count 175 transition count 205
Iterating global reduction 3 with 4 rules applied. Total rules applied 405 place count 175 transition count 205
Applied a total of 405 rules in 74 ms. Remains 175 /447 variables (removed 272) and now considering 205/407 (removed 202) transitions.
[2021-05-18 00:48:39] [INFO ] Flatten gal took : 11 ms
[2021-05-18 00:48:39] [INFO ] Flatten gal took : 12 ms
[2021-05-18 00:48:39] [INFO ] Input system was already deterministic with 205 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (complete) has 932 edges and 447 vertex of which 378 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.3 ms
Discarding 69 places :
Also discarding 0 output transitions
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 378 transition count 276
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 263 place count 247 transition count 276
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 263 place count 247 transition count 258
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 299 place count 229 transition count 258
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 347 place count 181 transition count 210
Iterating global reduction 2 with 48 rules applied. Total rules applied 395 place count 181 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 398 place count 178 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 401 place count 178 transition count 207
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 177 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 403 place count 176 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 404 place count 176 transition count 206
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 410 place count 173 transition count 203
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 414 place count 169 transition count 199
Iterating global reduction 3 with 4 rules applied. Total rules applied 418 place count 169 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 418 place count 169 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 420 place count 168 transition count 198
Applied a total of 420 rules in 58 ms. Remains 168 /447 variables (removed 279) and now considering 198/407 (removed 209) transitions.
[2021-05-18 00:48:39] [INFO ] Flatten gal took : 12 ms
[2021-05-18 00:48:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 00:48:39] [INFO ] Flatten gal took : 12 ms
[2021-05-18 00:48:39] [INFO ] Input system was already deterministic with 198 transitions.
[2021-05-18 00:48:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-18 00:48:39] [INFO ] Flatten gal took : 24 ms
[2021-05-18 00:48:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 00:48:39] [INFO ] Flatten gal took : 21 ms
[2021-05-18 00:48:39] [INFO ] Applying decomposition
[2021-05-18 00:48:39] [INFO ] Flatten gal took : 20 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/graph2071196902671579412.txt, -o, /tmp/graph2071196902671579412.bin, -w, /tmp/graph2071196902671579412.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/graph2071196902671579412.bin, -l, -1, -v, -w, /tmp/graph2071196902671579412.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 00:48:39] [INFO ] Decomposing Gal with order
[2021-05-18 00:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 00:48:39] [INFO ] Removed a total of 330 redundant transitions.
[2021-05-18 00:48:39] [INFO ] Flatten gal took : 73 ms
[2021-05-18 00:48:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 38 ms.
[2021-05-18 00:48:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality7399216697413498706.gal : 15 ms
[2021-05-18 00:48:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality6363057273067478193.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/CTLCardinality7399216697413498706.gal, -t, CGAL, -ctl, /tmp/CTLCardinality6363057273067478193.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/CTLCardinality7399216697413498706.gal -t CGAL -ctl /tmp/CTLCardinality6363057273067478193.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 5 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,168262,6.30665,192964,2,59098,5,593521,6,0,2006,694440,0


Converting to forward existential form...Done !
original formula: !(EG(((((gi2.gu21.RxHasReceivedTheRequestOfNode1+gi2.gu21.Node4ManageTheBreakDownOfNode3)+gi2.gu21.RequestOfNode2IsSentToRx)+gi2.gu21.Node1ManageTheBreakDownOfNode3)<=(((gi2.gu21.Node7HasTheLeafSetOfRxToReplaceNode8+gu4.Node0HasAskedItsLeafSetToRxToReplaceNode7)+gu8.Node3HasTheLeafSetOfLxToReplaceNode0)+gi2.gu9.Node1DontAnswerToAnyNode))))
=> equivalent forward existential formula: [FwdG(Init,((((gi2.gu21.RxHasReceivedTheRequestOfNode1+gi2.gu21.Node4ManageTheBreakDownOfNode3)+gi2.gu21.RequestOfNode2IsSentToRx)+gi2.gu21.Node1ManageTheBreakDownOfNode3)<=(((gi2.gu21.Node7HasTheLeafSetOfRxToReplaceNode8+gu4.Node0HasAskedItsLeafSetToRxToReplaceNode7)+gu8.Node3HasTheLeafSetOfLxToReplaceNode0)+gi2.gu9.Node1DontAnswerToAnyNode)))] = FALSE
Hit Full ! (commute/partial/dont) 352/0/25
(forward)formula 0,0,55.7229,1385960,1,0,30,4.44697e+06,18,4,10244,2.25132e+06,26
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AF(EX((((gi6.gu50.Node6HasTheLeafSetOfRxToReplaceNode8+gi6.gu50.Node2FailureProcessedByNode3)+gi6.gu50.Node3FailureProcessedByNode6)>(((((gi6.gu50.Node3FailureProcessedByNode8+gi6.gu50.Node0HasAskedItsLeafSetToLxToReplaceNode1)+gi6.gu50.Node0WantsToManageTheBreakDownOfNode2)+gi6.gu50.Node0FailureProcessedByNode6)+gi6.gu50.LeafSetOfLxIsSentToNode3)+gi6.gu50.RequestOfNode7IsSentToLx)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX((((gi6.gu50.Node6HasTheLeafSetOfRxToReplaceNode8+gi6.gu50.Node2FailureProcessedByNode3)+gi6.gu50.Node3FailureProcessedByNode6)>(((((gi6.gu50.Node3FailureProcessedByNode8+gi6.gu50.Node0HasAskedItsLeafSetToLxToReplaceNode1)+gi6.gu50.Node0WantsToManageTheBreakDownOfNode2)+gi6.gu50.Node0FailureProcessedByNode6)+gi6.gu50.LeafSetOfLxIsSentToNode3)+gi6.gu50.RequestOfNode7IsSentToLx)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions gi8.gi2.gi3.gu133.t205, gi8.gi8.gi1.gu143.t5, gi8.gi8.gi1.gu143.t225, gi8.gi15.gi8.gu144.t35, gi8.gi15.gi8.gu144.t66, gi8.gi15.gi8.gu144.t281, gi8.gi15.gi8.gu144.t353, gi8.gi15.t152, gi8.t86, t4, t65, t123, t193, t317, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/363/14/377
(forward)formula 1,0,97.1215,2232196,1,0,714,5.64056e+06,11,389,4529,4.90543e+06,1
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EX(AX(((((((gu8.Node3HasTheLeafSetOfLxToReplaceNode0+gu8.Node5ManageTheBreakDownOfNode6)+gu8.Node1HasTheLeafSetOfRxToReplaceNode6)+gu8.Node7ManageTheBreakDownOfNode3)+gu8.Node3WantsToManageTheBreakDownOfNode4)<=((((((gu8.Node1HasAskedItsLeafSetToLxToReplaceNode0+gu8.RxHasReceivedTheRequestOfNode7)+gu8.Node4FailureProcessedByNode0)+gu8.Node2HasTheLeafSetOfRxToReplaceNode6)+gu8.RequestOfNode0IsSentToRx)+gu8.Node1WantsToManageTheBreakDownOfNode3)+gu8.Node5HasAskedItsLeafSetToLxToReplaceNode0))||(gu98.Node6WantsToManageTheBreakDownOfNode4<=((((((gu98.Node1HasTheLeafSetOfLxToReplaceNode2+gu98.Node7HasTheLeafSetOfRxToReplaceNode5)+gu98.Node8ManageTheBreakDownOfNode2)+gu98.Node6HasAskedItsLeafSetToLxToReplaceNode2)+gu98.Node0WantsToManageTheBreakDownOfNode8)+gu98.NoNodeManageTheBreakDownOfNode7)+gu98.Node1FailureProcessedByNode5))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(((((((gu8.Node3HasTheLeafSetOfLxToReplaceNode0+gu8.Node5ManageTheBreakDownOfNode6)+gu8.Node1HasTheLeafSetOfRxToReplaceNode6)+gu8.Node7ManageTheBreakDownOfNode3)+gu8.Node3WantsToManageTheBreakDownOfNode4)<=((((((gu8.Node1HasAskedItsLeafSetToLxToReplaceNode0+gu8.RxHasReceivedTheRequestOfNode7)+gu8.Node4FailureProcessedByNode0)+gu8.Node2HasTheLeafSetOfRxToReplaceNode6)+gu8.RequestOfNode0IsSentToRx)+gu8.Node1WantsToManageTheBreakDownOfNode3)+gu8.Node5HasAskedItsLeafSetToLxToReplaceNode0))||(gu98.Node6WantsToManageTheBreakDownOfNode4<=((((((gu98.Node1HasTheLeafSetOfLxToReplaceNode2+gu98.Node7HasTheLeafSetOfRxToReplaceNode5)+gu98.Node8ManageTheBreakDownOfNode2)+gu98.Node6HasAskedItsLeafSetToLxToReplaceNode2)+gu98.Node0WantsToManageTheBreakDownOfNode8)+gu98.NoNodeManageTheBreakDownOfNode7)+gu98.Node1FailureProcessedByNode5)))))))))] = FALSE
(forward)formula 2,0,100.405,2232196,1,0,714,5.64056e+06,13,389,6753,4.90543e+06,10
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((AF((((gu4.Node8HasTheLeafSetOfRxToReplaceNode6+gu4.Node1FailureProcessedByNode6)+gu4.Node2FailureProcessedByNode0)>(((((((gu4.Node3isTheNodeMaster+gu4.Node6WantsToManageTheBreakDownOfNode8)+gu4.Node1HasAskedItsLeafSetToRxToReplaceNode7)+gu4.Node7IsActive)+gu4.Node3WantsToManageTheBreakDownOfNode1)+gu4.Node0HasAskedItsLeafSetToRxToReplaceNode7)+gu4.Node3ManageTheBreakDownOfNode5)+gu4.Node8HasAskedItsLeafSetToLxToReplaceNode1))) * !(AF(((((((((gu8.Node3HasTheLeafSetOfLxToReplaceNode0+gi7.gu131.Node1HasAskedItsLeafSetToRxToReplaceNode8)+gi7.gu131.Node7FailureProcessedByNode8)+gu4.Node0HasAskedItsLeafSetToRxToReplaceNode7)+gi7.gu131.Node1IsActive)+gi7.gu131.Node7ManageTheBreakDownOfNode5)<=40)&&((gi5.gi1.gu5.LxHasReceivedTheRequestOfNode1+gi5.gi1.gu5.LxIsActiveAndNotInTheLeafSet)<=((gi5.gi1.gu5.Node0ManageTheBreakDownOfNode3+gi5.gi1.gu5.Node4WantsToManageTheBreakDownOfNode1)+gi5.gi1.gu5.RxHasReceivedTheRequestOfNode0)))||((((gu8.Node1HasTheLeafSetOfRxToReplaceNode6+gu88.Node8FailureProcessedByNode1)+gu88.Node5ManageTheBreakDownOfNode0)+gu88.Node5ManageTheBreakDownOfNode8)>(((gu88.Node6ManageTheBreakDownOfNode4+gu88.Node0HasTheLeafSetOfLxToReplaceNode4)+gu88.Node5HasAskedItsLeafSetToLxToReplaceNode3)+gu88.Node5HasAskedItsLeafSetToRxToReplaceNode8)))))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(EG(!((((gu4.Node8HasTheLeafSetOfRxToReplaceNode6+gu4.Node1FailureProcessedByNode6)+gu4.Node2FailureProcessedByNode0)>(((((((gu4.Node3isTheNodeMaster+gu4.Node6WantsToManageTheBreakDownOfNode8)+gu4.Node1HasAskedItsLeafSetToRxToReplaceNode7)+gu4.Node7IsActive)+gu4.Node3WantsToManageTheBreakDownOfNode1)+gu4.Node0HasAskedItsLeafSetToRxToReplaceNode7)+gu4.Node3ManageTheBreakDownOfNode5)+gu4.Node8HasAskedItsLeafSetToLxToReplaceNode1)))))),!(((((((((gu8.Node3HasTheLeafSetOfLxToReplaceNode0+gi7.gu131.Node1HasAskedItsLeafSetToRxToReplaceNode8)+gi7.gu131.Node7FailureProcessedByNode8)+gu4.Node0HasAskedItsLeafSetToRxToReplaceNode7)+gi7.gu131.Node1IsActive)+gi7.gu131.Node7ManageTheBreakDownOfNode5)<=40)&&((gi5.gi1.gu5.LxHasReceivedTheRequestOfNode1+gi5.gi1.gu5.LxIsActiveAndNotInTheLeafSet)<=((gi5.gi1.gu5.Node0ManageTheBreakDownOfNode3+gi5.gi1.gu5.Node4WantsToManageTheBreakDownOfNode1)+gi5.gi1.gu5.RxHasReceivedTheRequestOfNode0)))||((((gu8.Node1HasTheLeafSetOfRxToReplaceNode6+gu88.Node8FailureProcessedByNode1)+gu88.Node5ManageTheBreakDownOfNode0)+gu88.Node5ManageTheBreakDownOfNode8)>(((gu88.Node6ManageTheBreakDownOfNode4+gu88.Node0HasTheLeafSetOfLxToReplaceNode4)+gu88.Node5HasAskedItsLeafSetToLxToReplaceNode3)+gu88.Node5HasAskedItsLeafSetToRxToReplaceNode8)))))] != FALSE
(forward)formula 3,0,122.797,2263660,1,0,714,9.24049e+06,25,389,7568,4.90543e+06,115
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((((gi2.gu9.Node0HasTheLeafSetOfLxToReplaceNode2+gi2.gu9.Node7HasTheLeafSetOfRxToReplaceNode4)+gi2.gu9.Node7FailureProcessedByNode3)<=(((((gi2.gu9.Node1FailureProcessedByNode7+gi2.gu9.Node1DontAnswerToAnyNode)+gi2.gu9.Node2WantsToManageTheBreakDownOfNode7)+gi2.gu9.Node5FailureProcessedByNode0)+gi2.gu9.Node4HasTheLeafSetOfRxToReplaceNode6)+gi2.gu9.Node5HasTheLeafSetOfRxToReplaceNode6)))
=> equivalent forward existential formula: [FwdG(Init,(((gi2.gu9.Node0HasTheLeafSetOfLxToReplaceNode2+gi2.gu9.Node7HasTheLeafSetOfRxToReplaceNode4)+gi2.gu9.Node7FailureProcessedByNode3)<=(((((gi2.gu9.Node1FailureProcessedByNode7+gi2.gu9.Node1DontAnswerToAnyNode)+gi2.gu9.Node2WantsToManageTheBreakDownOfNode7)+gi2.gu9.Node5FailureProcessedByNode0)+gi2.gu9.Node4HasTheLeafSetOfRxToReplaceNode6)+gi2.gu9.Node5HasTheLeafSetOfRxToReplaceNode6)))] != FALSE
Hit Full ! (commute/partial/dont) 357/0/20
(forward)formula 4,1,128.867,2267756,1,0,714,9.8361e+06,32,389,8266,5.10556e+06,118
FORMULA LeafsetExtension-PT-S08C2-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1621299051157

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="LeafsetExtension-PT-S08C2"
export BK_EXAMINATION="CTLCardinality"
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 LeafsetExtension-PT-S08C2, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156500473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S08C2.tgz
mv LeafsetExtension-PT-S08C2 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;