fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815600238
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FamilyReunion-PT-L00100M0010C005P005G002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.270 3600000.00 215726.00 567.20 TFTFTFTFFFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815600238.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 itslola
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815600238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 3.2K Apr 4 17:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 4 17:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 4 06:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 4 06:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 266K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 237K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 654K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 3 20:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 3 20:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 3 13:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 3 13:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 17M Mar 24 05:37 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 FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591306895616

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 21:41:38] [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, -timeout, 3600, -rebuildPNML]
[2020-06-04 21:41:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 21:41:40] [INFO ] Load time of PNML (sax parser for PT used): 1551 ms
[2020-06-04 21:41:40] [INFO ] Transformed 40605 places.
[2020-06-04 21:41:40] [INFO ] Transformed 36871 transitions.
[2020-06-04 21:41:40] [INFO ] Parsed PT model containing 40605 places and 36871 transitions in 1826 ms.
Reduce places removed 31 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 917 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 1 resets, run finished after 548 ms. (steps per millisecond=18 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 36871 rows 40574 cols
[2020-06-04 21:42:13] [INFO ] Computed 8805 place invariants in 30954 ms
[2020-06-04 21:42:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s24081 0)") while checking expression at index 0
[2020-06-04 21:42:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (>= s28553 0)") while checking expression at index 1
[2020-06-04 21:42:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s27276 0)") while checking expression at index 2
[2020-06-04 21:42:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 3
[2020-06-04 21:42:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s31407 0)") while checking expression at index 4
[2020-06-04 21:42:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s26548 0)") while checking expression at index 5
[2020-06-04 21:42:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 6
[2020-06-04 21:42:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s24623 0)") while checking expression at index 7
[2020-06-04 21:42:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s24640 0)") while checking expression at index 8
[2020-06-04 21:43:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s24492 0)") while checking expression at index 9
[2020-06-04 21:43:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 10
[2020-06-04 21:43:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s27079 0)") while checking expression at index 11
[2020-06-04 21:43:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= s25765 0)") while checking expression at index 12
Support contains 58 out of 40574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Discarding 4542 places :
Also discarding 4294 output transitions
Drop transitions removed 4294 transitions
Graph (complete) has 65258 edges and 40574 vertex of which 36032 are kept as prefixes of interest. Removing 4542 places using SCC suffix rule.503 ms
Drop transitions removed 712 transitions
Reduce isomorphic transitions removed 712 transitions.
Discarding 6654 places :
Implicit places reduction removed 6654 places
Performed 18905 Post agglomeration using F-continuation condition.Transition count delta: 18905
Iterating post reduction 0 with 26271 rules applied. Total rules applied 26272 place count 29378 transition count 12960
Reduce places removed 18905 places and 0 transitions.
Iterating post reduction 1 with 18905 rules applied. Total rules applied 45177 place count 10473 transition count 12960
Performed 1820 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1820 Pre rules applied. Total rules applied 45177 place count 10473 transition count 11140
Deduced a syphon composed of 1820 places in 14 ms
Ensure Unique test removed 914 places
Reduce places removed 2734 places and 0 transitions.
Iterating global reduction 2 with 4554 rules applied. Total rules applied 49731 place count 7739 transition count 11140
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Iterating post reduction 2 with 611 rules applied. Total rules applied 50342 place count 7734 transition count 10534
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 50948 place count 7128 transition count 10534
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 100 Pre rules applied. Total rules applied 50948 place count 7128 transition count 10434
Deduced a syphon composed of 100 places in 11 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 51148 place count 7028 transition count 10434
Symmetric choice reduction at 4 with 3643 rule applications. Total rules 54791 place count 7028 transition count 10434
Deduced a syphon composed of 3643 places in 12 ms
Reduce places removed 3643 places and 4113 transitions.
Iterating global reduction 4 with 7286 rules applied. Total rules applied 62077 place count 3385 transition count 6321
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Performed 602 Post agglomeration using F-continuation condition.Transition count delta: 602
Iterating post reduction 4 with 1308 rules applied. Total rules applied 63385 place count 3183 transition count 5215
Reduce places removed 602 places and 0 transitions.
Iterating post reduction 5 with 602 rules applied. Total rules applied 63987 place count 2581 transition count 5215
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 63987 place count 2581 transition count 5205
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 64007 place count 2571 transition count 5205
Symmetric choice reduction at 6 with 15 rule applications. Total rules 64022 place count 2571 transition count 5205
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 1215 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 64052 place count 2556 transition count 3990
Ensure Unique test removed 521 transitions
Reduce isomorphic transitions removed 521 transitions.
Discarding 196 places :
Implicit places reduction removed 196 places
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Iterating post reduction 6 with 911 rules applied. Total rules applied 64963 place count 2360 transition count 3275
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 7 with 194 rules applied. Total rules applied 65157 place count 2166 transition count 3275
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 99 Pre rules applied. Total rules applied 65157 place count 2166 transition count 3176
Deduced a syphon composed of 99 places in 6 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 8 with 198 rules applied. Total rules applied 65355 place count 2067 transition count 3176
Symmetric choice reduction at 8 with 777 rule applications. Total rules 66132 place count 2067 transition count 3176
Deduced a syphon composed of 777 places in 3 ms
Reduce places removed 777 places and 777 transitions.
Iterating global reduction 8 with 1554 rules applied. Total rules applied 67686 place count 1290 transition count 2399
Ensure Unique test removed 687 transitions
Reduce isomorphic transitions removed 687 transitions.
Iterating post reduction 8 with 687 rules applied. Total rules applied 68373 place count 1290 transition count 1712
Symmetric choice reduction at 9 with 2 rule applications. Total rules 68375 place count 1290 transition count 1712
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 68379 place count 1288 transition count 1710
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 211
Deduced a syphon composed of 211 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 9 with 426 rules applied. Total rules applied 68805 place count 1073 transition count 1499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 68807 place count 1072 transition count 1498
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 68809 place count 1071 transition count 1507
Free-agglomeration rule applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 68818 place count 1071 transition count 1498
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 68827 place count 1062 transition count 1498
Free-agglomeration rule (complex) applied 137 times.
Iterating global reduction 10 with 137 rules applied. Total rules applied 68964 place count 1062 transition count 1370
Ensure Unique test removed 102 places
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 10 with 239 rules applied. Total rules applied 69203 place count 823 transition count 1370
Symmetric choice reduction at 11 with 83 rule applications. Total rules 69286 place count 823 transition count 1370
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 332 transitions.
Iterating global reduction 11 with 166 rules applied. Total rules applied 69452 place count 740 transition count 1038
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 11 with 14 rules applied. Total rules applied 69466 place count 740 transition count 1038
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 69467 place count 740 transition count 1037
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 69468 place count 739 transition count 1036
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 69469 place count 738 transition count 1035
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 69470 place count 737 transition count 1034
Applied a total of 69470 rules in 21678 ms. Remains 737 /40574 variables (removed 39837) and now considering 1034/36871 (removed 35837) transitions.
Finished structural reductions, in 1 iterations. Remains : 737/40574 places, 1034/36871 transitions.
Incomplete random walk after 1000004 steps, including 2224 resets, run finished after 12007 ms. (steps per millisecond=83 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1]
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 3599 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 3623 ms. (steps per millisecond=276 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 3567 ms. (steps per millisecond=280 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 3504 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1034 rows 737 cols
[2020-06-04 21:44:07] [INFO ] Computed 115 place invariants in 13 ms
[2020-06-04 21:44:07] [INFO ] [Real]Absence check using 0 positive and 115 generalized place invariants in 190 ms returned sat
[2020-06-04 21:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:44:09] [INFO ] [Real]Absence check using state equation in 1885 ms returned unsat
[2020-06-04 21:44:09] [INFO ] [Real]Absence check using 0 positive and 115 generalized place invariants in 120 ms returned sat
[2020-06-04 21:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:44:11] [INFO ] [Real]Absence check using state equation in 2134 ms returned unsat
[2020-06-04 21:44:12] [INFO ] [Real]Absence check using 0 positive and 115 generalized place invariants in 158 ms returned sat
[2020-06-04 21:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:44:14] [INFO ] [Real]Absence check using state equation in 2324 ms returned unsat
[2020-06-04 21:44:14] [INFO ] [Real]Absence check using 0 positive and 115 generalized place invariants in 98 ms returned sat
[2020-06-04 21:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 21:44:15] [INFO ] [Real]Absence check using state equation in 501 ms returned unsat
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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="FamilyReunion-PT-L00100M0010C005P005G002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, 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 r170-smll-158987815600238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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