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

About the Execution of ITS-Tools for SmallOperatingSystem-PT-MT0032DC0008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
840.323 41924.00 47285.00 495.40 TFTTTTFTFFFFFFFF 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.r254-tall-162106745400009.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 SmallOperatingSystem-PT-MT0032DC0008, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745400009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 8.2K May 5 16:52 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 SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1621145845212

Running Version 0
[2021-05-16 06:17:26] [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-16 06:17:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 06:17:26] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2021-05-16 06:17:26] [INFO ] Transformed 9 places.
[2021-05-16 06:17:26] [INFO ] Transformed 8 transitions.
[2021-05-16 06:17:26] [INFO ] Parsed PT model containing 9 places and 8 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 06:17:26] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-16 06:17:27] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 06:17:27] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-16 06:17:27] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 06:17:27] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-16 06:17:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
[2021-05-16 06:17:27] [INFO ] Flatten gal took : 23 ms
[2021-05-16 06:17:27] [INFO ] Flatten gal took : 4 ms
[2021-05-16 06:17:27] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=213 ) properties (out of 92) seen :40
Running SMT prover for 52 properties.
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 06:17:27] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-16 06:17:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-16 06:17:27] [INFO ] SMT Verify possible in real domain returnedunsat :44 sat :0 real:8
[2021-05-16 06:17:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-16 06:17:27] [INFO ] SMT Verify possible in nat domain returned unsat :8 sat :44
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
[2021-05-16 06:17:27] [INFO ] Initial state test concluded for 2 properties.
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 2 transition count 4
Graph (trivial) has 4 edges and 2 vertex of which 2 / 2 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 0 transition count 4
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 0 transition count 1
Applied a total of 15 rules in 13 ms. Remains 0 /9 variables (removed 9) and now considering 1/8 (removed 7) transitions.
[2021-05-16 06:17:28] [INFO ] Removed 1 GAL types that were empty due to variable simplifications.
petri,
[2021-05-16 06:17:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 1 ms
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 0 ms
[2021-05-16 06:17:28] [INFO ] Input system was already deterministic with 1 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 2 transition count 4
Graph (trivial) has 4 edges and 2 vertex of which 2 / 2 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 0 transition count 4
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 0 transition count 1
Applied a total of 15 rules in 7 ms. Remains 0 /9 variables (removed 9) and now considering 1/8 (removed 7) transitions.
[2021-05-16 06:17:28] [INFO ] Removed 1 GAL types that were empty due to variable simplifications.
petri,
[2021-05-16 06:17:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 1 ms
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 0 ms
[2021-05-16 06:17:28] [INFO ] Input system was already deterministic with 1 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 4 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
[2021-05-16 06:17:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 2 ms
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 2 ms
[2021-05-16 06:17:28] [INFO ] Input system was already deterministic with 8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
[2021-05-16 06:17:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 2 ms
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 1 ms
[2021-05-16 06:17:28] [INFO ] Input system was already deterministic with 8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-16 06:17:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 2 ms
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 1 ms
[2021-05-16 06:17:28] [INFO ] Input system was already deterministic with 8 transitions.
[2021-05-16 06:17:28] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 2 ms
[2021-05-16 06:17:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 1 ms
[2021-05-16 06:17:28] [INFO ] Applying decomposition
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16752262645577783665.txt, -o, /tmp/graph16752262645577783665.bin, -w, /tmp/graph16752262645577783665.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/graph16752262645577783665.bin, -l, -1, -v, -w, /tmp/graph16752262645577783665.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 06:17:28] [INFO ] Decomposing Gal with order
[2021-05-16 06:17:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 06:17:28] [INFO ] Flatten gal took : 2 ms
[2021-05-16 06:17:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-16 06:17:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1671858433072580373.gal : 0 ms
[2021-05-16 06:17:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality12217637939682251515.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/CTLCardinality1671858433072580373.gal, -t, CGAL, -ctl, /tmp/CTLCardinality12217637939682251515.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/CTLCardinality1671858433072580373.gal -t CGAL -ctl /tmp/CTLCardinality12217637939682251515.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166515,0.041012,5268,2,210,5,6131,6,0,47,6149,0


Converting to forward existential form...Done !
original formula: A(!(EX(EG((((gu0.LoadingMem+gu0.TaskOnDisk)<=((((((gu0.CPUUnit+gu0.TaskReady)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.TaskSuspended)+gu0.DiskControllerUnit)+gu0.LoadingMem))&&((((((gu0.TransferToDisk+gu0.ExecutingTask)+gu0.LoadingMem)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)<=50))))) U AF(AG((EF((((((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)+gu0.LoadingMem)+gu0.TransferToDisk)>=48)) + (((gu0.ExecutingTask+gu0.LoadingMem)+gu0.TaskReady)<=gu0.DiskControllerUnit)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !((E(TRUE U (((((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)+gu0.LoadingMem)+gu0.TransferToDisk)>=48)) + (((gu0.ExecutingTask+gu0.LoadingMem)+gu0.TaskReady)<=gu0.DiskControllerUnit)))))))))))) * !(E(!(!(EG(!(!(E(TRUE U !((E(TRUE U (((((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)+gu0.LoadingMem)+gu0.TransferToDisk)>=48)) + (((gu0.ExecutingTask+gu0.LoadingMem)+gu0.TaskReady)<=gu0.DiskControllerUnit))))))))) U (!(!(EX(EG((((gu0.LoadingMem+gu0.TaskOnDisk)<=((((((gu0.CPUUnit+gu0.TaskReady)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.TaskSuspended)+gu0.DiskControllerUnit)+gu0.LoadingMem))&&((((((gu0.TransferToDisk+gu0.ExecutingTask)+gu0.LoadingMem)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)<=50)))))) * !(!(EG(!(!(E(TRUE U !((E(TRUE U (((((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)+gu0.LoadingMem)+gu0.TransferToDisk)>=48)) + (((gu0.ExecutingTask+gu0.LoadingMem)+gu0.TaskReady)<=gu0.DiskControllerUnit)))))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.91424,38708,1,0,7,19547,23,2,18107,18891,8
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((A(AF(EX((gu0.TaskOnDisk>=27))) U EF((((((gu0.CPUUnit+gu0.TransferToDisk)+gu0.TaskSuspended)<=32)&&((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TaskOnDisk)>=37))||((((((((gu0.TaskReady+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskOnDisk)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.LoadingMem)<7)))) * EF(EX(TRUE))) U EX(((EF((((gu0.TaskOnDisk+gu0.FreeMemSegment)+gu0.ExecutingTask)>=44)) * ((((((((gu0.FreeMemSegment+gu0.ExecutingTask)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)+gu0.TaskSuspended)+gu0.TaskOnDisk)+gu0.LoadingMem)>(((((gu0.TaskReady+gu0.ExecutingTask)+gu0.CPUUnit)+gu0.TaskOnDisk)+gu0.LoadingMem)+gu0.TransferToDisk))) * (!(EF((((((gu0.DiskControllerUnit+gu0.TaskOnDisk)+gu0.FreeMemSegment)+gu0.CPUUnit)+gu0.TaskReady)<=32))) + (((gu0.TransferToDisk+gu0.ExecutingTask)<48)&&(((gu0.TransferToDisk+gu0.TaskOnDisk)+gu0.DiskControllerUnit)>(((gu0.TaskOnDisk+gu0.CPUUnit)+gu0.TaskSuspended)+gu0.TaskReady)))))))
=> equivalent forward existential formula: ([((EY(FwdU(Init,(!((E(!(E(TRUE U (((((gu0.CPUUnit+gu0.TransferToDisk)+gu0.TaskSuspended)<=32)&&((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TaskOnDisk)>=37))||((((((((gu0.TaskReady+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskOnDisk)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.LoadingMem)<7)))) U (!(!(EG(!(EX((gu0.TaskOnDisk>=27)))))) * !(E(TRUE U (((((gu0.CPUUnit+gu0.TransferToDisk)+gu0.TaskSuspended)<=32)&&((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TaskOnDisk)>=37))||((((((((gu0.TaskReady+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskOnDisk)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.LoadingMem)<7)))))) + EG(!(E(TRUE U (((((gu0.CPUUnit+gu0.TransferToDisk)+gu0.TaskSuspended)<=32)&&((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TaskOnDisk)>=37))||((((((((gu0.TaskReady+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskOnDisk)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.LoadingMem)<7))))))) * E(TRUE U EX(TRUE))))) * (E(TRUE U (((gu0.TaskOnDisk+gu0.FreeMemSegment)+gu0.ExecutingTask)>=44)) * ((((((((gu0.FreeMemSegment+gu0.ExecutingTask)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)+gu0.TaskSuspended)+gu0.TaskOnDisk)+gu0.LoadingMem)>(((((gu0.TaskReady+gu0.ExecutingTask)+gu0.CPUUnit)+gu0.TaskOnDisk)+gu0.LoadingMem)+gu0.TransferToDisk)))) * !(E(TRUE U (((((gu0.DiskControllerUnit+gu0.TaskOnDisk)+gu0.FreeMemSegment)+gu0.CPUUnit)+gu0.TaskReady)<=32))))] != FALSE + [((EY(FwdU(Init,(!((E(!(E(TRUE U (((((gu0.CPUUnit+gu0.TransferToDisk)+gu0.TaskSuspended)<=32)&&((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TaskOnDisk)>=37))||((((((((gu0.TaskReady+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskOnDisk)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.LoadingMem)<7)))) U (!(!(EG(!(EX((gu0.TaskOnDisk>=27)))))) * !(E(TRUE U (((((gu0.CPUUnit+gu0.TransferToDisk)+gu0.TaskSuspended)<=32)&&((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TaskOnDisk)>=37))||((((((((gu0.TaskReady+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskOnDisk)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.LoadingMem)<7)))))) + EG(!(E(TRUE U (((((gu0.CPUUnit+gu0.TransferToDisk)+gu0.TaskSuspended)<=32)&&((((gu0.ExecutingTask+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TaskOnDisk)>=37))||((((((((gu0.TaskReady+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskOnDisk)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.LoadingMem)<7))))))) * E(TRUE U EX(TRUE))))) * (E(TRUE U (((gu0.TaskOnDisk+gu0.FreeMemSegment)+gu0.ExecutingTask)>=44)) * ((((((((gu0.FreeMemSegment+gu0.ExecutingTask)+gu0.DiskControllerUnit)+gu0.TaskReady)+gu0.CPUUnit)+gu0.TaskSuspended)+gu0.TaskOnDisk)+gu0.LoadingMem)>(((((gu0.TaskReady+gu0.ExecutingTask)+gu0.CPUUnit)+gu0.TaskOnDisk)+gu0.LoadingMem)+gu0.TransferToDisk)))) * (((gu0.TransferToDisk+gu0.ExecutingTask)<48)&&(((gu0.TransferToDisk+gu0.TaskOnDisk)+gu0.DiskControllerUnit)>(((gu0.TaskOnDisk+gu0.CPUUnit)+gu0.TaskSuspended)+gu0.TaskReady))))] != FALSE)
(forward)formula 1,1,17.4716,313944,1,0,13,31236,30,4,381706,29112,24
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AG(!(AF(((EX((((((gu0.TransferToDisk+gu0.TaskReady)+gu0.LoadingMem)+gu0.TaskSuspended)+gu0.ExecutingTask)<=(((gu0.ExecutingTask+gu0.LoadingMem)+gu0.DiskControllerUnit)+gu0.CPUUnit))) * ((gu0.DiskControllerUnit+gu0.CPUUnit)<=gu0.ExecutingTask)) * (((((((((gu0.TaskReady+gu0.ExecutingTask)+gu0.TaskSuspended)+gu0.TaskOnDisk)+gu0.FreeMemSegment)+gu0.DiskControllerUnit)+gu0.CPUUnit)+gu0.TransferToDisk)+gu0.LoadingMem)>=33))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EG(!(((EX((((((gu0.TransferToDisk+gu0.TaskReady)+gu0.LoadingMem)+gu0.TaskSuspended)+gu0.ExecutingTask)<=(((gu0.ExecutingTask+gu0.LoadingMem)+gu0.DiskControllerUnit)+gu0.CPUUnit))) * ((gu0.DiskControllerUnit+gu0.CPUUnit)<=gu0.ExecutingTask)) * (((((((((gu0.TaskReady+gu0.ExecutingTask)+gu0.TaskSuspended)+gu0.TaskOnDisk)+gu0.FreeMemSegment)+gu0.DiskControllerUnit)+gu0.CPUUnit)+gu0.TransferToDisk)+gu0.LoadingMem)>=33))))))] = FALSE
Using saturation style SCC detection
(forward)formula 2,0,24.4897,439344,1,0,20,35360,36,8,523388,34011,32
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E((A(((gu0.DiskControllerUnit<=gu0.LoadingMem)&&(gu0.TaskReady<=((((((((gu0.FreeMemSegment+gu0.CPUUnit)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.DiskControllerUnit)+gu0.LoadingMem)+gu0.TaskReady)+gu0.TaskOnDisk))) U ((((((gu0.TaskOnDisk+gu0.DiskControllerUnit)+gu0.TaskSuspended)+gu0.CPUUnit)+gu0.TaskReady)>=14)&&((((gu0.TaskReady+gu0.TaskOnDisk)+gu0.ExecutingTask)+gu0.CPUUnit)<=40))) + AX(FALSE)) U E(EX(EF(((((((((gu0.TaskSuspended+gu0.LoadingMem)+gu0.TransferToDisk)+gu0.DiskControllerUnit)+gu0.FreeMemSegment)+gu0.TaskReady)+gu0.TaskOnDisk)+gu0.ExecutingTask)<=((((gu0.LoadingMem+gu0.TaskOnDisk)+gu0.CPUUnit)+gu0.FreeMemSegment)+gu0.ExecutingTask)))) U !(AX(((((((gu0.FreeMemSegment+gu0.TaskReady)+gu0.TransferToDisk)+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.LoadingMem)<=10))))) * EX(EX(!(E(((((gu0.FreeMemSegment+gu0.TransferToDisk)+gu0.TaskSuspended)+gu0.TaskReady)>=11) U ((((((gu0.FreeMemSegment+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TransferToDisk)+gu0.TaskReady)+gu0.DiskControllerUnit)<=19))))))
=> equivalent forward existential formula: [(EY(EY((Init * E((!((E(!(((((((gu0.TaskOnDisk+gu0.DiskControllerUnit)+gu0.TaskSuspended)+gu0.CPUUnit)+gu0.TaskReady)>=14)&&((((gu0.TaskReady+gu0.TaskOnDisk)+gu0.ExecutingTask)+gu0.CPUUnit)<=40))) U (!(((gu0.DiskControllerUnit<=gu0.LoadingMem)&&(gu0.TaskReady<=((((((((gu0.FreeMemSegment+gu0.CPUUnit)+gu0.TaskSuspended)+gu0.ExecutingTask)+gu0.TransferToDisk)+gu0.DiskControllerUnit)+gu0.LoadingMem)+gu0.TaskReady)+gu0.TaskOnDisk)))) * !(((((((gu0.TaskOnDisk+gu0.DiskControllerUnit)+gu0.TaskSuspended)+gu0.CPUUnit)+gu0.TaskReady)>=14)&&((((gu0.TaskReady+gu0.TaskOnDisk)+gu0.ExecutingTask)+gu0.CPUUnit)<=40))))) + EG(!(((((((gu0.TaskOnDisk+gu0.DiskControllerUnit)+gu0.TaskSuspended)+gu0.CPUUnit)+gu0.TaskReady)>=14)&&((((gu0.TaskReady+gu0.TaskOnDisk)+gu0.ExecutingTask)+gu0.CPUUnit)<=40)))))) + !(EX(!(FALSE)))) U E(EX(E(TRUE U ((((((((gu0.TaskSuspended+gu0.LoadingMem)+gu0.TransferToDisk)+gu0.DiskControllerUnit)+gu0.FreeMemSegment)+gu0.TaskReady)+gu0.TaskOnDisk)+gu0.ExecutingTask)<=((((gu0.LoadingMem+gu0.TaskOnDisk)+gu0.CPUUnit)+gu0.FreeMemSegment)+gu0.ExecutingTask)))) U !(!(EX(!(((((((gu0.FreeMemSegment+gu0.TaskReady)+gu0.TransferToDisk)+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.LoadingMem)<=10)))))))))) * !(E(((((gu0.FreeMemSegment+gu0.TransferToDisk)+gu0.TaskSuspended)+gu0.TaskReady)>=11) U ((((((gu0.FreeMemSegment+gu0.TaskSuspended)+gu0.LoadingMem)+gu0.TransferToDisk)+gu0.TaskReady)+gu0.DiskControllerUnit)<=19))))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/8
(forward)formula 3,0,26.6494,470820,1,0,22,97132,44,8,539181,97073,36
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AX(AG((((((gu0.LoadingMem+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskSuspended)+gu0.TaskOnDisk)<=((((((gu0.TransferToDisk+gu0.CPUUnit)+gu0.ExecutingTask)+gu0.FreeMemSegment)+gu0.LoadingMem)+gu0.DiskControllerUnit)+gu0.TaskReady)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((((((gu0.LoadingMem+gu0.CPUUnit)+gu0.DiskControllerUnit)+gu0.TaskSuspended)+gu0.TaskOnDisk)<=((((((gu0.TransferToDisk+gu0.CPUUnit)+gu0.ExecutingTask)+gu0.FreeMemSegment)+gu0.LoadingMem)+gu0.DiskControllerUnit)+gu0.TaskReady)))))))))] != FALSE
(forward)formula 4,0,36.5945,622112,1,0,23,98207,46,8,876489,97275,39
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EF(EG(AX(FALSE))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(!(EX(!(FALSE)))))))] = FALSE
(forward)formula 5,0,36.5946,622112,1,0,23,98207,46,8,876489,97275,39
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621145887136

--------------------
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="SmallOperatingSystem-PT-MT0032DC0008"
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 SmallOperatingSystem-PT-MT0032DC0008, 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 r254-tall-162106745400009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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