Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156400382.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 HealthRecord-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156400382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 84K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621283488248

Running Version 0
[2021-05-17 20:31: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-17 20:31:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:31:30] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-17 20:31:30] [INFO ] Transformed 453 places.
[2021-05-17 20:31:30] [INFO ] Transformed 594 transitions.
[2021-05-17 20:31:30] [INFO ] Found NUPN structural information;
[2021-05-17 20:31:30] [INFO ] Parsed PT model containing 453 places and 594 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA net-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 61 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :4
FORMULA net-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 594 rows 453 cols
[2021-05-17 20:31:30] [INFO ] Computed 14 place invariants in 21 ms
[2021-05-17 20:31:30] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-17 20:31:30] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned unsat
[2021-05-17 20:31:30] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-17 20:31:30] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:30] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-17 20:31:31] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 37 ms.
[2021-05-17 20:31:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-17 20:31:31] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:31] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-17 20:31:31] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 41 ms.
[2021-05-17 20:31:32] [INFO ] Added : 237 causal constraints over 48 iterations in 1402 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-17 20:31:33] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned unsat
[2021-05-17 20:31:33] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2021-05-17 20:31:33] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-17 20:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:33] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-17 20:31:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:33] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-17 20:31:33] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2021-05-17 20:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:33] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2021-05-17 20:31:34] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 2 ms to minimize.
[2021-05-17 20:31:34] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 1 ms to minimize.
[2021-05-17 20:31:34] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 13 ms to minimize.
[2021-05-17 20:31:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 556 ms
[2021-05-17 20:31:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2021-05-17 20:31:34] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-17 20:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:34] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2021-05-17 20:31:35] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 2 ms to minimize.
[2021-05-17 20:31:35] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 0 ms to minimize.
[2021-05-17 20:31:35] [INFO ] Deduced a trap composed of 116 places in 95 ms of which 0 ms to minimize.
[2021-05-17 20:31:35] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 1 ms to minimize.
[2021-05-17 20:31:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 608 ms
[2021-05-17 20:31:35] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 34 ms.
[2021-05-17 20:31:36] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 0 ms to minimize.
[2021-05-17 20:31:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2021-05-17 20:31:37] [INFO ] Added : 251 causal constraints over 51 iterations in 1548 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-17 20:31:37] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2021-05-17 20:31:37] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:37] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-17 20:31:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 20:31:37] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:37] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-17 20:31:37] [INFO ] Deduced a trap composed of 180 places in 110 ms of which 1 ms to minimize.
[2021-05-17 20:31:37] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 1 ms to minimize.
[2021-05-17 20:31:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2021-05-17 20:31:37] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 41 ms.
[2021-05-17 20:31:38] [INFO ] Added : 100 causal constraints over 20 iterations in 516 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-17 20:31:38] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-17 20:31:38] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:38] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-17 20:31:38] [INFO ] Solution in real domain found non-integer solution.
FORMULA net-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 50800 steps, including 397 resets, run finished after 173 ms. (steps per millisecond=293 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 33500 steps, including 247 resets, run finished after 87 ms. (steps per millisecond=385 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA net-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11600 steps, including 158 resets, run finished after 41 ms. (steps per millisecond=282 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 6 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 522 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 9 ms
Free SCC test removed 32 places
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 820 edges and 421 vertex of which 407 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.3 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 407 transition count 317
Reduce places removed 219 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 245 rules applied. Total rules applied 466 place count 188 transition count 291
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 479 place count 179 transition count 287
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 483 place count 175 transition count 287
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 483 place count 175 transition count 278
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 501 place count 166 transition count 278
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 558 place count 109 transition count 165
Iterating global reduction 4 with 57 rules applied. Total rules applied 615 place count 109 transition count 165
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 624 place count 100 transition count 147
Iterating global reduction 4 with 9 rules applied. Total rules applied 633 place count 100 transition count 147
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 640 place count 93 transition count 140
Iterating global reduction 4 with 7 rules applied. Total rules applied 647 place count 93 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 650 place count 93 transition count 137
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 652 place count 91 transition count 133
Iterating global reduction 5 with 2 rules applied. Total rules applied 654 place count 91 transition count 133
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 656 place count 89 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 658 place count 89 transition count 129
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 660 place count 87 transition count 125
Iterating global reduction 5 with 2 rules applied. Total rules applied 662 place count 87 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 664 place count 87 transition count 123
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 716 place count 61 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 718 place count 61 transition count 94
Performed 5 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 728 place count 56 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 730 place count 56 transition count 127
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 747 place count 56 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 749 place count 55 transition count 120
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 750 place count 54 transition count 117
Iterating global reduction 8 with 1 rules applied. Total rules applied 751 place count 54 transition count 117
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 759 place count 54 transition count 109
Free-agglomeration rule applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 779 place count 54 transition count 89
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 801 place count 34 transition count 87
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 808 place count 34 transition count 80
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 812 place count 34 transition count 80
Applied a total of 812 rules in 99 ms. Remains 34 /453 variables (removed 419) and now considering 80/594 (removed 514) transitions.
Finished structural reductions, in 1 iterations. Remains : 34/453 places, 80/594 transitions.
[2021-05-17 20:31:39] [INFO ] Flatten gal took : 36 ms
[2021-05-17 20:31:39] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:31:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11532872081807458185.gal : 7 ms
[2021-05-17 20:31:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6685933596180816956.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/ReachabilityCardinality11532872081807458185.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6685933596180816956.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/ReachabilityCardinality11532872081807458185.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6685933596180816956.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6685933596180816956.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 140
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :140 after 151
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :151 after 293
Reachability property net-ReachabilityCardinality-04 is true.
FORMULA net-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :293 after 1435
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,2051,0.03403,5000,2,260,12,2825,7,0,221,1872,0
Total reachable state count : 2051

Verifying 2 reachability properties.
Reachability property net-ReachabilityCardinality-04 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
net-ReachabilityCardinality-04,36,0.034756,5000,2,115,12,2825,8,0,233,1872,0
Invariant property net-ReachabilityCardinality-12 does not hold.
FORMULA net-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
net-ReachabilityCardinality-12,1,0.034993,5000,2,35,12,2825,8,0,235,1872,0
All properties solved without resorting to model-checking.

BK_STOP 1621283500349

--------------------
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="HealthRecord-PT-16"
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 HealthRecord-PT-16, 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 r292-tall-162124156400382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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