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

About the Execution of ITS-Tools for Parking-PT-208

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
221.747 5192.00 10186.00 248.00 FFTTFFFTFTTTFFFT 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.r140-tall-162089127800422.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 Parking-PT-208, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 49K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620980429149

Running Version 0
[2021-05-14 08:20:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-14 08:20:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:20:30] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-14 08:20:30] [INFO ] Transformed 137 places.
[2021-05-14 08:20:30] [INFO ] Transformed 201 transitions.
[2021-05-14 08:20:30] [INFO ] Found NUPN structural information;
[2021-05-14 08:20:30] [INFO ] Parsed PT model containing 137 places and 201 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 290 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :6
FORMULA Parking-PT-208-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 117 rows 137 cols
[2021-05-14 08:20:31] [INFO ] Computed 34 place invariants in 11 ms
[2021-05-14 08:20:31] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:31] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-14 08:20:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:20:31] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-14 08:20:31] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 08:20:31] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 08:20:31] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 13 ms to minimize.
[2021-05-14 08:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-14 08:20:31] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-14 08:20:31] [INFO ] Added : 78 causal constraints over 16 iterations in 199 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-14 08:20:31] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:31] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2021-05-14 08:20:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:20:31] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:31] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-14 08:20:31] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 08:20:31] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-14 08:20:32] [INFO ] Added : 100 causal constraints over 20 iterations in 197 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-14 08:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-14 08:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:20:32] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 08:20:32] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-14 08:20:32] [INFO ] Added : 90 causal constraints over 18 iterations in 172 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-14 08:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-14 08:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-14 08:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 08:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:20:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-14 08:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:20:32] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned unsat
FORMULA Parking-PT-208-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 8700 steps, including 263 resets, run finished after 40 ms. (steps per millisecond=217 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12600 steps, including 348 resets, run finished after 54 ms. (steps per millisecond=233 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 7700 steps, including 224 resets, run finished after 29 ms. (steps per millisecond=265 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 6 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 117/117 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 4 place count 137 transition count 113
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 133 transition count 113
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 133 transition count 109
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 129 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 127 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 127 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 121 transition count 101
Free-agglomeration rule applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 51 place count 121 transition count 82
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 70 place count 102 transition count 82
Applied a total of 70 rules in 44 ms. Remains 102 /137 variables (removed 35) and now considering 82/117 (removed 35) transitions.
Finished structural reductions, in 1 iterations. Remains : 102/137 places, 82/117 transitions.
[2021-05-14 08:20:33] [INFO ] Flatten gal took : 36 ms
[2021-05-14 08:20:33] [INFO ] Flatten gal took : 14 ms
[2021-05-14 08:20:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6811522877470264019.gal : 7 ms
[2021-05-14 08:20:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8677822319942358720.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6811522877470264019.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8677822319942358720.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6811522877470264019.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8677822319942358720.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8677822319942358720.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 13
Invariant property Parking-PT-208-ReachabilityCardinality-01 does not hold.
FORMULA Parking-PT-208-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :13 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 55
Reachability property Parking-PT-208-ReachabilityCardinality-02 is true.
FORMULA Parking-PT-208-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :55 after 341
Invariant property Parking-PT-208-ReachabilityCardinality-04 does not hold.
FORMULA Parking-PT-208-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2109,0.029276,4712,2,546,15,2688,6,0,454,1408,0
Total reachable state count : 2109

Verifying 3 reachability properties.
Invariant property Parking-PT-208-ReachabilityCardinality-01 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Parking-PT-208-ReachabilityCardinality-01,1,0.029875,4712,2,103,15,2688,7,0,462,1408,0
Reachability property Parking-PT-208-ReachabilityCardinality-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Parking-PT-208-ReachabilityCardinality-02,1,0.030144,4712,2,103,15,2688,8,0,464,1408,0
Invariant property Parking-PT-208-ReachabilityCardinality-04 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Parking-PT-208-ReachabilityCardinality-04,68,0.030469,4712,2,336,15,2688,9,0,469,1408,0
All properties solved without resorting to model-checking.

BK_STOP 1620980434341

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

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

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