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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
379.067 42541.00 54760.00 270.20 TFFTTFFFFTTTFFTF 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-162089127900439.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-432, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.0K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:00 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 192K 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-432-ReachabilityFireability-00
FORMULA_NAME Parking-PT-432-ReachabilityFireability-01
FORMULA_NAME Parking-PT-432-ReachabilityFireability-02
FORMULA_NAME Parking-PT-432-ReachabilityFireability-03
FORMULA_NAME Parking-PT-432-ReachabilityFireability-04
FORMULA_NAME Parking-PT-432-ReachabilityFireability-05
FORMULA_NAME Parking-PT-432-ReachabilityFireability-06
FORMULA_NAME Parking-PT-432-ReachabilityFireability-07
FORMULA_NAME Parking-PT-432-ReachabilityFireability-08
FORMULA_NAME Parking-PT-432-ReachabilityFireability-09
FORMULA_NAME Parking-PT-432-ReachabilityFireability-10
FORMULA_NAME Parking-PT-432-ReachabilityFireability-11
FORMULA_NAME Parking-PT-432-ReachabilityFireability-12
FORMULA_NAME Parking-PT-432-ReachabilityFireability-13
FORMULA_NAME Parking-PT-432-ReachabilityFireability-14
FORMULA_NAME Parking-PT-432-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620980932041

Running Version 0
[2021-05-14 08:28:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:28:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:28:53] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-14 08:28:53] [INFO ] Transformed 529 places.
[2021-05-14 08:28:53] [INFO ] Transformed 785 transitions.
[2021-05-14 08:28:53] [INFO ] Found NUPN structural information;
[2021-05-14 08:28:53] [INFO ] Parsed PT model containing 529 places and 785 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 16) seen :9
FORMULA Parking-PT-432-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 457 rows 529 cols
[2021-05-14 08:28:54] [INFO ] Computed 124 place invariants in 30 ms
[2021-05-14 08:28:54] [INFO ] [Real]Absence check using 120 positive place invariants in 34 ms returned sat
[2021-05-14 08:28:54] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:28:54] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-14 08:28:54] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:28:54] [INFO ] [Real]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:28:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:28:54] [INFO ] [Nat]Absence check using 120 positive place invariants in 24 ms returned sat
[2021-05-14 08:28:54] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:28:54] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-14 08:28:54] [INFO ] [Nat]Added 108 Read/Feed constraints in 12 ms returned sat
[2021-05-14 08:28:54] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 39 ms.
[2021-05-14 08:28:56] [INFO ] Added : 282 causal constraints over 57 iterations in 1861 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-14 08:28:56] [INFO ] [Real]Absence check using 120 positive place invariants in 26 ms returned sat
[2021-05-14 08:28:56] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:28:57] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-14 08:28:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:28:57] [INFO ] [Nat]Absence check using 120 positive place invariants in 25 ms returned sat
[2021-05-14 08:28:57] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:28:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:28:57] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-14 08:28:57] [INFO ] [Nat]Added 108 Read/Feed constraints in 31 ms returned sat
[2021-05-14 08:28:57] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 47 ms.
[2021-05-14 08:28:59] [INFO ] Added : 296 causal constraints over 60 iterations in 1744 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-14 08:28:59] [INFO ] [Real]Absence check using 120 positive place invariants in 25 ms returned sat
[2021-05-14 08:28:59] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:28:59] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-14 08:28:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:28:59] [INFO ] [Nat]Absence check using 120 positive place invariants in 25 ms returned sat
[2021-05-14 08:28:59] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:28:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:28:59] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-14 08:28:59] [INFO ] [Nat]Added 108 Read/Feed constraints in 12 ms returned sat
[2021-05-14 08:28:59] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2021-05-14 08:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2021-05-14 08:28:59] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 24 ms.
[2021-05-14 08:29:02] [INFO ] Added : 351 causal constraints over 71 iterations in 2170 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-14 08:29:02] [INFO ] [Real]Absence check using 120 positive place invariants in 22 ms returned sat
[2021-05-14 08:29:02] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 10 ms returned sat
[2021-05-14 08:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:29:02] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-14 08:29:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:29:02] [INFO ] [Nat]Absence check using 120 positive place invariants in 27 ms returned sat
[2021-05-14 08:29:02] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:29:02] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-14 08:29:02] [INFO ] [Nat]Added 108 Read/Feed constraints in 16 ms returned sat
[2021-05-14 08:29:02] [INFO ] Deduced a trap composed of 67 places in 27 ms of which 0 ms to minimize.
[2021-05-14 08:29:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-14 08:29:02] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 27 ms.
[2021-05-14 08:29:04] [INFO ] Added : 254 causal constraints over 51 iterations in 1663 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-14 08:29:04] [INFO ] [Real]Absence check using 120 positive place invariants in 39 ms returned sat
[2021-05-14 08:29:04] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 08:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:29:04] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-14 08:29:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:29:05] [INFO ] [Nat]Absence check using 120 positive place invariants in 39 ms returned sat
[2021-05-14 08:29:05] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 08:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:29:05] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2021-05-14 08:29:05] [INFO ] [Nat]Added 108 Read/Feed constraints in 17 ms returned sat
[2021-05-14 08:29:05] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-14 08:29:07] [INFO ] Added : 305 causal constraints over 61 iterations in 2038 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-14 08:29:07] [INFO ] [Real]Absence check using 120 positive place invariants in 22 ms returned sat
[2021-05-14 08:29:07] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:29:07] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-14 08:29:07] [INFO ] [Real]Added 108 Read/Feed constraints in 12 ms returned sat
[2021-05-14 08:29:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:29:08] [INFO ] [Nat]Absence check using 120 positive place invariants in 22 ms returned sat
[2021-05-14 08:29:08] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:29:08] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-14 08:29:08] [INFO ] [Nat]Added 108 Read/Feed constraints in 12 ms returned sat
[2021-05-14 08:29:08] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 23 ms.
[2021-05-14 08:29:09] [INFO ] Added : 309 causal constraints over 62 iterations in 1772 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-14 08:29:10] [INFO ] [Real]Absence check using 120 positive place invariants in 25 ms returned sat
[2021-05-14 08:29:10] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:29:10] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-14 08:29:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:29:10] [INFO ] [Nat]Absence check using 120 positive place invariants in 23 ms returned sat
[2021-05-14 08:29:10] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:29:10] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-14 08:29:10] [INFO ] [Nat]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:29:10] [INFO ] Deduced a trap composed of 52 places in 26 ms of which 1 ms to minimize.
[2021-05-14 08:29:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-14 08:29:10] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 23 ms.
[2021-05-14 08:29:12] [INFO ] Deduced a trap composed of 67 places in 27 ms of which 0 ms to minimize.
[2021-05-14 08:29:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2021-05-14 08:29:12] [INFO ] Added : 297 causal constraints over 60 iterations in 1810 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 27800 steps, including 242 resets, run finished after 232 ms. (steps per millisecond=119 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA Parking-PT-432-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 33500 steps, including 247 resets, run finished after 235 ms. (steps per millisecond=142 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 45000 steps, including 350 resets, run finished after 337 ms. (steps per millisecond=133 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA Parking-PT-432-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 20800 steps, including 195 resets, run finished after 144 ms. (steps per millisecond=144 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA Parking-PT-432-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 39100 steps, including 289 resets, run finished after 268 ms. (steps per millisecond=145 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 35700 steps, including 276 resets, run finished after 243 ms. (steps per millisecond=146 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 40600 steps, including 310 resets, run finished after 276 ms. (steps per millisecond=147 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 28 out of 529 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 529/529 places, 457/457 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 529 transition count 446
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 518 transition count 446
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 22 place count 518 transition count 433
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 48 place count 505 transition count 433
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 501 transition count 429
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 501 transition count 429
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 487 transition count 415
Free-agglomeration rule applied 70 times.
Iterating global reduction 2 with 70 rules applied. Total rules applied 154 place count 487 transition count 345
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 224 place count 417 transition count 345
Applied a total of 224 rules in 154 ms. Remains 417 /529 variables (removed 112) and now considering 345/457 (removed 112) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/529 places, 345/457 transitions.
[2021-05-14 08:29:14] [INFO ] Flatten gal took : 88 ms
[2021-05-14 08:29:14] [INFO ] Flatten gal took : 30 ms
[2021-05-14 08:29:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4638512347935903728.gal : 14 ms
[2021-05-14 08:29:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6451055127499397298.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4638512347935903728.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6451055127499397298.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/ReachabilityCardinality4638512347935903728.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6451055127499397298.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6451055127499397298.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 25
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :25 after 29
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :29 after 53
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :53 after 105
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :105 after 169
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :169 after 13441
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :13441 after 47217
Invariant property Parking-PT-432-ReachabilityFireability-15 does not hold.
FORMULA Parking-PT-432-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property Parking-PT-432-ReachabilityFireability-00 is true.
FORMULA Parking-PT-432-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :47217 after 1.36326e+07
Detected timeout of ITS tools.
[2021-05-14 08:29:29] [INFO ] Flatten gal took : 27 ms
[2021-05-14 08:29:29] [INFO ] Applying decomposition
[2021-05-14 08:29:29] [INFO ] Flatten gal took : 26 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/graph7364003071565399078.txt, -o, /tmp/graph7364003071565399078.bin, -w, /tmp/graph7364003071565399078.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/graph7364003071565399078.bin, -l, -1, -v, -w, /tmp/graph7364003071565399078.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:29:29] [INFO ] Decomposing Gal with order
[2021-05-14 08:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:29:29] [INFO ] Removed a total of 34 redundant transitions.
[2021-05-14 08:29:29] [INFO ] Flatten gal took : 71 ms
[2021-05-14 08:29:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 16 ms.
[2021-05-14 08:29:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8786781767610431062.gal : 12 ms
[2021-05-14 08:29:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9800634661445043609.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/ReachabilityCardinality8786781767610431062.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9800634661445043609.prop, --nowitness], 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/ReachabilityCardinality8786781767610431062.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9800634661445043609.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9800634661445043609.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :7 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 53
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :53 after 301
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :301 after 365
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :365 after 453
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :453 after 8.99272e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8.99272e+07 after 1.30758e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.30758e+10 after 4.05734e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.05734e+10 after 5.76873e+10
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\_mod\_flat,7.61473e+10,3.69695,106704,1250,379,113671,55282,1427,491221,193,427110,0
Total reachable state count : 76147264513

Verifying 2 reachability properties.
Invariant property Parking-PT-432-ReachabilityFireability-02 does not hold.
FORMULA Parking-PT-432-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-432-ReachabilityFireability-02,5.68248e+08,3.70752,106704,839,265,113671,55282,1440,491221,198,427110,647
Reachability property Parking-PT-432-ReachabilityFireability-11 is true.
FORMULA Parking-PT-432-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-432-ReachabilityFireability-11,25344,3.70907,106704,171,66,113671,55282,1470,491221,203,427110,927
All properties solved without resorting to model-checking.

BK_STOP 1620980974582

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-432"
export BK_EXAMINATION="ReachabilityFireability"
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-432, examination is ReachabilityFireability"
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-162089127900439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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