Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814200334.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 14:36 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 Dekker-PT-050-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590111079596

[2020-05-22 01:31:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 01:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:31:21] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2020-05-22 01:31:21] [INFO ] Transformed 250 places.
[2020-05-22 01:31:21] [INFO ] Transformed 2600 transitions.
[2020-05-22 01:31:21] [INFO ] Found NUPN structural information;
[2020-05-22 01:31:21] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 257 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 129 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
Probabilistic random walk after 10000001 steps, saw 66418 distinct states, run finished after 29290 ms. (steps per millisecond=341 ) properties seen :[0, 0, 0]
[2020-05-22 01:31:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-05-22 01:31:51] [INFO ] Computed 150 place invariants in 16 ms
[2020-05-22 01:31:51] [INFO ] [Real]Absence check using 100 positive place invariants in 48 ms returned sat
[2020-05-22 01:31:51] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 20 ms returned sat
[2020-05-22 01:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:31:51] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-22 01:31:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:31:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 42 ms returned sat
[2020-05-22 01:31:51] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-05-22 01:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:31:51] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-05-22 01:31:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:31:51] [INFO ] [Nat]Added 50 Read/Feed constraints in 15 ms returned sat
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 5 places in 70 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 6 places in 20 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:31:52] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:31:52] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 775 ms
[2020-05-22 01:31:52] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 60 ms.
[2020-05-22 01:31:53] [INFO ] Added : 51 causal constraints over 11 iterations in 586 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-22 01:31:53] [INFO ] [Real]Absence check using 100 positive place invariants in 32 ms returned sat
[2020-05-22 01:31:53] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2020-05-22 01:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:31:53] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2020-05-22 01:31:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:31:53] [INFO ] [Nat]Absence check using 100 positive place invariants in 42 ms returned sat
[2020-05-22 01:31:53] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2020-05-22 01:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:31:53] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-05-22 01:31:53] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 6 places in 37 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:31:54] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:31:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 506 ms
[2020-05-22 01:31:54] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 61 ms.
[2020-05-22 01:31:54] [INFO ] Added : 51 causal constraints over 11 iterations in 434 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-05-22 01:31:55] [INFO ] [Real]Absence check using 100 positive place invariants in 30 ms returned sat
[2020-05-22 01:31:55] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 29 ms returned sat
[2020-05-22 01:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:31:55] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2020-05-22 01:31:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:31:55] [INFO ] [Nat]Absence check using 100 positive place invariants in 34 ms returned sat
[2020-05-22 01:31:55] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-05-22 01:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:31:55] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2020-05-22 01:31:55] [INFO ] [Nat]Added 50 Read/Feed constraints in 17 ms returned sat
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2020-05-22 01:31:55] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:31:56] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:31:56] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-05-22 01:31:56] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-05-22 01:31:56] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:31:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 539 ms
[2020-05-22 01:31:56] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 51 ms.
[2020-05-22 01:31:56] [INFO ] Added : 51 causal constraints over 11 iterations in 394 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
Incomplete Parikh walk after 11500 steps, including 98 resets, run finished after 229 ms. (steps per millisecond=50 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA Dekker-PT-050-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11700 steps, including 98 resets, run finished after 164 ms. (steps per millisecond=71 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 98 resets, run finished after 153 ms. (steps per millisecond=75 ) properties seen :[1, 0] could not realise parikh vector
FORMULA Dekker-PT-050-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 176 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 707 ms. (steps per millisecond=141 ) properties seen :[0]
[2020-05-22 01:31:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-05-22 01:31:57] [INFO ] Computed 150 place invariants in 5 ms
[2020-05-22 01:31:58] [INFO ] [Real]Absence check using 100 positive place invariants in 47 ms returned sat
[2020-05-22 01:31:58] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 21 ms returned sat
[2020-05-22 01:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:31:58] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-05-22 01:31:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:31:58] [INFO ] [Nat]Absence check using 100 positive place invariants in 33 ms returned sat
[2020-05-22 01:31:58] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-05-22 01:31:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:31:58] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-05-22 01:31:58] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:31:58] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2020-05-22 01:31:58] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-05-22 01:31:58] [INFO ] Deduced a trap composed of 6 places in 38 ms
[2020-05-22 01:31:58] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-05-22 01:31:58] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-22 01:31:58] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:31:58] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-05-22 01:31:58] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-22 01:31:58] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:59] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:31:59] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:31:59] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:31:59] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:31:59] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:31:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 502 ms
[2020-05-22 01:31:59] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 153 ms.
[2020-05-22 01:31:59] [INFO ] Added : 51 causal constraints over 11 iterations in 630 ms. Result :sat
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7550 ms. (steps per millisecond=132 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2279 ms. (steps per millisecond=438 ) properties seen :[0]
Interrupted probabilistic random walk after 11768984 steps, run timeout after 30001 ms. (steps per millisecond=392 ) properties seen :[0]
Probabilistic random walk after 11768984 steps, saw 76826 distinct states, run finished after 30001 ms. (steps per millisecond=392 ) properties seen :[0]
[2020-05-22 01:32:39] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-05-22 01:32:39] [INFO ] Computed 150 place invariants in 4 ms
[2020-05-22 01:32:39] [INFO ] [Real]Absence check using 100 positive place invariants in 35 ms returned sat
[2020-05-22 01:32:39] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 25 ms returned sat
[2020-05-22 01:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:39] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-05-22 01:32:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:32:40] [INFO ] [Nat]Absence check using 100 positive place invariants in 47 ms returned sat
[2020-05-22 01:32:40] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 20 ms returned sat
[2020-05-22 01:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:40] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2020-05-22 01:32:40] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:32:40] [INFO ] [Nat]Added 50 Read/Feed constraints in 24 ms returned sat
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:32:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 630 ms
[2020-05-22 01:32:41] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 55 ms.
[2020-05-22 01:32:41] [INFO ] Added : 51 causal constraints over 11 iterations in 481 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 11700 steps, including 98 resets, run finished after 232 ms. (steps per millisecond=50 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 91 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 94 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2020-05-22 01:32:41] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-05-22 01:32:41] [INFO ] Computed 150 place invariants in 3 ms
[2020-05-22 01:32:43] [INFO ] Implicit Places using invariants in 1349 ms returned [100, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 1355 ms to find 48 implicit places.
[2020-05-22 01:32:43] [INFO ] Redundant transitions in 277 ms returned []
[2020-05-22 01:32:43] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-05-22 01:32:43] [INFO ] Computed 102 place invariants in 2 ms
[2020-05-22 01:32:45] [INFO ] Dead Transitions using invariants and state equation in 2271 ms returned []
Starting structural reductions, iteration 1 : 202/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 101 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2020-05-22 01:32:46] [INFO ] Redundant transitions in 70 ms returned []
[2020-05-22 01:32:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-05-22 01:32:46] [INFO ] Computed 102 place invariants in 1 ms
[2020-05-22 01:32:48] [INFO ] Dead Transitions using invariants and state equation in 2066 ms returned []
Finished structural reductions, in 2 iterations. Remains : 202/250 places, 2600/2600 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7098 ms. (steps per millisecond=140 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties seen :[0]
Interrupted probabilistic random walk after 13760969 steps, run timeout after 30001 ms. (steps per millisecond=458 ) properties seen :[0]
Probabilistic random walk after 13760969 steps, saw 87009 distinct states, run finished after 30001 ms. (steps per millisecond=458 ) properties seen :[0]
[2020-05-22 01:33:26] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-05-22 01:33:26] [INFO ] Computed 102 place invariants in 1 ms
[2020-05-22 01:33:27] [INFO ] [Real]Absence check using 100 positive place invariants in 40 ms returned sat
[2020-05-22 01:33:27] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 01:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:27] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-22 01:33:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:33:27] [INFO ] [Nat]Absence check using 100 positive place invariants in 77 ms returned sat
[2020-05-22 01:33:27] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 01:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:27] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2020-05-22 01:33:27] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:33:27] [INFO ] [Nat]Added 50 Read/Feed constraints in 14 ms returned sat
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:33:28] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 1176 ms
[2020-05-22 01:33:28] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 48 ms.
[2020-05-22 01:33:29] [INFO ] Added : 51 causal constraints over 11 iterations in 416 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 13100 steps, including 98 resets, run finished after 163 ms. (steps per millisecond=80 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 56 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 2600/2600 transitions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 54 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2020-05-22 01:33:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-05-22 01:33:29] [INFO ] Computed 102 place invariants in 1 ms
[2020-05-22 01:33:29] [INFO ] Implicit Places using invariants in 436 ms returned []
[2020-05-22 01:33:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-05-22 01:33:29] [INFO ] Computed 102 place invariants in 1 ms
[2020-05-22 01:33:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:33:30] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2020-05-22 01:33:30] [INFO ] Redundant transitions in 186 ms returned []
[2020-05-22 01:33:30] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-05-22 01:33:30] [INFO ] Computed 102 place invariants in 1 ms
[2020-05-22 01:33:32] [INFO ] Dead Transitions using invariants and state equation in 2031 ms returned []
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 2600/2600 transitions.
Discarding 184 places :
Also discarding 2392 output transitions
Drop transitions removed 2392 transitions
Graph (complete) has 310 edges and 202 vertex of which 18 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.6 ms
Ensure Unique test removed 2 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 195 place count 16 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 199 place count 14 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 202 place count 14 transition count 11
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 211 place count 8 transition count 8
Applied a total of 211 rules in 13 ms. Remains 8 /202 variables (removed 194) and now considering 8/2600 (removed 2592) transitions.
// Phase 1: matrix 8 rows 8 cols
[2020-05-22 01:33:32] [INFO ] Computed 4 place invariants in 1 ms
[2020-05-22 01:33:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-05-22 01:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2020-05-22 01:33:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:33:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-22 01:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:32] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2020-05-22 01:33:32] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints in 0 ms.
[2020-05-22 01:33:32] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2020-05-22 01:33:33] [INFO ] Flatten gal took : 218 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:33:33] [INFO ] Applying decomposition
[2020-05-22 01:33:33] [INFO ] Flatten gal took : 526 ms
[2020-05-22 01:33:33] [INFO ] Flatten gal took : 355 ms
[2020-05-22 01:33:34] [INFO ] Input system was already deterministic with 2600 transitions.
[2020-05-22 01:33:34] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2020-05-22 01:33:34] [INFO ] Input system was already deterministic with 2600 transitions.
[2020-05-22 01:33:34] [INFO ] Built C files in 795ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph8146466465126076275.txt, -o, /tmp/graph8146466465126076275.bin, -w, /tmp/graph8146466465126076275.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8146466465126076275.bin, -l, -1, -v, -w, /tmp/graph8146466465126076275.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:33:34] [INFO ] Decomposing Gal with order
[2020-05-22 01:33:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:33:35] [INFO ] Ran tautology test, simplified 0 / 1 in 1239 ms.
[2020-05-22 01:33:35] [INFO ] BMC solution for property Dekker-PT-050-ReachabilityCardinality-11(UNSAT) depth K=0 took 20 ms
[2020-05-22 01:33:35] [INFO ] BMC solution for property Dekker-PT-050-ReachabilityCardinality-11(UNSAT) depth K=1 took 8 ms
[2020-05-22 01:33:35] [INFO ] Removed a total of 7249 redundant transitions.
[2020-05-22 01:33:35] [INFO ] Flatten gal took : 509 ms
[2020-05-22 01:33:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 107 ms.
[2020-05-22 01:33:35] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 48 ms
[2020-05-22 01:33:35] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : Dekker-PT-050-ReachabilityCardinality-11 with value :((((u6.p3_6==0)||(u33.p0_33==1))||(u13.flag_0_13==0))||(i49.u50.p0_1==1))
built 1226 ordering constraints for composite.
built 6 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 200 out of 2600 initially.
// Phase 1: matrix 200 rows 202 cols
[2020-05-22 01:33:36] [INFO ] Computed 102 place invariants in 3 ms
inv : p0_1 + p1_1 + p3_1 = 1
inv : flag_0_39 + p1_39 + p3_39 = 1
inv : flag_0_31 + p1_31 + p3_31 = 1
inv : flag_0_32 + flag_1_32 = 1
inv : flag_0_42 + flag_1_42 = 1
inv : flag_0_13 + p1_13 + p3_13 = 1
inv : flag_0_27 + flag_1_27 = 1
inv : flag_1_1 - p1_1 - p3_1 = 0
inv : flag_0_3 + flag_1_3 = 1
inv : flag_0_22 + p1_22 + p3_22 = 1
inv : flag_0_15 + p1_15 + p3_15 = 1
inv : flag_0_6 + p1_6 + p3_6 = 1
inv : flag_0_48 + p1_48 + p3_48 = 1
inv : flag_0_47 + flag_1_47 = 1
inv : flag_0_23 + flag_1_23 = 1
inv : flag_0_2 + flag_1_2 = 1
inv : flag_0_7 + flag_1_7 = 1
inv : flag_0_0 + p1_0 + p3_0 = 1
inv : flag_0_8 + flag_1_8 = 1
inv : flag_0_20 + p1_20 + p3_20 = 1
inv : flag_0_18 + flag_1_18 = 1
inv : flag_0_4 + p1_4 + p3_4 = 1
inv : flag_0_17 + p1_17 + p3_17 = 1
inv : flag_0_2 + p1_2 + p3_2 = 1
inv : flag_0_13 + flag_1_13 = 1
inv : flag_0_37 + flag_1_37 = 1
inv : flag_0_37 + p1_37 + p3_37 = 1
inv : flag_0_34 + p1_34 + p3_34 = 1
inv : flag_0_43 + p1_43 + p3_43 = 1
inv : flag_0_19 + p1_19 + p3_19 = 1
inv : flag_0_4 + flag_1_4 = 1
inv : flag_0_14 + flag_1_14 = 1
inv : flag_0_26 + flag_1_26 = 1
inv : flag_0_27 + p1_27 + p3_27 = 1
inv : flag_0_36 + flag_1_36 = 1
inv : flag_0_1 + p1_1 + p3_1 = 1
inv : flag_0_46 + flag_1_46 = 1
inv : flag_0_11 + flag_1_11 = 1
inv : flag_0_41 + p1_41 + p3_41 = 1
inv : flag_0_29 + p1_29 + p3_29 = 1
inv : flag_0_39 + flag_1_39 = 1
inv : flag_0_43 + flag_1_43 = 1
inv : flag_1_33 - p1_33 - p3_33 = 0
inv : flag_0_45 + p1_45 + p3_45 = 1
inv : flag_0_25 + p1_25 + p3_25 = 1
inv : flag_0_8 + p1_8 + p3_8 = 1
inv : flag_0_12 + p1_12 + p3_12 = 1
inv : flag_0_17 + flag_1_17 = 1
inv : flag_0_10 + p1_10 + p3_10 = 1
inv : flag_0_49 + flag_1_49 = 1
inv : flag_0_15 + flag_1_15 = 1
inv : flag_0_10 + flag_1_10 = 1
inv : flag_0_47 + p1_47 + p3_47 = 1
inv : flag_0_38 + p1_38 + p3_38 = 1
inv : flag_0_0 + flag_1_0 = 1
inv : flag_0_20 + flag_1_20 = 1
inv : flag_0_30 + flag_1_30 = 1
inv : flag_0_5 + p1_5 + p3_5 = 1
inv : flag_0_23 + p1_23 + p3_23 = 1
inv : flag_0_40 + p1_40 + p3_40 = 1
inv : p0_33 + p1_33 + p3_33 = 1
inv : flag_0_21 + p1_21 + p3_21 = 1
inv : flag_0_7 + p1_7 + p3_7 = 1
inv : flag_0_35 + flag_1_35 = 1
inv : flag_0_14 + p1_14 + p3_14 = 1
inv : flag_0_36 + p1_36 + p3_36 = 1
inv : flag_0_49 + p1_49 + p3_49 = 1
inv : flag_0_30 + p1_30 + p3_30 = 1
inv : flag_0_16 + p1_16 + p3_16 = 1
inv : flag_0_24 + flag_1_24 = 1
inv : flag_0_40 + flag_1_40 = 1
inv : flag_0_34 + flag_1_34 = 1
inv : flag_0_21 + flag_1_21 = 1
inv : flag_0_29 + flag_1_29 = 1
inv : flag_0_18 + p1_18 + p3_18 = 1
inv : flag_0_5 + flag_1_5 = 1
inv : flag_0_32 + p1_32 + p3_32 = 1
inv : flag_0_3 + p1_3 + p3_3 = 1
inv : flag_0_45 + flag_1_45 = 1
inv : flag_0_31 + flag_1_31 = 1
inv : flag_0_9 + p1_9 + p3_9 = 1
inv : flag_0_16 + flag_1_16 = 1
inv : flag_0_35 + p1_35 + p3_35 = 1
inv : flag_0_48 + flag_1_48 = 1
inv : flag_0_19 + flag_1_19 = 1
inv : flag_0_33 + p1_33 + p3_33 = 1
inv : flag_0_42 + p1_42 + p3_42 = 1
inv : flag_0_28 + p1_28 + p3_28 = 1
inv : flag_0_12 + flag_1_12 = 1
inv : flag_0_28 + flag_1_28 = 1
inv : flag_0_22 + flag_1_22 = 1
inv : flag_0_38 + flag_1_38 = 1
inv : flag_0_44 + flag_1_44 = 1
inv : flag_0_46 + p1_46 + p3_46 = 1
inv : flag_0_44 + p1_44 + p3_44 = 1
inv : flag_0_6 + flag_1_6 = 1
inv : flag_0_11 + p1_11 + p3_11 = 1
inv : flag_0_24 + p1_24 + p3_24 = 1
inv : flag_0_26 + p1_26 + p3_26 = 1
inv : flag_0_25 + flag_1_25 = 1
inv : flag_0_9 + flag_1_9 = 1
inv : flag_0_41 + flag_1_41 = 1
Total of 102 invariants.
[2020-05-22 01:33:36] [INFO ] Computed 102 place invariants in 20 ms
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
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,2.92734e+16,0.388019,11524,114,18,2942,1369,2846,3052,44,1379,0
Total reachable state count : 29273397577908224

Verifying 1 reachability properties.
Invariant property Dekker-PT-050-ReachabilityCardinality-11 does not hold.
FORMULA Dekker-PT-050-ReachabilityCardinality-11 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
Dekker-PT-050-ReachabilityCardinality-11,7.03687e+13,0.38949,11524,59,12,2942,1369,2849,3052,49,1379,113
[2020-05-22 01:33:36] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS tools runner thread asked to quit. Dying gracefully.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 01:33:36] [WARNING] Unexpected error occurred while running SMT. Was verifying Dekker-PT-050-ReachabilityCardinality-11 SMT depth 2
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-22 01:33:36] [INFO ] During BMC, SMT solver timed out at depth 2
[2020-05-22 01:33:36] [INFO ] BMC solving timed out (3600000 secs) at depth 2
Exception in thread "Thread-5" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:282)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 01:33:36] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1590111216456

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Dekker-PT-050"
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"

# 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 Dekker-PT-050, 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 r066-tajo-158922814200334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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