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-162089415300118.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-32, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415300118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.7M
-rw-r--r-- 1 mcc users 863K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.0M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 86K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 507K 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 24K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Mar 27 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Mar 27 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K 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 1.8M 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-32-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621236857918

Running Version 0
[2021-05-17 07:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 07:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:34:19] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2021-05-17 07:34:19] [INFO ] Transformed 3806 places.
[2021-05-17 07:34:19] [INFO ] Transformed 506 transitions.
[2021-05-17 07:34:19] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 76 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 268 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 16) seen :1
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Probabilistic random walk after 1000001 steps, saw 121333 distinct states, run finished after 2892 ms. (steps per millisecond=345 ) properties seen :{}
Running SMT prover for 15 properties.
// Phase 1: matrix 506 rows 3806 cols
[2021-05-17 07:34:23] [INFO ] Computed 3301 place invariants in 235 ms
[2021-05-17 07:34:23] [INFO ] [Real]Absence check using 3 positive place invariants in 55 ms returned sat
[2021-05-17 07:34:24] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 843 ms returned sat
[2021-05-17 07:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:26] [INFO ] [Real]Absence check using state equation in 1873 ms returned sat
[2021-05-17 07:34:26] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 57 ms.
[2021-05-17 07:34:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
[2021-05-17 07:34:28] [INFO ] [Real]Absence check using 3 positive place invariants in 44 ms returned sat
[2021-05-17 07:34:29] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 714 ms returned sat
[2021-05-17 07:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:33] [INFO ] [Real]Absence check using state equation in 3798 ms returned unknown
[2021-05-17 07:34:33] [INFO ] [Real]Absence check using 3 positive place invariants in 42 ms returned unsat
[2021-05-17 07:34:34] [INFO ] [Real]Absence check using 3 positive place invariants in 42 ms returned sat
[2021-05-17 07:34:35] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 595 ms returned sat
[2021-05-17 07:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:36] [INFO ] [Real]Absence check using state equation in 1335 ms returned sat
[2021-05-17 07:34:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:34:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 42 ms returned unsat
[2021-05-17 07:34:37] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2021-05-17 07:34:38] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 943 ms returned sat
[2021-05-17 07:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:40] [INFO ] [Real]Absence check using state equation in 1316 ms returned sat
[2021-05-17 07:34:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:34:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 42 ms returned sat
[2021-05-17 07:34:41] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 905 ms returned sat
[2021-05-17 07:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:45] [INFO ] [Nat]Absence check using state equation in 3566 ms returned unknown
[2021-05-17 07:34:45] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2021-05-17 07:34:46] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 714 ms returned sat
[2021-05-17 07:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:48] [INFO ] [Real]Absence check using state equation in 2016 ms returned sat
[2021-05-17 07:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:34:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 39 ms returned sat
[2021-05-17 07:34:49] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 718 ms returned sat
[2021-05-17 07:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:53] [INFO ] [Nat]Absence check using state equation in 3823 ms returned unknown
[2021-05-17 07:34:54] [INFO ] [Real]Absence check using 3 positive place invariants in 53 ms returned sat
[2021-05-17 07:34:54] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 846 ms returned sat
[2021-05-17 07:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:56] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2021-05-17 07:34:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2021-05-17 07:34:57] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 831 ms returned sat
[2021-05-17 07:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:34:58] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2021-05-17 07:34:58] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 54 ms.
[2021-05-17 07:35:04] [INFO ] Deduced a trap composed of 5 places in 3822 ms of which 12 ms to minimize.
[2021-05-17 07:35:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-17 07:35:05] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2021-05-17 07:35:05] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 693 ms returned sat
[2021-05-17 07:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:07] [INFO ] [Real]Absence check using state equation in 1425 ms returned sat
[2021-05-17 07:35:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:35:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 40 ms returned sat
[2021-05-17 07:35:08] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 823 ms returned sat
[2021-05-17 07:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:10] [INFO ] [Nat]Absence check using state equation in 1673 ms returned sat
[2021-05-17 07:35:10] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 65 ms.
[2021-05-17 07:35:12] [INFO ] Added : 43 causal constraints over 9 iterations in 1572 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-17 07:35:12] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2021-05-17 07:35:13] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 815 ms returned sat
[2021-05-17 07:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:14] [INFO ] [Real]Absence check using state equation in 646 ms returned unsat
[2021-05-17 07:35:14] [INFO ] [Real]Absence check using 3 positive place invariants in 55 ms returned sat
[2021-05-17 07:35:15] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 772 ms returned sat
[2021-05-17 07:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:18] [INFO ] [Real]Absence check using state equation in 2747 ms returned sat
[2021-05-17 07:35:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:35:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 30 ms returned sat
[2021-05-17 07:35:19] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 770 ms returned sat
[2021-05-17 07:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:23] [INFO ] [Nat]Absence check using state equation in 3825 ms returned unknown
[2021-05-17 07:35:23] [INFO ] [Real]Absence check using 3 positive place invariants in 38 ms returned sat
[2021-05-17 07:35:24] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 868 ms returned sat
[2021-05-17 07:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:25] [INFO ] [Real]Absence check using state equation in 1113 ms returned sat
[2021-05-17 07:35:26] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 49 ms.
[2021-05-17 07:35:32] [INFO ] Deduced a trap composed of 5 places in 3814 ms of which 16 ms to minimize.
[2021-05-17 07:35:32] [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 close... while checking expression at index 11
[2021-05-17 07:35:32] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2021-05-17 07:35:33] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 650 ms returned sat
[2021-05-17 07:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:34] [INFO ] [Real]Absence check using state equation in 1380 ms returned sat
[2021-05-17 07:35:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:35:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 30 ms returned sat
[2021-05-17 07:35:35] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 629 ms returned sat
[2021-05-17 07:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:37] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2021-05-17 07:35:37] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 64 ms.
[2021-05-17 07:35:43] [INFO ] Deduced a trap composed of 5 places in 3709 ms of which 18 ms to minimize.
[2021-05-17 07:35:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
[2021-05-17 07:35:43] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2021-05-17 07:35:44] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 621 ms returned sat
[2021-05-17 07:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:44] [INFO ] [Real]Absence check using state equation in 112 ms returned unsat
[2021-05-17 07:35:44] [INFO ] [Real]Absence check using 3 positive place invariants in 49 ms returned sat
[2021-05-17 07:35:45] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 627 ms returned sat
[2021-05-17 07:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:46] [INFO ] [Real]Absence check using state equation in 1075 ms returned sat
[2021-05-17 07:35:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:35:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2021-05-17 07:35:47] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 622 ms returned sat
[2021-05-17 07:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:35:48] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2021-05-17 07:35:48] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 55 ms.
[2021-05-17 07:35:50] [INFO ] Added : 74 causal constraints over 15 iterations in 2089 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 4500 steps, including 97 resets, run finished after 68 ms. (steps per millisecond=66 ) properties (out of 10) seen :2 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7700 steps, including 101 resets, run finished after 93 ms. (steps per millisecond=82 ) properties (out of 8) seen :2 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 280 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3769 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.49 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 171 rules applied. Total rules applied 172 place count 3703 transition count 401
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 174 place count 3702 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 3701 transition count 400
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 175 place count 3701 transition count 367
Deduced a syphon composed of 33 places in 4 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 99 rules applied. Total rules applied 274 place count 3635 transition count 367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 275 place count 3635 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 3634 transition count 366
Applied a total of 276 rules in 954 ms. Remains 3634 /3806 variables (removed 172) and now considering 366/506 (removed 140) transitions.
Finished structural reductions, in 1 iterations. Remains : 3634/3806 places, 366/506 transitions.
[2021-05-17 07:35:52] [INFO ] Flatten gal took : 313 ms
[2021-05-17 07:35:53] [INFO ] Flatten gal took : 244 ms
[2021-05-17 07:35:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12466458589280087212.gal : 61 ms
[2021-05-17 07:35:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3569663018301333188.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12466458589280087212.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3569663018301333188.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12466458589280087212.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3569663018301333188.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3569663018301333188.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :9 after 257
Detected timeout of ITS tools.
[2021-05-17 07:36:08] [INFO ] Flatten gal took : 81 ms
[2021-05-17 07:36:08] [INFO ] Applying decomposition
[2021-05-17 07:36:08] [INFO ] Flatten gal took : 209 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7609747661721901976.txt, -o, /tmp/graph7609747661721901976.bin, -w, /tmp/graph7609747661721901976.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7609747661721901976.bin, -l, -1, -v, -w, /tmp/graph7609747661721901976.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:36:09] [INFO ] Decomposing Gal with order
[2021-05-17 07:36:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:36:09] [INFO ] Removed a total of 197 redundant transitions.
[2021-05-17 07:36:09] [INFO ] Flatten gal took : 304 ms
[2021-05-17 07:36:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 25 ms.
[2021-05-17 07:36:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6424268176596991192.gal : 14 ms
[2021-05-17 07:36:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7868731030344836392.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6424268176596991192.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7868731030344836392.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6424268176596991192.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7868731030344836392.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7868731030344836392.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 17
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :17 after 129
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :129 after 8193
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :8193 after 1.67772e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.67772e+07 after 8.58993e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12054560148989056654
[2021-05-17 07:36:25] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12054560148989056654
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12054560148989056654]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12054560148989056654] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12054560148989056654] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 9090 resets, run finished after 10284 ms. (steps per millisecond=97 ) properties (out of 6) seen :2
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 778651 steps, including 288 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 371 resets, run finished after 3950 ms. (steps per millisecond=253 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 373 resets, run finished after 3643 ms. (steps per millisecond=274 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 377 resets, run finished after 3420 ms. (steps per millisecond=292 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 366 rows 3634 cols
[2021-05-17 07:36:53] [INFO ] Computed 3268 place invariants in 149 ms
[2021-05-17 07:36:54] [INFO ] [Real]Absence check using 0 positive and 3268 generalized place invariants in 837 ms returned sat
[2021-05-17 07:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:36:55] [INFO ] [Real]Absence check using state equation in 1481 ms returned sat
[2021-05-17 07:36:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:36:56] [INFO ] [Nat]Absence check using 0 positive and 3268 generalized place invariants in 692 ms returned sat
[2021-05-17 07:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:37:04] [INFO ] [Nat]Absence check using state equation in 7387 ms returned unknown
[2021-05-17 07:37:05] [INFO ] [Real]Absence check using 0 positive and 3268 generalized place invariants in 808 ms returned sat
[2021-05-17 07:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:37:06] [INFO ] [Real]Absence check using state equation in 1467 ms returned sat
[2021-05-17 07:37:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:37:08] [INFO ] [Nat]Absence check using 0 positive and 3268 generalized place invariants in 672 ms returned sat
[2021-05-17 07:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:37:22] [INFO ] [Nat]Absence check using state equation in 14052 ms returned sat
[2021-05-17 07:37:22] [INFO ] Computed and/alt/rep : 264/264/264 causal constraints (skipped 101 transitions) in 47 ms.
[2021-05-17 07:37:25] [INFO ] Added : 111 causal constraints over 23 iterations in 3253 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-17 07:37:26] [INFO ] [Real]Absence check using 0 positive and 3268 generalized place invariants in 762 ms returned sat
[2021-05-17 07:37:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:37:27] [INFO ] [Real]Absence check using state equation in 1000 ms returned sat
[2021-05-17 07:37:28] [INFO ] Computed and/alt/rep : 264/264/264 causal constraints (skipped 101 transitions) in 37 ms.
[2021-05-17 07:37:31] [INFO ] Added : 117 causal constraints over 24 iterations in 3501 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-17 07:37:33] [INFO ] [Real]Absence check using 0 positive and 3268 generalized place invariants in 861 ms returned sat
[2021-05-17 07:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:37:34] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2021-05-17 07:37:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:37:35] [INFO ] [Nat]Absence check using 0 positive and 3268 generalized place invariants in 669 ms returned sat
[2021-05-17 07:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:37:36] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2021-05-17 07:37:36] [INFO ] Computed and/alt/rep : 264/264/264 causal constraints (skipped 101 transitions) in 33 ms.
[2021-05-17 07:37:39] [INFO ] Added : 118 causal constraints over 24 iterations in 3025 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 11500 steps, including 99 resets, run finished after 205 ms. (steps per millisecond=56 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 12100 steps, including 99 resets, run finished after 200 ms. (steps per millisecond=60 ) properties (out of 3) seen :2 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 12200 steps, including 99 resets, run finished after 186 ms. (steps per millisecond=65 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 165 out of 3634 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3634/3634 places, 366/366 transitions.
Graph (complete) has 42836 edges and 3634 vertex of which 2512 are kept as prefixes of interest. Removing 1122 places using SCC suffix rule.7 ms
Discarding 1122 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 2512 transition count 234
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 1 with 66 rules applied. Total rules applied 166 place count 2479 transition count 201
Applied a total of 166 rules in 485 ms. Remains 2479 /3634 variables (removed 1155) and now considering 201/366 (removed 165) transitions.
Finished structural reductions, in 1 iterations. Remains : 2479/3634 places, 201/366 transitions.
[2021-05-17 07:37:40] [INFO ] Flatten gal took : 70 ms
[2021-05-17 07:37:40] [INFO ] Flatten gal took : 68 ms
[2021-05-17 07:37:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12442780769708473327.gal : 5 ms
[2021-05-17 07:37:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6664806334813441065.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12442780769708473327.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6664806334813441065.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12442780769708473327.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6664806334813441065.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6664806334813441065.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 65
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :65 after 4097
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4097 after 8.38861e+06
Detected timeout of ITS tools.
[2021-05-17 07:37:56] [INFO ] Flatten gal took : 50 ms
[2021-05-17 07:37:56] [INFO ] Applying decomposition
[2021-05-17 07:37:56] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8777997616973069413.txt, -o, /tmp/graph8777997616973069413.bin, -w, /tmp/graph8777997616973069413.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8777997616973069413.bin, -l, -1, -v, -w, /tmp/graph8777997616973069413.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:37:56] [INFO ] Decomposing Gal with order
[2021-05-17 07:37:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:37:56] [INFO ] Removed a total of 65 redundant transitions.
[2021-05-17 07:37:56] [INFO ] Flatten gal took : 149 ms
[2021-05-17 07:37:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2021-05-17 07:37:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3152978377519319218.gal : 9 ms
[2021-05-17 07:37:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8635306934147891194.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3152978377519319218.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8635306934147891194.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3152978377519319218.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8635306934147891194.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8635306934147891194.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 257
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9134887481854512950
[2021-05-17 07:38:11] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9134887481854512950
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9134887481854512950]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9134887481854512950] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9134887481854512950] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 5917 resets, run finished after 20990 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 423727 steps, including 111 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{}
Interrupted probabilistic random walk after 11489052 steps, run timeout after 30001 ms. (steps per millisecond=382 ) properties seen :{}
Probabilistic random walk after 11489052 steps, saw 1106927 distinct states, run finished after 30001 ms. (steps per millisecond=382 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 201 rows 2479 cols
[2021-05-17 07:39:08] [INFO ] Computed 2278 place invariants in 36 ms
[2021-05-17 07:39:09] [INFO ] [Real]Absence check using 0 positive and 2278 generalized place invariants in 560 ms returned sat
[2021-05-17 07:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:39:10] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2021-05-17 07:39:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:39:11] [INFO ] [Nat]Absence check using 0 positive and 2278 generalized place invariants in 558 ms returned sat
[2021-05-17 07:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:39:12] [INFO ] [Nat]Absence check using state equation in 1375 ms returned unsat
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.

BK_STOP 1621237153686

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-32"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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-32, 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 r178-tajo-162089415300118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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