fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r150-smll-165276998700345
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PermAdmissibility-COL-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
212.476 12000.00 27359.00 135.40 TFFTFFTFFFTTTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700345.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PermAdmissibility-COL-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 6.7K Apr 29 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 54K May 10 09:34 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 PermAdmissibility-COL-01-CTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653066898793

Running Version 202205111006
[2022-05-20 17:15:01] [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]
[2022-05-20 17:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 17:15:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 17:15:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 17:15:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1340 ms
[2022-05-20 17:15:02] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 45 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
[2022-05-20 17:15:02] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 10 ms.
[2022-05-20 17:15:02] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 588 resets, run finished after 1172 ms. (steps per millisecond=8 ) properties (out of 85) seen :22
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 77 ms. (steps per millisecond=12 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 63) seen :0
Running SMT prover for 63 properties.
// Phase 1: matrix 16 rows 40 cols
[2022-05-20 17:15:07] [INFO ] Computed 24 place invariants in 9 ms
[2022-05-20 17:15:07] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-20 17:15:07] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:58
[2022-05-20 17:15:08] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 17 ms returned sat
[2022-05-20 17:15:08] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :63 sat :0
Fused 63 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 63 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-COL-01-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 17:15:08] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2022-05-20 17:15:08] [INFO ] Flatten gal took : 29 ms
[2022-05-20 17:15:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PermAdmissibility-COL-01-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 17:15:08] [INFO ] Flatten gal took : 8 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2022-05-20 17:15:08] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 17 ms.
[2022-05-20 17:15:08] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Support contains 12 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 16
Applied a total of 9 rules in 10 ms. Remains 31 /40 variables (removed 9) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2022-05-20 17:15:08] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-20 17:15:08] [INFO ] Implicit Places using invariants in 86 ms returned [4, 5, 6, 7, 13, 14, 16, 22, 23, 25, 26]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 89 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/40 places, 16/16 transitions.
Support contains 12 out of 20 places after structural reductions.
[2022-05-20 17:15:08] [INFO ] Flatten gal took : 5 ms
[2022-05-20 17:15:08] [INFO ] Flatten gal took : 4 ms
[2022-05-20 17:15:08] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 11 out of 20 places (down from 12) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:15:10] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-20 17:15:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-20 17:15:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 17:15:10] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 4 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 4 ms
[2022-05-20 17:15:10] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 16
Applied a total of 1 rules in 2 ms. Remains 19 /20 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 17:15:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:15:10] [INFO ] Implicit Places using invariants in 43 ms returned [8, 9, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/20 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/20 places, 16/16 transitions.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 4 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:15:10] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:15:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality4839835847672983153.gal : 2 ms
[2022-05-20 17:15:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality7632745896450825059.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4839835847672983153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7632745896450825059.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.014964,4284,2,32,5,142,6,0,81,118,0


Converting to forward existential form...Done !
original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 0,1,0.015287,4284,1,0,7,142,7,1,99,118,2
FORMULA PermAdmissibility-COL-01-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Graph (complete) has 26 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 18 transition count 10
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 12 transition count 9
Applied a total of 13 rules in 13 ms. Remains 12 /20 variables (removed 8) and now considering 9/16 (removed 7) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:15:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:15:10] [INFO ] Implicit Places using invariants in 48 ms returned [3, 4, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 9/20 places, 9/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 5
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Applied a total of 8 rules in 5 ms. Remains 4 /9 variables (removed 5) and now considering 4/9 (removed 5) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 17:15:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 17:15:10] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 17:15:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 17:15:10] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 4/20 places, 4/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/20 places, 4/16 transitions.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:15:10] [INFO ] Input system was already deterministic with 4 transitions.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 0 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:15:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality3891967103614978689.gal : 0 ms
[2022-05-20 17:15:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality12104001536224936579.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3891967103614978689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12104001536224936579.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5,0.00398,4280,2,8,5,29,6,0,21,21,0


Converting to forward existential form...Done !
original formula: EF(AG((c19_0<=c7_0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((c19_0<=c7_0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.005766,4836,1,0,13,84,28,8,97,86,17
FORMULA PermAdmissibility-COL-01-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 16
Applied a total of 1 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 17:15:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:15:10] [INFO ] Implicit Places using invariants in 58 ms returned [8, 9, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/20 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/20 places, 16/16 transitions.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:15:10] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:15:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality6870511621708095150.gal : 6 ms
[2022-05-20 17:15:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16241356794595259206.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6870511621708095150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16241356794595259206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.005112,4516,2,32,5,142,6,0,81,118,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.005381,4516,1,0,6,142,7,1,97,118,1
FORMULA PermAdmissibility-COL-01-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Graph (complete) has 26 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 17 transition count 10
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 12 transition count 9
Applied a total of 11 rules in 6 ms. Remains 12 /20 variables (removed 8) and now considering 9/16 (removed 7) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:15:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:15:10] [INFO ] Implicit Places using invariants in 53 ms returned [3, 4, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 9/20 places, 9/16 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 5 transition count 4
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 8 place count 4 transition count 4
Applied a total of 8 rules in 5 ms. Remains 4 /9 variables (removed 5) and now considering 4/9 (removed 5) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 17:15:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 17:15:10] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 17:15:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 17:15:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 4/20 places, 4/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/20 places, 4/16 transitions.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:15:10] [INFO ] Input system was already deterministic with 4 transitions.
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:15:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality16568653639244960643.gal : 1 ms
[2022-05-20 17:15:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality6913556652687249419.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16568653639244960643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6913556652687249419.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5,0.003425,4236,2,8,5,29,6,0,21,21,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((c18_0>c9_0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (c18_0>c9_0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.005793,4904,1,0,16,87,33,10,107,102,25
FORMULA PermAdmissibility-COL-01-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2022-05-20 17:15:10] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:15:10] [INFO ] Flatten gal took : 3 ms
Total runtime 9613 ms.

BK_STOP 1653066910793

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="PermAdmissibility-COL-01"
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 PermAdmissibility-COL-01, 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 r150-smll-165276998700345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 ;