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-158987872400820.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-28, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400820
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 55K Apr 12 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 07:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 07:58 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 18K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 77K Apr 10 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 10 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 9 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 9 20:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 61K 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 1.4M 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-28-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591183525847

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 11:25:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 11:25:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 11:25:27] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2020-06-03 11:25:27] [INFO ] Transformed 2998 places.
[2020-06-03 11:25:27] [INFO ] Transformed 446 transitions.
[2020-06-03 11:25:27] [INFO ] Parsed PT model containing 2998 places and 446 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
Incomplete random walk after 100000 steps, including 3028 resets, run finished after 1560 ms. (steps per millisecond=64 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 446 rows 2998 cols
[2020-06-03 11:25:29] [INFO ] Computed 2553 place invariants in 214 ms
[2020-06-03 11:25:30] [INFO ] [Real]Absence check using 32 positive place invariants in 144 ms returned sat
[2020-06-03 11:25:36] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 6139 ms returned sat
[2020-06-03 11:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:25:49] [INFO ] [Real]Absence check using state equation in 13062 ms returned sat
[2020-06-03 11:25:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:25:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 408 ms returned sat
[2020-06-03 11:26:09] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 19432 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 11:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:26: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: Stream closed") while checking expression at index 0
[2020-06-03 11:26:10] [INFO ] [Real]Absence check using 32 positive place invariants in 225 ms returned sat
[2020-06-03 11:26:21] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 11004 ms returned sat
[2020-06-03 11:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:26:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:26:29] [INFO ] [Real]Absence check using state equation in 8430 ms returned (error "Failed to check-sat")
[2020-06-03 11:26:30] [INFO ] [Real]Absence check using 32 positive place invariants in 265 ms returned sat
[2020-06-03 11:26:41] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 11161 ms returned sat
[2020-06-03 11:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:26:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:26:49] [INFO ] [Real]Absence check using state equation in 8289 ms returned unknown
[2020-06-03 11:26:49] [INFO ] [Real]Absence check using 32 positive place invariants in 126 ms returned sat
[2020-06-03 11:26:54] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5039 ms returned sat
[2020-06-03 11:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:27:09] [INFO ] [Real]Absence check using state equation in 14606 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 11:27:09] [INFO ] [Real]Absence check using 32 positive place invariants in 165 ms returned sat
[2020-06-03 11:27:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:27:29] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 19542 ms returned (error "Failed to check-sat")
[2020-06-03 11:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:27:29] [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: Stream closed") while checking expression at index 4
[2020-06-03 11:27:29] [INFO ] [Real]Absence check using 32 positive place invariants in 116 ms returned sat
[2020-06-03 11:27:34] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4278 ms returned sat
[2020-06-03 11:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:27:49] [INFO ] [Real]Absence check using state equation in 15171 ms returned sat
[2020-06-03 11:27:53] [INFO ] Deduced a trap composed of 10 places in 3919 ms
[2020-06-03 11:27: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: Stream closed (> (+ s213 s214 s219 s220 s2624 s2829 s2833 s2863 s2919 s2961) 0)") while checking expression at index 5
[2020-06-03 11:27:53] [INFO ] [Real]Absence check using 32 positive place invariants in 154 ms returned sat
[2020-06-03 11:27:59] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5152 ms returned sat
[2020-06-03 11:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:28:13] [INFO ] [Real]Absence check using state equation in 14415 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 11:28:13] [INFO ] [Real]Absence check using 32 positive place invariants in 144 ms returned sat
[2020-06-03 11:28:18] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4639 ms returned sat
[2020-06-03 11:28:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:28:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:28:33] [INFO ] [Real]Absence check using state equation in 14895 ms returned (error "Failed to check-sat")
[2020-06-03 11:28:33] [INFO ] [Real]Absence check using 32 positive place invariants in 124 ms returned sat
[2020-06-03 11:28:38] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4757 ms returned sat
[2020-06-03 11:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:28:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:28:53] [INFO ] [Real]Absence check using state equation in 14806 ms returned (error "Failed to check-sat")
[2020-06-03 11:28:54] [INFO ] [Real]Absence check using 32 positive place invariants in 228 ms returned sat
[2020-06-03 11:29:12] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 18875 ms returned sat
[2020-06-03 11:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:29:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:29:13] [INFO ] [Real]Absence check using state equation in 622 ms returned (error "Failed to check-sat")
[2020-06-03 11:29:14] [INFO ] [Real]Absence check using 32 positive place invariants in 146 ms returned sat
[2020-06-03 11:29:25] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 11709 ms returned sat
[2020-06-03 11:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:29:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:29:33] [INFO ] [Real]Absence check using state equation in 7763 ms returned unknown
[2020-06-03 11:29:34] [INFO ] [Real]Absence check using 32 positive place invariants in 118 ms returned sat
[2020-06-03 11:29:38] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4213 ms returned sat
[2020-06-03 11:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:29:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:29:53] [INFO ] [Real]Absence check using state equation in 15359 ms returned unknown
[2020-06-03 11:29:53] [INFO ] [Real]Absence check using 32 positive place invariants in 103 ms returned unsat
[2020-06-03 11:29:54] [INFO ] [Real]Absence check using 32 positive place invariants in 114 ms returned sat
[2020-06-03 11:29:58] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4117 ms returned sat
[2020-06-03 11:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:30:11] [INFO ] [Real]Absence check using state equation in 12650 ms returned sat
[2020-06-03 11:30:11] [INFO ] Deduced a trap composed of 6 places in 339 ms
[2020-06-03 11:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2020-06-03 11:30:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:30:12] [INFO ] [Nat]Absence check using 32 positive place invariants in 89 ms returned sat
[2020-06-03 11:30:16] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 4060 ms returned sat
[2020-06-03 11:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:30:28] [INFO ] [Nat]Absence check using state equation in 12678 ms returned sat
[2020-06-03 11:30:29] [INFO ] Deduced a trap composed of 6 places in 303 ms
[2020-06-03 11:30:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2020-06-03 11:30:29] [INFO ] Computed and/alt/rep : 416/3055/416 causal constraints in 63 ms.
[2020-06-03 11:30:31] [INFO ] Added : 100 causal constraints over 20 iterations in 2515 ms. Result :(error "Failed to check-sat")
[2020-06-03 11:30:32] [INFO ] [Real]Absence check using 32 positive place invariants in 130 ms returned sat
[2020-06-03 11:30:36] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4273 ms returned sat
[2020-06-03 11:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:30:50] [INFO ] [Real]Absence check using state equation in 14162 ms returned sat
[2020-06-03 11:30:50] [INFO ] Computed and/alt/rep : 416/3055/416 causal constraints in 69 ms.
[2020-06-03 11:30:51] [INFO ] Added : 30 causal constraints over 6 iterations in 987 ms. Result :(error "Failed to check-sat")
[2020-06-03 11:30:52] [INFO ] [Real]Absence check using 32 positive place invariants in 123 ms returned sat
[2020-06-03 11:30:56] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4427 ms returned sat
[2020-06-03 11:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:31:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:31:11] [INFO ] [Real]Absence check using state equation in 15163 ms returned (error "Failed to check-sat")
[2020-06-03 11:31:12] [INFO ] [Real]Absence check using 32 positive place invariants in 80 ms returned sat
[2020-06-03 11:31:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 3984 ms returned sat
[2020-06-03 11:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:31:30] [INFO ] [Real]Absence check using state equation in 14515 ms returned sat
[2020-06-03 11:31:30] [INFO ] Computed and/alt/rep : 416/3055/416 causal constraints in 49 ms.
[2020-06-03 11:31:31] [INFO ] Added : 40 causal constraints over 8 iterations in 1013 ms. Result :unknown
[2020-06-03 11:31:32] [INFO ] [Real]Absence check using 32 positive place invariants in 120 ms returned sat
[2020-06-03 11:31:36] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4272 ms returned sat
[2020-06-03 11:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:31:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:31:51] [INFO ] [Real]Absence check using state equation in 15296 ms returned unknown
[2020-06-03 11:31:52] [INFO ] [Real]Absence check using 32 positive place invariants in 113 ms returned sat
[2020-06-03 11:31:56] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4039 ms returned sat
[2020-06-03 11:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:32:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:32:11] [INFO ] [Real]Absence check using state equation in 15584 ms returned (error "Failed to check-sat")
[2020-06-03 11:32:12] [INFO ] [Real]Absence check using 32 positive place invariants in 81 ms returned sat
[2020-06-03 11:32:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 3969 ms returned sat
[2020-06-03 11:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:32:31] [INFO ] [Real]Absence check using state equation in 15134 ms returned sat
[2020-06-03 11:32:31] [INFO ] Computed and/alt/rep : 416/3055/416 causal constraints in 46 ms.
[2020-06-03 11:32:31] [INFO ] Added : 20 causal constraints over 4 iterations in 470 ms. Result :unknown
[2020-06-03 11:32:32] [INFO ] [Real]Absence check using 32 positive place invariants in 116 ms returned sat
[2020-06-03 11:32:36] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4089 ms returned sat
[2020-06-03 11:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:32:41] [INFO ] [Real]Absence check using state equation in 4637 ms returned unsat
[2020-06-03 11:32:41] [INFO ] [Real]Absence check using 32 positive place invariants in 113 ms returned sat
[2020-06-03 11:32:45] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4441 ms returned sat
[2020-06-03 11:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:33:01] [INFO ] [Real]Absence check using state equation in 15185 ms returned (error "Failed to check-sat")
[2020-06-03 11:33:01] [INFO ] [Real]Absence check using 32 positive place invariants in 83 ms returned sat
[2020-06-03 11:33:05] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4048 ms returned sat
[2020-06-03 11:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:21] [INFO ] [Real]Absence check using state equation in 15701 ms returned sat
[2020-06-03 11:33:25] [INFO ] Deduced a trap composed of 10 places in 3912 ms
[2020-06-03 11:33:25] [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 (> (+ s213 s214 s219 s220 s2624 s2829 s2833 s2863 s2919 s2961) 0)") while checking expression at index 22
[2020-06-03 11:33:25] [INFO ] [Real]Absence check using 32 positive place invariants in 81 ms returned sat
[2020-06-03 11:33:29] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4142 ms returned sat
[2020-06-03 11:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:44] [INFO ] [Real]Absence check using state equation in 14921 ms returned sat
[2020-06-03 11:33:44] [INFO ] Computed and/alt/rep : 416/3055/416 causal constraints in 55 ms.
[2020-06-03 11:33:45] [INFO ] Added : 25 causal constraints over 5 iterations in 502 ms. Result :(error "Failed to check-sat")
[2020-06-03 11:33:45] [INFO ] [Real]Absence check using 32 positive place invariants in 114 ms returned sat
[2020-06-03 11:33:49] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4230 ms returned sat
[2020-06-03 11:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:34:05] [INFO ] [Real]Absence check using state equation in 15383 ms returned unknown
[2020-06-03 11:34:05] [INFO ] [Real]Absence check using 32 positive place invariants in 123 ms returned sat
[2020-06-03 11:34:10] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4698 ms returned sat
[2020-06-03 11:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:34:25] [INFO ] [Real]Absence check using state equation in 14896 ms returned (error "Failed to check-sat")
[2020-06-03 11:34:25] [INFO ] [Real]Absence check using 32 positive place invariants in 85 ms returned sat
[2020-06-03 11:34:29] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4446 ms returned sat
[2020-06-03 11:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:37] [INFO ] [Real]Absence check using state equation in 7645 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 11:34:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 11:34:37] [INFO ] Flatten gal took : 194 ms
[2020-06-03 11:34:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 11:34:38] [INFO ] Flatten gal took : 108 ms
FORMULA QuasiCertifProtocol-PT-28-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 11:34:38] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2020-06-03 11:34:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ QuasiCertifProtocol-PT-28 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-28-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 12439248 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16093540 kB

--------------------
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-28"
export BK_EXAMINATION="CTLFireability"
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-28, examination is CTLFireability"
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-158987872400820"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;