fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254772300609
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Dekker-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
619.523 24354.00 48254.00 728.70 FTFFFTFFTTTTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772300609.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300609
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.7K Apr 30 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 247K May 10 09:33 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 Dekker-PT-020-CTLCardinality-00
FORMULA_NAME Dekker-PT-020-CTLCardinality-01
FORMULA_NAME Dekker-PT-020-CTLCardinality-02
FORMULA_NAME Dekker-PT-020-CTLCardinality-03
FORMULA_NAME Dekker-PT-020-CTLCardinality-04
FORMULA_NAME Dekker-PT-020-CTLCardinality-05
FORMULA_NAME Dekker-PT-020-CTLCardinality-06
FORMULA_NAME Dekker-PT-020-CTLCardinality-07
FORMULA_NAME Dekker-PT-020-CTLCardinality-08
FORMULA_NAME Dekker-PT-020-CTLCardinality-09
FORMULA_NAME Dekker-PT-020-CTLCardinality-10
FORMULA_NAME Dekker-PT-020-CTLCardinality-11
FORMULA_NAME Dekker-PT-020-CTLCardinality-12
FORMULA_NAME Dekker-PT-020-CTLCardinality-13
FORMULA_NAME Dekker-PT-020-CTLCardinality-14
FORMULA_NAME Dekker-PT-020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652631253052

Running Version 202205111006
[2022-05-15 16:14:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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]
[2022-05-15 16:14:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:14:14] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-05-15 16:14:14] [INFO ] Transformed 100 places.
[2022-05-15 16:14:14] [INFO ] Transformed 440 transitions.
[2022-05-15 16:14:14] [INFO ] Found NUPN structural information;
[2022-05-15 16:14:14] [INFO ] Parsed PT model containing 100 places and 440 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-020-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 17 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2022-05-15 16:14:14] [INFO ] Computed 60 place invariants in 13 ms
[2022-05-15 16:14:14] [INFO ] Implicit Places using invariants in 213 ms returned [43, 46, 70, 97]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 241 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/100 places, 440/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 96/100 places, 440/440 transitions.
Support contains 84 out of 96 places after structural reductions.
[2022-05-15 16:14:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-15 16:14:15] [INFO ] Flatten gal took : 72 ms
FORMULA Dekker-PT-020-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 16:14:15] [INFO ] Flatten gal took : 42 ms
[2022-05-15 16:14:15] [INFO ] Input system was already deterministic with 440 transitions.
Support contains 83 out of 96 places (down from 84) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 79) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) 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 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) seen :1
Running SMT prover for 34 properties.
[2022-05-15 16:14:15] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:15] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-15 16:14:16] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned sat
[2022-05-15 16:14:16] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:16] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :23 sat :3 real:8
[2022-05-15 16:14:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:14:16] [INFO ] After 22ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :23 sat :0 real:11
[2022-05-15 16:14:16] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :23 sat :0 real:11
[2022-05-15 16:14:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 7 ms returned sat
[2022-05-15 16:14:16] [INFO ] [Nat]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:16] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :23 sat :11
[2022-05-15 16:14:16] [INFO ] After 60ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :23 sat :11
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:16] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2022-05-15 16:14:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-15 16:14:17] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 0 ms to minimize.
[2022-05-15 16:14:17] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1121 ms
[2022-05-15 16:14:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-15 16:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-15 16:14:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 16:14:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 16:14:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2022-05-15 16:14:17] [INFO ] After 1384ms SMT Verify possible using trap constraints in natural domain returned unsat :23 sat :11
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-05-15 16:14:17] [INFO ] After 1629ms SMT Verify possible using all constraints in natural domain returned unsat :23 sat :11
Fused 34 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 20 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 32 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
[2022-05-15 16:14:18] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:18] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-15 16:14:18] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:14:18] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:18] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2022-05-15 16:14:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:14:18] [INFO ] After 13ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 16:14:18] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 16:14:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2022-05-15 16:14:18] [INFO ] [Nat]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:18] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 16:14:18] [INFO ] After 52ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 16:14:18] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-15 16:14:18] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 10 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 39 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-15 16:14:19] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:19] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-15 16:14:19] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:14:19] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-15 16:14:19] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-15 16:14:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:14:19] [INFO ] After 8ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2022-05-15 16:14:19] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-15 16:14:19] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2022-05-15 16:14:19] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2022-05-15 16:14:19] [INFO ] [Nat]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:19] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 16:14:19] [INFO ] After 19ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-15 16:14:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 757 ms
[2022-05-15 16:14:20] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 758 ms
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 130 ms
[2022-05-15 16:14:20] [INFO ] After 940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-15 16:14:20] [INFO ] After 1044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 24 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 16:14:20] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:20] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-15 16:14:20] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:14:20] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:20] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:14:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:14:20] [INFO ] [Nat]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:20] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:14:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:14:20] [INFO ] After 17ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:14:20] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 4 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 661 ms
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 16:14:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 88 ms
[2022-05-15 16:14:21] [INFO ] After 788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-15 16:14:21] [INFO ] After 910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 19 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 347949 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 347949 steps, saw 186360 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-15 16:14:24] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:24] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-15 16:14:24] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:14:24] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:25] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:14:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-05-15 16:14:25] [INFO ] [Nat]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-15 16:14:25] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:14:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:14:25] [INFO ] After 16ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 645 ms
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 16:14:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 89 ms
[2022-05-15 16:14:25] [INFO ] After 768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-15 16:14:25] [INFO ] After 877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 27 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 440/440 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 23 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:25] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:25] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-15 16:14:26] [INFO ] Implicit Places using invariants in 160 ms returned [40, 47, 50, 53, 59, 62, 65, 70, 73, 79, 82, 85, 88, 91]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 162 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 82/96 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 82/96 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 371007 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 371007 steps, saw 199824 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-15 16:14:29] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2022-05-15 16:14:29] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-15 16:14:29] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2022-05-15 16:14:29] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 16:14:29] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:14:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2022-05-15 16:14:29] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 16:14:29] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:14:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:14:29] [INFO ] After 15ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 16:14:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 16:14:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 16:14:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 32 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 32 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1085 ms
[2022-05-15 16:14:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 16:14:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-15 16:14:30] [INFO ] After 1144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-15 16:14:30] [INFO ] After 1244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 440/440 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:30] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2022-05-15 16:14:30] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-15 16:14:30] [INFO ] Implicit Places using invariants in 127 ms returned []
[2022-05-15 16:14:30] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2022-05-15 16:14:30] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-15 16:14:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 16:14:31] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2022-05-15 16:14:31] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-15 16:14:31] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2022-05-15 16:14:31] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-15 16:14:31] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 440/440 transitions.
Graph (complete) has 130 edges and 82 vertex of which 26 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.10 ms
Discarding 56 places :
Also discarding 308 output transitions
Drop transitions removed 308 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 24 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 120 place count 18 transition count 21
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 123 place count 18 transition count 18
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 18 transition count 15
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 135 place count 12 transition count 12
Applied a total of 135 rules in 19 ms. Remains 12 /82 variables (removed 70) and now considering 12/440 (removed 428) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 12 rows 12 cols
[2022-05-15 16:14:31] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 16:14:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 16:14:31] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-15 16:14:31] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 16:14:31] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:14:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 16:14:31] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:14:31] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 16:14:31] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-15 16:14:31] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:14:31] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:14:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7236358294097992258.gal : 1 ms
[2022-05-15 16:14:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6651456703943736716.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6775256144282975066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7236358294097992258.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6651456703943736716.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6651456703943736716.prop.
Reachability property AtomicPropp68 is true.
SDD proceeding with computation,2 properties remain. new max is 2
SDD size :1 after 16
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,64,0.01176,3780,2,19,7,95,8,0,69,46,0
Total reachable state count : 64

Verifying 3 reachability properties.
Reachability property AtomicPropp20 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,4,0.011975,3780,2,15,7,95,8,0,72,46,0
Reachability property AtomicPropp63 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp63,8,0.012161,3780,2,16,7,95,8,0,74,46,0
Reachability property AtomicPropp68 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp68,1,0.012341,3780,2,13,8,95,9,0,79,46,0
Successfully simplified 23 atomic propositions for a total of 12 simplifications.
FORMULA Dekker-PT-020-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 16:14:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-15 16:14:31] [INFO ] Flatten gal took : 43 ms
[2022-05-15 16:14:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Dekker-PT-020-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 16:14:31] [INFO ] Flatten gal took : 30 ms
[2022-05-15 16:14:31] [INFO ] Input system was already deterministic with 440 transitions.
Support contains 41 out of 96 places (down from 52) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:31] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:31] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-15 16:14:31] [INFO ] Implicit Places using invariants in 179 ms returned [40, 56, 59, 62, 65, 70, 73, 76, 79, 82, 85, 88, 91]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 180 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 83/96 places, 440/440 transitions.
[2022-05-15 16:14:31] [INFO ] Flatten gal took : 21 ms
[2022-05-15 16:14:31] [INFO ] Flatten gal took : 22 ms
[2022-05-15 16:14:31] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-15 16:14:31] [INFO ] Flatten gal took : 21 ms
[2022-05-15 16:14:31] [INFO ] Flatten gal took : 20 ms
[2022-05-15 16:14:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8035234817650883699.gal : 16 ms
[2022-05-15 16:14:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality5263200004683342241.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8035234817650883699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5263200004683342241.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.095757,9616,2,264,5,7737,6,0,775,3271,0


Converting to forward existential form...Done !
original formula: AG(E((EX(AX(((p0_5==0)||(p1_19==1)))) + (AF((p3_9==1)) * EX((p3_1==1)))) U (((!(EG((flag_1_1==1))) + A(((flag_1_13==0)||(p3_5==1)) U (p0_...230
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EX(!(EX(!(((p0_5==0)||(p1_19==1)))))) + (!(EG(!((p3_9==1)))) * EX((p3_1==1)))) U (((!(E...349
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.551581,24956,1,0,951,111108,936,479,7144,84177,964
FORMULA Dekker-PT-020-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 29 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:32] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:32] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-15 16:14:32] [INFO ] Implicit Places using invariants in 151 ms returned [40, 47, 50, 53, 59, 62, 65, 70, 73, 76, 79, 82, 85, 88, 91]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 153 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/96 places, 440/440 transitions.
Applied a total of 0 rules in 21 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/96 places, 440/440 transitions.
[2022-05-15 16:14:32] [INFO ] Flatten gal took : 18 ms
[2022-05-15 16:14:32] [INFO ] Flatten gal took : 19 ms
[2022-05-15 16:14:32] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-15 16:14:32] [INFO ] Flatten gal took : 19 ms
[2022-05-15 16:14:32] [INFO ] Flatten gal took : 18 ms
[2022-05-15 16:14:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality5616333633636237082.gal : 317 ms
[2022-05-15 16:14:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality10009564581778743147.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5616333633636237082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10009564581778743147.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.093667,9656,2,256,5,7645,6,0,767,3215,0


Converting to forward existential form...Done !
original formula: EF(AG((p0_6==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p0_6==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.323064,16108,1,0,910,74537,902,443,6948,43274,893
FORMULA Dekker-PT-020-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:33] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-15 16:14:33] [INFO ] Implicit Places using invariants in 154 ms returned [40, 47, 50, 53, 56, 59, 62, 65, 70, 73, 76, 79, 82, 85, 88, 91]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 155 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/96 places, 440/440 transitions.
[2022-05-15 16:14:33] [INFO ] Flatten gal took : 17 ms
[2022-05-15 16:14:33] [INFO ] Flatten gal took : 18 ms
[2022-05-15 16:14:33] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-15 16:14:33] [INFO ] Flatten gal took : 19 ms
[2022-05-15 16:14:33] [INFO ] Flatten gal took : 17 ms
[2022-05-15 16:14:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality179205650260646770.gal : 3 ms
[2022-05-15 16:14:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2008742162221668872.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality179205650260646770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2008742162221668872.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.091354,9416,2,252,5,7566,6,0,763,3181,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.097911,9416,1,0,6,7566,7,1,1378,3181,1
FORMULA Dekker-PT-020-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:33] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-15 16:14:33] [INFO ] Implicit Places using invariants in 138 ms returned [40, 47, 50, 53, 56, 59, 62, 65, 70, 73, 76, 79, 82, 85, 88, 91]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 142 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/96 places, 440/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/96 places, 440/440 transitions.
[2022-05-15 16:14:33] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:14:33] [INFO ] Flatten gal took : 21 ms
[2022-05-15 16:14:34] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-15 16:14:34] [INFO ] Flatten gal took : 27 ms
[2022-05-15 16:14:34] [INFO ] Flatten gal took : 16 ms
[2022-05-15 16:14:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality145028953132999555.gal : 2 ms
[2022-05-15 16:14:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4079989633369154973.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality145028953132999555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4079989633369154973.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.093207,9484,2,252,5,7566,6,0,763,3181,0


Converting to forward existential form...Done !
original formula: E((p3_3!=1) U AX(((!(EX(TRUE)) * !((((p1_6==0)||(flag_1_12==1))||((p3_7==0)||(flag_0_8==1))))) * EX((flag_0_5==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(p3_3!=1)) * !(EX(!(((!(EX(TRUE)) * !((((p1_6==0)||(flag_1_12==1))||((p3_7==0)||(flag_0_8==1))))) * ...187
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.32332,15908,1,0,915,70344,898,446,6877,43809,892
FORMULA Dekker-PT-020-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 16 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:34] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:34] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-15 16:14:34] [INFO ] Implicit Places using invariants in 141 ms returned [40, 47, 50, 53, 56, 59, 62, 65, 70, 73, 76, 79, 82, 85, 88, 91]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 142 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 80/96 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/96 places, 440/440 transitions.
[2022-05-15 16:14:34] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:14:34] [INFO ] Flatten gal took : 16 ms
[2022-05-15 16:14:34] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-15 16:14:34] [INFO ] Flatten gal took : 16 ms
[2022-05-15 16:14:34] [INFO ] Flatten gal took : 16 ms
[2022-05-15 16:14:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5227035809844166442.gal : 2 ms
[2022-05-15 16:14:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality13540823107150622382.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5227035809844166442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13540823107150622382.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.089378,9584,2,252,5,7566,6,0,763,3181,0


Converting to forward existential form...Done !
original formula: AG(EF(((AF((p3_12==0)) * (p3_3==1)) * (((EG(((flag_1_18==0)||(flag_0_19==1))) + (p1_11==0)) + ((flag_0_7==1)||(flag_1_16==1))) * ((flag_1...177
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(EG(!((p3_12==0)))) * (p3_3==1)) * (((EG(((flag_1_18==0)||(flag_0_19==1))) + (...243
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,1,0.374529,17416,1,0,925,77953,917,454,7012,48308,913
FORMULA Dekker-PT-020-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:35] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-15 16:14:35] [INFO ] Implicit Places using invariants in 150 ms returned [40, 47, 50, 53, 59, 62, 65, 70, 73, 79, 82, 85, 91]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 150 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 83/96 places, 440/440 transitions.
[2022-05-15 16:14:35] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:14:35] [INFO ] Flatten gal took : 20 ms
[2022-05-15 16:14:35] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-15 16:14:35] [INFO ] Flatten gal took : 16 ms
[2022-05-15 16:14:35] [INFO ] Flatten gal took : 16 ms
[2022-05-15 16:14:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality5800972324071842779.gal : 2 ms
[2022-05-15 16:14:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality7115798235236109617.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5800972324071842779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7115798235236109617.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.096127,9528,2,264,5,8001,6,0,775,3318,0


Converting to forward existential form...Done !
original formula: ((EX(AG(((EF(((p1_11==0)||(flag_0_15==1))) * EG((flag_0_4==1))) * (p3_10==0)))) + AG(((p3_16==0)||(p0_6==1)))) + EX((((p0_17==0)||(p3_4==...221
=> equivalent forward existential formula: [(FwdU(((Init * !(EX((((p0_17==0)||(p3_4==1)) * !(E(TRUE U !(E(((p3_0==0)||(p0_13==1)) U ((p3_18==0)||(p3_15==1)...311
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,1,0.40626,18584,1,0,925,82303,917,456,7174,52390,920
FORMULA Dekker-PT-020-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:35] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-15 16:14:35] [INFO ] Implicit Places using invariants in 143 ms returned [40, 47, 53, 56, 59, 62, 65, 70, 73, 76, 79, 82, 85, 88, 91]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 144 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/96 places, 440/440 transitions.
[2022-05-15 16:14:35] [INFO ] Flatten gal took : 14 ms
[2022-05-15 16:14:35] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:14:35] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-15 16:14:35] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:14:35] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:14:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality12866785276823936269.gal : 1 ms
[2022-05-15 16:14:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality17445716857222656011.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12866785276823936269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17445716857222656011.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.093369,9436,2,256,5,7623,6,0,767,3211,0


Converting to forward existential form...Done !
original formula: AX((((flag_0_14==0)||(p0_4==1)) + (AG(((flag_0_3==0)||(p3_4==1))) * AF(EX(AF(((flag_1_10==0)||(flag_0_4==1))))))))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !(((flag_0_14==0)||(p0_4==1)))),TRUE) * !(((flag_0_3==0)||(p3_4==1))))] = FALSE * [FwdG((EY(...254
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.378206,17760,1,0,919,76411,912,451,7098,48318,901
FORMULA Dekker-PT-020-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-05-15 16:14:36] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2022-05-15 16:14:36] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-15 16:14:36] [INFO ] Implicit Places using invariants in 154 ms returned [40, 47, 50, 53, 56, 59, 62, 65, 70, 73, 76, 79, 82, 85, 88, 91]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 155 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 80/96 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 80/96 places, 440/440 transitions.
[2022-05-15 16:14:36] [INFO ] Flatten gal took : 13 ms
[2022-05-15 16:14:36] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:14:36] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-15 16:14:36] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:14:36] [INFO ] Flatten gal took : 14 ms
[2022-05-15 16:14:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality2878623382991415960.gal : 2 ms
[2022-05-15 16:14:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality7446160421229930230.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2878623382991415960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7446160421229930230.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.089605,9576,2,252,5,7566,6,0,763,3181,0


Converting to forward existential form...Done !
original formula: AF(EG(((p3_11==1)&&((p1_18==0)||(p1_18==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p3_11==1)&&((p1_18==0)||(p1_18==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.610707,26016,1,0,952,142502,906,487,6931,83553,938
FORMULA Dekker-PT-020-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2022-05-15 16:14:37] [INFO ] Flatten gal took : 18 ms
[2022-05-15 16:14:37] [INFO ] Flatten gal took : 17 ms
Total runtime 23088 ms.

BK_STOP 1652631277406

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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="Dekker-PT-020"
export BK_EXAMINATION="CTLCardinality"
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 Dekker-PT-020, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772300609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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