fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415200076
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
290.056 15433.00 32011.00 225.70 FF??T?FT????TF?? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415200076.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415200076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 60K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 430K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 153K May 5 16:51 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-06-00
FORMULA_NAME QuasiCertifProtocol-PT-06-01
FORMULA_NAME QuasiCertifProtocol-PT-06-02
FORMULA_NAME QuasiCertifProtocol-PT-06-03
FORMULA_NAME QuasiCertifProtocol-PT-06-04
FORMULA_NAME QuasiCertifProtocol-PT-06-05
FORMULA_NAME QuasiCertifProtocol-PT-06-06
FORMULA_NAME QuasiCertifProtocol-PT-06-07
FORMULA_NAME QuasiCertifProtocol-PT-06-08
FORMULA_NAME QuasiCertifProtocol-PT-06-09
FORMULA_NAME QuasiCertifProtocol-PT-06-10
FORMULA_NAME QuasiCertifProtocol-PT-06-11
FORMULA_NAME QuasiCertifProtocol-PT-06-12
FORMULA_NAME QuasiCertifProtocol-PT-06-13
FORMULA_NAME QuasiCertifProtocol-PT-06-14
FORMULA_NAME QuasiCertifProtocol-PT-06-15

=== Now, execution of the tool begins

BK_START 1621234343900

Running Version 0
[2021-05-17 06:52:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 06:52:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:52:26] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-17 06:52:26] [INFO ] Transformed 270 places.
[2021-05-17 06:52:26] [INFO ] Transformed 116 transitions.
[2021-05-17 06:52:26] [INFO ] Parsed PT model containing 270 places and 116 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:52:26] [INFO ] Initial state test concluded for 4 properties.
FORMULA QuasiCertifProtocol-PT-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 133 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 269 transition count 116
Applied a total of 1 rules in 28 ms. Remains 269 /270 variables (removed 1) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 269 cols
[2021-05-17 06:52:26] [INFO ] Computed 154 place invariants in 23 ms
[2021-05-17 06:52:26] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 116 rows 269 cols
[2021-05-17 06:52:26] [INFO ] Computed 154 place invariants in 11 ms
[2021-05-17 06:52:26] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 269 cols
[2021-05-17 06:52:26] [INFO ] Computed 154 place invariants in 6 ms
[2021-05-17 06:52:26] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/270 places, 116/116 transitions.
[2021-05-17 06:52:27] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 06:52:27] [INFO ] Flatten gal took : 46 ms
FORMULA QuasiCertifProtocol-PT-06-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:52:27] [INFO ] Flatten gal took : 16 ms
[2021-05-17 06:52:27] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 100000 steps, including 9835 resets, run finished after 341 ms. (steps per millisecond=293 ) properties (out of 23) seen :10
Running SMT prover for 13 properties.
// Phase 1: matrix 116 rows 269 cols
[2021-05-17 06:52:27] [INFO ] Computed 154 place invariants in 8 ms
[2021-05-17 06:52:27] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2021-05-17 06:52:27] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 32 ms returned sat
[2021-05-17 06:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:27] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-17 06:52:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:52:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-17 06:52:27] [INFO ] [Nat]Absence check using 2 positive and 152 generalized place invariants in 27 ms returned sat
[2021-05-17 06:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:28] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-17 06:52:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 06:52:28] [INFO ] Added : 56 causal constraints over 12 iterations in 217 ms. Result :sat
[2021-05-17 06:52:28] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2021-05-17 06:52:28] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 21 ms returned sat
[2021-05-17 06:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:28] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-17 06:52:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:52:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-17 06:52:28] [INFO ] [Nat]Absence check using 2 positive and 152 generalized place invariants in 25 ms returned sat
[2021-05-17 06:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:28] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-17 06:52:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 06:52:28] [INFO ] Added : 28 causal constraints over 6 iterations in 134 ms. Result :sat
[2021-05-17 06:52:28] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-17 06:52:28] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 24 ms returned sat
[2021-05-17 06:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:28] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-17 06:52:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 06:52:29] [INFO ] Added : 51 causal constraints over 11 iterations in 162 ms. Result :sat
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 19 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-17 06:52:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:52:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Nat]Absence check using 2 positive and 152 generalized place invariants in 18 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:29] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-17 06:52:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 06:52:29] [INFO ] Added : 50 causal constraints over 10 iterations in 113 ms. Result :sat
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 23 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-17 06:52:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 06:52:29] [INFO ] Added : 61 causal constraints over 13 iterations in 154 ms. Result :sat
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 17 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:29] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-17 06:52:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:52:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Nat]Absence check using 2 positive and 152 generalized place invariants in 23 ms returned sat
[2021-05-17 06:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:30] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-17 06:52:30] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 06:52:30] [INFO ] Added : 32 causal constraints over 7 iterations in 99 ms. Result :sat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 18 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 22 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-17 06:52:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:52:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Nat]Absence check using 2 positive and 152 generalized place invariants in 15 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:30] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-17 06:52:30] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 06:52:30] [INFO ] Added : 28 causal constraints over 6 iterations in 80 ms. Result :sat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 20 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 06:52:30] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 06:52:30] [INFO ] Added : 27 causal constraints over 6 iterations in 75 ms. Result :sat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 17 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 73 ms returned sat
[2021-05-17 06:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:31] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-17 06:52:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:52:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-17 06:52:31] [INFO ] [Nat]Absence check using 2 positive and 152 generalized place invariants in 21 ms returned sat
[2021-05-17 06:52:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:31] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-17 06:52:31] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 06:52:31] [INFO ] Added : 27 causal constraints over 6 iterations in 87 ms. Result :sat
[2021-05-17 06:52:31] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2021-05-17 06:52:31] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 31 ms returned sat
[2021-05-17 06:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:31] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-17 06:52:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:52:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-17 06:52:31] [INFO ] [Nat]Absence check using 2 positive and 152 generalized place invariants in 27 ms returned sat
[2021-05-17 06:52:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:31] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-17 06:52:31] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-17 06:52:31] [INFO ] Added : 27 causal constraints over 6 iterations in 136 ms. Result :sat
[2021-05-17 06:52:31] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-17 06:52:31] [INFO ] [Real]Absence check using 2 positive and 152 generalized place invariants in 23 ms returned sat
[2021-05-17 06:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:52:31] [INFO ] [Real]Absence check using state equation in 66 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA QuasiCertifProtocol-PT-06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 7 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 116/116 transitions.
Graph (complete) has 852 edges and 269 vertex of which 259 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.7 ms
Discarding 10 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 256 transition count 113
Applied a total of 5 rules in 76 ms. Remains 256 /269 variables (removed 13) and now considering 113/116 (removed 3) transitions.
// Phase 1: matrix 113 rows 256 cols
[2021-05-17 06:52:32] [INFO ] Computed 145 place invariants in 6 ms
[2021-05-17 06:52:32] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 113 rows 256 cols
[2021-05-17 06:52:32] [INFO ] Computed 145 place invariants in 5 ms
[2021-05-17 06:52:32] [INFO ] Implicit Places using invariants and state equation in 347 ms returned [145, 146, 147, 148, 152, 157, 158, 195, 196, 220, 221, 222, 223, 224]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 655 ms to find 14 implicit places.
[2021-05-17 06:52:32] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 113 rows 242 cols
[2021-05-17 06:52:32] [INFO ] Computed 132 place invariants in 24 ms
[2021-05-17 06:52:32] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Starting structural reductions, iteration 1 : 242/269 places, 113/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2021-05-17 06:52:33] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 113 rows 242 cols
[2021-05-17 06:52:33] [INFO ] Computed 132 place invariants in 9 ms
[2021-05-17 06:52:33] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 2 iterations. Remains : 242/269 places, 113/116 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s235 s236 s237 s238 s239 s240 s241))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-06-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-00 finished in 1517 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(F((p0&&F(((p1 U G(p0))||X(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 10 out of 269 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 269/269 places, 116/116 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 254 transition count 116
Applied a total of 15 rules in 7 ms. Remains 254 /269 variables (removed 15) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 254 cols
[2021-05-17 06:52:33] [INFO ] Computed 139 place invariants in 6 ms
[2021-05-17 06:52:34] [INFO ] Implicit Places using invariants in 706 ms returned []
// Phase 1: matrix 116 rows 254 cols
[2021-05-17 06:52:34] [INFO ] Computed 139 place invariants in 4 ms
[2021-05-17 06:52:34] [INFO ] Implicit Places using invariants and state equation in 360 ms returned [148, 149, 150, 151, 155, 160, 161]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 1071 ms to find 7 implicit places.
// Phase 1: matrix 116 rows 247 cols
[2021-05-17 06:52:34] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:52:34] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Starting structural reductions, iteration 1 : 247/269 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 247 cols
[2021-05-17 06:52:34] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:52:34] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 2 iterations. Remains : 247/269 places, 116/116 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s246 s54), p2:(LEQ (ADD s238 s239 s241 s242 s243 s244 s245) s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9836 reset in 360 ms.
Product exploration explored 100000 steps with 9833 reset in 215 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), p0, p2]
Adopting property with smaller alphabet thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 247 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 247/247 places, 116/116 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 116
Applied a total of 1 rules in 4 ms. Remains 246 /247 variables (removed 1) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:36] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:52:36] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:36] [INFO ] Computed 132 place invariants in 11 ms
[2021-05-17 06:52:36] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 246 cols
[2021-05-17 06:52:36] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:52:36] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Finished structural reductions, in 1 iterations. Remains : 246/247 places, 116/116 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9836 reset in 114 ms.
Product exploration explored 100000 steps with 9833 reset in 180 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 246 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 246/246 places, 116/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 72 ms. Remains 246 /246 variables (removed 0) and now considering 117/116 (removed -1) transitions.
[2021-05-17 06:52:37] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 117 rows 246 cols
[2021-05-17 06:52:37] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:52:37] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 117/116 transitions.
Product exploration explored 100000 steps with 9833 reset in 257 ms.
Product exploration explored 100000 steps with 9839 reset in 235 ms.
Starting structural reductions, iteration 0 : 247/247 places, 116/116 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 245 transition count 116
Applied a total of 2 rules in 10 ms. Remains 245 /247 variables (removed 2) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:52:38] [INFO ] Computed 132 place invariants in 8 ms
[2021-05-17 06:52:38] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:52:38] [INFO ] Computed 132 place invariants in 6 ms
[2021-05-17 06:52:38] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:52:38] [INFO ] Computed 132 place invariants in 10 ms
[2021-05-17 06:52:38] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/247 places, 116/116 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621234359333

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415200076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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