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.r176-tajo-158987872400806.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 itslola
Input is QuasiCertifProtocol-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400806
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 26K Apr 12 06:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 06:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 07:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 07:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 10 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 9 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 9 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 27K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 686K 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 QuasiCertifProtocol-PT-18-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591182512161

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 11:08:34] [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-03 11:08:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 11:08:34] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2020-06-03 11:08:34] [INFO ] Transformed 1398 places.
[2020-06-03 11:08:34] [INFO ] Transformed 296 transitions.
[2020-06-03 11:08:34] [INFO ] Parsed PT model containing 1398 places and 296 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 441 resets, run finished after 204 ms. (steps per millisecond=49 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 62 ms. (steps per millisecond=161 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 33 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 43 resets, run finished after 47 ms. (steps per millisecond=212 ) 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 32 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 51 ms. (steps per millisecond=196 ) 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 32 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 29 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 32 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 32 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 31 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 35 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 19 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 35 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 30 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 296 rows 1398 cols
[2020-06-03 11:08:35] [INFO ] Computed 1103 place invariants in 67 ms
[2020-06-03 11:08:35] [INFO ] [Real]Absence check using 3 positive place invariants in 65 ms returned sat
[2020-06-03 11:08:36] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 959 ms returned sat
[2020-06-03 11:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:08:40] [INFO ] [Real]Absence check using state equation in 3546 ms returned (error "Failed to check-sat")
[2020-06-03 11:08:40] [INFO ] [Real]Absence check using 3 positive place invariants in 61 ms returned sat
[2020-06-03 11:08:41] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 843 ms returned sat
[2020-06-03 11:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:08:45] [INFO ] [Real]Absence check using state equation in 3484 ms returned sat
[2020-06-03 11:08:45] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 41 ms.
0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
[2020-06-03 11:08:45] [INFO ] Added : 10 causal constraints over 2 iterations in 265 ms. Result :(error "Failed to check-sat")
[2020-06-03 11:08:45] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2020-06-03 11:08:46] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1143 ms returned sat
[2020-06-03 11:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:08:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:08:50] [INFO ] [Real]Absence check using state equation in 3683 ms returned (error "Failed to check-sat")
[2020-06-03 11:08:50] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-03 11:08:51] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 841 ms returned sat
[2020-06-03 11:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:08:54] [INFO ] [Real]Absence check using state equation in 3114 ms returned sat
[2020-06-03 11:08:54] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 67 ms.
[2020-06-03 11:08:55] [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 (=> (> t64 0) (and (> t128 0) (< o128 o64)))") while checking expression at index 3
[2020-06-03 11:08:55] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:08:56] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 940 ms returned sat
[2020-06-03 11:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:08:59] [INFO ] [Real]Absence check using state equation in 2748 ms returned sat
[2020-06-03 11:08:59] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 48 ms.
[2020-06-03 11:09:00] [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 (=> (> t156 0) (and (and (> t128 0) (< o128 o156)) (and (> t88 0) (< o88 o156)) (and (> t89 0) (< o89 o156)) (and (> t90 0) (< o90 o156)) (and (> t91 0) (< o91 o156)) (and (> t84 0) (< o84 o156)) (and (> t85 0) (< o85 o156)) (and (> t86 0) (< o86 o156)) (and (> t87 0) (< o87 o156)) (and (> t64 0) (< o64 o156)) (and (> t65 0) (< o65 o156)) (and (> t66 0) (< o66 o156)) (and (> t67 0) (< o67 o156)) (and (> t93 0) (< o93 o156)) (and (> t92 0) (< o92 o156)) (and (> t95 0) (< o95 o156)) (and (> t94 0) (< o94 o156)) (and (> t68 0) (< o68 o156)) (and (> t69 0) (< o69 o156)) (and (> t71 0) (< o71 o156))))") while checking expression at index 4
[2020-06-03 11:09:00] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned unsat
[2020-06-03 11:09:00] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:09:02] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1148 ms returned sat
[2020-06-03 11:09:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:04] [INFO ] [Real]Absence check using state equation in 2790 ms returned sat
[2020-06-03 11:09:04] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 22 ms.
[2020-06-03 11:09:05] [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 (=> (> t95 0) (and (> t128 0) (< o128 o95)))") while checking expression at index 6
[2020-06-03 11:09:05] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:09:06] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 917 ms returned sat
[2020-06-03 11:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:10] [INFO ] [Real]Absence check using state equation in 3312 ms returned sat
[2020-06-03 11:09:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:09:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:09:11] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 812 ms returned sat
[2020-06-03 11:09:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:14] [INFO ] [Nat]Absence check using state equation in 2909 ms returned sat
[2020-06-03 11:09:14] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 24 ms.
[2020-06-03 11:09:14] [INFO ] Added : 63 causal constraints over 13 iterations in 598 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 11:09:14] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2020-06-03 11:09:15] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 849 ms returned sat
[2020-06-03 11:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:18] [INFO ] [Real]Absence check using state equation in 3105 ms returned sat
[2020-06-03 11:09:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:09:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:09:20] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 965 ms returned sat
[2020-06-03 11:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:23] [INFO ] [Nat]Absence check using state equation in 3013 ms returned sat
[2020-06-03 11:09:23] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 17 ms.
[2020-06-03 11:09:23] [INFO ] Added : 63 causal constraints over 13 iterations in 605 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-03 11:09:23] [INFO ] [Real]Absence check using 3 positive place invariants in 58 ms returned sat
[2020-06-03 11:09:24] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 996 ms returned sat
[2020-06-03 11:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:26] [INFO ] [Real]Absence check using state equation in 1736 ms returned unsat
[2020-06-03 11:09:26] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-03 11:09:27] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 799 ms returned sat
[2020-06-03 11:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:31] [INFO ] [Real]Absence check using state equation in 3740 ms returned sat
[2020-06-03 11:09:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:09:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-06-03 11:09:32] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 836 ms returned sat
[2020-06-03 11:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:35] [INFO ] [Nat]Absence check using state equation in 2819 ms returned sat
[2020-06-03 11:09:35] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 29 ms.
[2020-06-03 11:09:35] [INFO ] Added : 63 causal constraints over 13 iterations in 467 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-03 11:09:35] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:09:36] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 818 ms returned sat
[2020-06-03 11:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:39] [INFO ] [Real]Absence check using state equation in 3152 ms returned unsat
[2020-06-03 11:09:40] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-03 11:09:40] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 882 ms returned sat
[2020-06-03 11:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:41] [INFO ] [Real]Absence check using state equation in 223 ms returned unsat
[2020-06-03 11:09:41] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:09:42] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1026 ms returned sat
[2020-06-03 11:09:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:45] [INFO ] [Real]Absence check using state equation in 3164 ms returned sat
[2020-06-03 11:09:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:09:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-06-03 11:09:46] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 907 ms returned sat
[2020-06-03 11:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:09:49] [INFO ] [Nat]Absence check using state equation in 3057 ms returned sat
[2020-06-03 11:09:49] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 58 ms.
[2020-06-03 11:09:50] [INFO ] Added : 85 causal constraints over 17 iterations in 836 ms. Result :unknown
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 14300 steps, including 187 resets, run finished after 193 ms. (steps per millisecond=74 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1] could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 6400 steps, including 117 resets, run finished after 35 ms. (steps per millisecond=182 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 6400 steps, including 119 resets, run finished after 36 ms. (steps per millisecond=177 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 6400 steps, including 116 resets, run finished after 38 ms. (steps per millisecond=168 ) properties seen :[0] could not realise parikh vector
Support contains 61 out of 1398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1398/1398 places, 296/296 transitions.
Discarding 421 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 9608 edges and 1398 vertex of which 977 are kept as prefixes of interest. Removing 421 places using SCC suffix rule.17 ms
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 977 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 976 transition count 253
Symmetric choice reduction at 2 with 36 rule applications. Total rules 79 place count 976 transition count 253
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 36 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 151 place count 940 transition count 217
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 940 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 939 transition count 216
Partial Post-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 172 place count 939 transition count 216
Symmetric choice reduction at 3 with 18 rule applications. Total rules 190 place count 939 transition count 216
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 226 place count 921 transition count 198
Applied a total of 226 rules in 405 ms. Remains 921 /1398 variables (removed 477) and now considering 198/296 (removed 98) transitions.
Finished structural reductions, in 1 iterations. Remains : 921/1398 places, 198/296 transitions.
Incomplete random walk after 1000000 steps, including 44200 resets, run finished after 2818 ms. (steps per millisecond=354 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 4329 resets, run finished after 1761 ms. (steps per millisecond=567 ) properties seen :[0]
Interrupted probabilistic random walk after 19153893 steps, run timeout after 30001 ms. (steps per millisecond=638 ) properties seen :[0]
Probabilistic random walk after 19153893 steps, saw 2362545 distinct states, run finished after 30002 ms. (steps per millisecond=638 ) properties seen :[0]
// Phase 1: matrix 198 rows 921 cols
[2020-06-03 11:10:25] [INFO ] Computed 723 place invariants in 43 ms
[2020-06-03 11:10:26] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-03 11:10:26] [INFO ] [Real]Absence check using 2 positive and 721 generalized place invariants in 567 ms returned sat
[2020-06-03 11:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:10:28] [INFO ] [Real]Absence check using state equation in 2058 ms returned unsat
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-03 FALSE 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="QuasiCertifProtocol-PT-18"
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 QuasiCertifProtocol-PT-18, 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 r176-tajo-158987872400806"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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