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.r273-smll-162123879800214.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Vasy2003-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r273-smll-162123879800214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 26 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 207K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621478053089

Running Version 0
[2021-05-20 02:34:16] [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-20 02:34:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 02:34:16] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2021-05-20 02:34:16] [INFO ] Transformed 485 places.
[2021-05-20 02:34:16] [INFO ] Transformed 776 transitions.
[2021-05-20 02:34:16] [INFO ] Found NUPN structural information;
[2021-05-20 02:34:16] [INFO ] Parsed PT model containing 485 places and 776 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA Vasy2003-PT-none-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :2
FORMULA Vasy2003-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2021-05-20 02:34:17] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2021-05-20 02:34:17] [INFO ] Computed 66 place invariants in 37 ms
[2021-05-20 02:34:17] [INFO ] [Real]Absence check using 59 positive place invariants in 48 ms returned sat
[2021-05-20 02:34:17] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:18] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2021-05-20 02:34:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:18] [INFO ] [Nat]Absence check using 59 positive place invariants in 34 ms returned sat
[2021-05-20 02:34:18] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-20 02:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:18] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2021-05-20 02:34:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-20 02:34:18] [INFO ] [Nat]Added 73 Read/Feed constraints in 26 ms returned sat
[2021-05-20 02:34:19] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 88 ms.
[2021-05-20 02:34:22] [INFO ] Added : 193 causal constraints over 39 iterations in 3540 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-20 02:34:22] [INFO ] [Real]Absence check using 59 positive place invariants in 44 ms returned sat
[2021-05-20 02:34:22] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:23] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2021-05-20 02:34:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:23] [INFO ] [Nat]Absence check using 59 positive place invariants in 43 ms returned sat
[2021-05-20 02:34:23] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:23] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2021-05-20 02:34:23] [INFO ] [Nat]Added 73 Read/Feed constraints in 28 ms returned sat
[2021-05-20 02:34:24] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 74 ms.
[2021-05-20 02:34:25] [INFO ] Added : 116 causal constraints over 24 iterations in 1953 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-20 02:34:26] [INFO ] [Real]Absence check using 59 positive place invariants in 42 ms returned sat
[2021-05-20 02:34:26] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:26] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2021-05-20 02:34:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:27] [INFO ] [Real]Absence check using 59 positive place invariants in 39 ms returned sat
[2021-05-20 02:34:27] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:27] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2021-05-20 02:34:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:27] [INFO ] [Nat]Absence check using 59 positive place invariants in 38 ms returned sat
[2021-05-20 02:34:27] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:28] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2021-05-20 02:34:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 33 ms returned sat
[2021-05-20 02:34:28] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 88 ms.
[2021-05-20 02:34:30] [INFO ] Added : 138 causal constraints over 29 iterations in 2503 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-20 02:34:30] [INFO ] [Real]Absence check using 59 positive place invariants in 39 ms returned sat
[2021-05-20 02:34:30] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:31] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2021-05-20 02:34:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:31] [INFO ] [Real]Absence check using 59 positive place invariants in 39 ms returned sat
[2021-05-20 02:34:31] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:32] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-20 02:34:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:32] [INFO ] [Real]Absence check using 59 positive place invariants in 40 ms returned sat
[2021-05-20 02:34:32] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:32] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2021-05-20 02:34:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:33] [INFO ] [Nat]Absence check using 59 positive place invariants in 43 ms returned sat
[2021-05-20 02:34:33] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:33] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2021-05-20 02:34:33] [INFO ] [Nat]Added 73 Read/Feed constraints in 42 ms returned sat
[2021-05-20 02:34:33] [INFO ] Deduced a trap composed of 133 places in 241 ms of which 2 ms to minimize.
[2021-05-20 02:34:34] [INFO ] Deduced a trap composed of 131 places in 216 ms of which 1 ms to minimize.
[2021-05-20 02:34:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 611 ms
[2021-05-20 02:34:34] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 78 ms.
[2021-05-20 02:34:37] [INFO ] Added : 189 causal constraints over 40 iterations in 3302 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-20 02:34:37] [INFO ] [Real]Absence check using 59 positive place invariants in 42 ms returned sat
[2021-05-20 02:34:37] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:38] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2021-05-20 02:34:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:38] [INFO ] [Nat]Absence check using 59 positive place invariants in 24 ms returned unsat
[2021-05-20 02:34:38] [INFO ] [Real]Absence check using 59 positive place invariants in 26 ms returned sat
[2021-05-20 02:34:38] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-20 02:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:34:38] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-20 02:34:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:34:38] [INFO ] [Nat]Absence check using 59 positive place invariants in 27 ms returned unsat
FORMULA Vasy2003-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 82600 steps, including 836 resets, run finished after 444 ms. (steps per millisecond=186 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA Vasy2003-PT-none-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17700 steps, including 143 resets, run finished after 127 ms. (steps per millisecond=139 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA Vasy2003-PT-none-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24000 steps, including 165 resets, run finished after 166 ms. (steps per millisecond=144 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 70600 steps, including 507 resets, run finished after 460 ms. (steps per millisecond=153 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA Vasy2003-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 158 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1555 edges and 483 vertex of which 413 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.8 ms
Discarding 70 places :
Also discarding 55 output transitions
Drop transitions removed 55 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 413 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 412 transition count 669
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 23 place count 412 transition count 653
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 55 place count 396 transition count 653
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 189 place count 262 transition count 519
Ensure Unique test removed 1 places
Iterating global reduction 2 with 135 rules applied. Total rules applied 324 place count 261 transition count 519
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 355 place count 261 transition count 488
Discarding 98 places :
Symmetric choice reduction at 3 with 98 rule applications. Total rules 453 place count 163 transition count 364
Iterating global reduction 3 with 98 rules applied. Total rules applied 551 place count 163 transition count 364
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 71 rules applied. Total rules applied 622 place count 163 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 623 place count 162 transition count 293
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 663 place count 122 transition count 221
Iterating global reduction 5 with 40 rules applied. Total rules applied 703 place count 122 transition count 221
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 739 place count 122 transition count 185
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 741 place count 120 transition count 173
Iterating global reduction 6 with 2 rules applied. Total rules applied 743 place count 120 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 744 place count 120 transition count 172
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 745 place count 119 transition count 171
Iterating global reduction 7 with 1 rules applied. Total rules applied 746 place count 119 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 748 place count 119 transition count 169
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 762 place count 112 transition count 162
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 768 place count 112 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 769 place count 112 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 770 place count 111 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 771 place count 110 transition count 154
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 17 edges and 102 vertex of which 4 / 102 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 13 rules applied. Total rules applied 784 place count 100 transition count 150
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 788 place count 100 transition count 146
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 788 place count 100 transition count 141
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 15 rules applied. Total rules applied 803 place count 90 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 806 place count 90 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 806 place count 90 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 5 rules applied. Total rules applied 811 place count 87 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 811 place count 87 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 814 place count 85 transition count 135
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 815 place count 85 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 821 place count 81 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 821 place count 81 transition count 131
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 823 place count 80 transition count 131
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 825 place count 78 transition count 129
Iterating global reduction 13 with 2 rules applied. Total rules applied 827 place count 78 transition count 129
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 833 place count 75 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 841 place count 75 transition count 118
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 842 place count 74 transition count 116
Iterating global reduction 14 with 1 rules applied. Total rules applied 843 place count 74 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 846 place count 74 transition count 113
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 853 place count 74 transition count 106
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 15 rules applied. Total rules applied 868 place count 65 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 868 place count 65 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 871 place count 63 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 871 place count 63 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 874 place count 61 transition count 98
Graph (trivial) has 10 edges and 61 vertex of which 2 / 61 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 876 place count 59 transition count 98
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 879 place count 59 transition count 95
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 881 place count 59 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 882 place count 59 transition count 92
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 886 place count 57 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 888 place count 56 transition count 89
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 890 place count 56 transition count 92
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 896 place count 54 transition count 88
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 898 place count 54 transition count 86
Applied a total of 898 rules in 359 ms. Remains 54 /485 variables (removed 431) and now considering 86/752 (removed 666) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/485 places, 86/752 transitions.
[2021-05-20 02:34:40] [INFO ] Flatten gal took : 77 ms
[2021-05-20 02:34:40] [INFO ] Flatten gal took : 31 ms
[2021-05-20 02:34:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality836182307263174796.gal : 13 ms
[2021-05-20 02:34:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8512902511189949621.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/ReachabilityCardinality836182307263174796.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8512902511189949621.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/ReachabilityCardinality836182307263174796.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8512902511189949621.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8512902511189949621.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 41
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :41 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 108
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,180,0.063643,4352,2,183,11,2198,7,0,308,1845,0
Total reachable state count : 180

Verifying 1 reachability properties.
Invariant property Vasy2003-PT-none-ReachabilityCardinality-00 does not hold.
FORMULA Vasy2003-PT-none-ReachabilityCardinality-00 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
Vasy2003-PT-none-ReachabilityCardinality-00,1,0.064886,4724,2,55,11,2198,7,0,311,1845,0
All properties solved without resorting to model-checking.

BK_STOP 1621478082226

--------------------
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="Vasy2003-PT-none"
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 Vasy2003-PT-none, 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 r273-smll-162123879800214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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