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-165254772300619.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-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:23 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 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 1.5M 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-050-LTLCardinality-00
FORMULA_NAME Dekker-PT-050-LTLCardinality-01
FORMULA_NAME Dekker-PT-050-LTLCardinality-02
FORMULA_NAME Dekker-PT-050-LTLCardinality-03
FORMULA_NAME Dekker-PT-050-LTLCardinality-04
FORMULA_NAME Dekker-PT-050-LTLCardinality-05
FORMULA_NAME Dekker-PT-050-LTLCardinality-06
FORMULA_NAME Dekker-PT-050-LTLCardinality-07
FORMULA_NAME Dekker-PT-050-LTLCardinality-08
FORMULA_NAME Dekker-PT-050-LTLCardinality-09
FORMULA_NAME Dekker-PT-050-LTLCardinality-10
FORMULA_NAME Dekker-PT-050-LTLCardinality-11
FORMULA_NAME Dekker-PT-050-LTLCardinality-12
FORMULA_NAME Dekker-PT-050-LTLCardinality-13
FORMULA_NAME Dekker-PT-050-LTLCardinality-14
FORMULA_NAME Dekker-PT-050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652631671721

Running Version 202205111006
[2022-05-15 16:21:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:21:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:21:13] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2022-05-15 16:21:13] [INFO ] Transformed 250 places.
[2022-05-15 16:21:13] [INFO ] Transformed 2600 transitions.
[2022-05-15 16:21:13] [INFO ] Found NUPN structural information;
[2022-05-15 16:21:13] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Dekker-PT-050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 83 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-05-15 16:21:13] [INFO ] Computed 150 place invariants in 20 ms
[2022-05-15 16:21:14] [INFO ] Implicit Places using invariants in 1366 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 136, 139, 142, 145, 148, 151, 154, 157, 160, 166, 169, 172, 175, 181, 184, 187, 190, 193, 196, 199, 202, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1401 ms to find 46 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 54 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 204/250 places, 2600/2600 transitions.
Support contains 28 out of 204 places after structural reductions.
[2022-05-15 16:21:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 16:21:15] [INFO ] Flatten gal took : 236 ms
FORMULA Dekker-PT-050-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 16:21:15] [INFO ] Flatten gal took : 132 ms
[2022-05-15 16:21:15] [INFO ] Input system was already deterministic with 2600 transitions.
Support contains 24 out of 204 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 16:21:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:16] [INFO ] Computed 104 place invariants in 6 ms
[2022-05-15 16:21:16] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2022-05-15 16:21:16] [INFO ] [Real]Absence check using 100 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 16:21:16] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2022-05-15 16:21:16] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:16] [INFO ] After 31ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :1 sat :1 real:1
[2022-05-15 16:21:16] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-15 16:21:16] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:1
[2022-05-15 16:21:16] [INFO ] [Nat]Absence check using 100 positive place invariants in 20 ms returned sat
[2022-05-15 16:21:16] [INFO ] [Nat]Absence check using 100 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 16:21:16] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-15 16:21:16] [INFO ] After 32ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-15 16:21:16] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-15 16:21:16] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 147 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 292791 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292791 steps, saw 241193 distinct states, run finished after 3014 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 16:21:20] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:20] [INFO ] Computed 104 place invariants in 4 ms
[2022-05-15 16:21:20] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:21:20] [INFO ] [Real]Absence check using 100 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 16:21:20] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:21:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:20] [INFO ] After 25ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:21:20] [INFO ] After 47ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 16:21:20] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:21:20] [INFO ] [Nat]Absence check using 100 positive place invariants in 20 ms returned sat
[2022-05-15 16:21:20] [INFO ] [Nat]Absence check using 100 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 16:21:20] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 16:21:20] [INFO ] After 31ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 16:21:20] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 16:21:20] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 89 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 116 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:20] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:20] [INFO ] Computed 104 place invariants in 2 ms
[2022-05-15 16:21:21] [INFO ] Implicit Places using invariants in 519 ms returned [122, 143, 154]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 538 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 201/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 93 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/204 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 314415 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314415 steps, saw 258696 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 16:21:24] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:24] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-15 16:21:24] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:21:24] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:21:24] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:21:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:25] [INFO ] After 20ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:21:25] [INFO ] After 37ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-15 16:21:25] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:21:25] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:21:25] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:21:25] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 16:21:25] [INFO ] After 30ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 16:21:25] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2022-05-15 16:21:25] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2022-05-15 16:21:25] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 16:21:25] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-15 16:21:25] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-05-15 16:21:25] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2022-05-15 16:21:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-15 16:21:26] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:21:26] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 16:21:26] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 16:21:26] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 16:21:26] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1040 ms
[2022-05-15 16:21:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1041 ms
[2022-05-15 16:21:26] [INFO ] After 1115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-15 16:21:26] [INFO ] After 1275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 65 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 61 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:26] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:26] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-15 16:21:26] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-05-15 16:21:26] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:26] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:21:27] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:27] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2022-05-15 16:21:27] [INFO ] Redundant transitions in 147 ms returned []
[2022-05-15 16:21:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:27] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-15 16:21:28] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 17 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.5 ms
Discarding 184 places :
Also discarding 2392 output transitions
Drop transitions removed 2392 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 16 transition count 16
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 203 place count 10 transition count 13
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 206 place count 10 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 10 transition count 9
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 210 place count 8 transition count 8
Applied a total of 210 rules in 15 ms. Remains 8 /201 variables (removed 193) and now considering 8/2600 (removed 2592) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 16:21:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 16:21:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 16:21:28] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 16:21:28] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 16:21:28] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 16:21:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-15 16:21:28] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 16:21:28] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 16:21:28] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 16:21:28] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:21:28] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:21:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14650168353685002218.gal : 0 ms
[2022-05-15 16:21:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16398491051155919909.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3637622144279529859;'/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/ReachabilityCardinality14650168353685002218.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16398491051155919909.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...321
Loading property file /tmp/ReachabilityCardinality16398491051155919909.prop.
Reachability property AtomicPropp13 is true.
Reachability property AtomicPropp3 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,16,0.008381,3756,2,13,7,60,6,0,43,28,0
Total reachable state count : 16

Verifying 2 reachability properties.
Reachability property AtomicPropp3 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
AtomicPropp3,2,0.008594,3756,2,10,7,60,7,0,49,28,0
Reachability property AtomicPropp13 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
AtomicPropp13,1,0.008765,3756,2,9,7,60,8,0,54,28,0
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA Dekker-PT-050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(X(p1))))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:28] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:28] [INFO ] Computed 104 place invariants in 1 ms
[2022-05-15 16:21:29] [INFO ] Implicit Places using invariants in 449 ms returned [122, 154, 173]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 455 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/204 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s131 0) (EQ s156 1)), p1:(AND (EQ s142 0) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1037 ms.
Product exploration explored 100000 steps with 50000 reset in 808 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Dekker-PT-050-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLCardinality-01 finished in 2789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(G(p0)) U X(p1))))'
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:31] [INFO ] Computed 104 place invariants in 2 ms
[2022-05-15 16:21:32] [INFO ] Implicit Places using invariants in 512 ms returned [122, 143, 154, 173]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 524 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/204 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 214 ms :[p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s48 0) (EQ s165 1)), p0:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 767 reset in 1013 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 3 ms.
FORMULA Dekker-PT-050-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-02 finished in 1808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:33] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:33] [INFO ] Computed 104 place invariants in 3 ms
[2022-05-15 16:21:33] [INFO ] Implicit Places using invariants in 494 ms returned [122, 143, 154, 173]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 504 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/204 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s91 0) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-03 finished in 649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&(F((p0 U F(p1)))||F(p2))))))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:34] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:34] [INFO ] Computed 104 place invariants in 1 ms
[2022-05-15 16:21:34] [INFO ] Implicit Places using invariants in 471 ms returned [122, 143, 173]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 479 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/204 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s191 0) (EQ s104 1)), p1:(OR (EQ s152 0) (EQ s127 1)), p2:(AND (EQ s127 0) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 938 reset in 974 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 63 in 2 ms.
FORMULA Dekker-PT-050-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-06 finished in 1774 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((X(F(p0))||p1))||p1))))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 19 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:35] [INFO ] Computed 104 place invariants in 1 ms
[2022-05-15 16:21:36] [INFO ] Implicit Places using invariants in 452 ms returned [122, 143, 154, 173]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 456 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/204 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (EQ s27 0) (EQ s35 1)), p0:(AND (EQ s144 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2676 reset in 924 ms.
Stack based approach found an accepted trace after 211 steps with 7 reset with depth 69 and stack size 69 in 2 ms.
FORMULA Dekker-PT-050-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-12 finished in 1560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 248 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:37] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 204 cols
[2022-05-15 16:21:37] [INFO ] Computed 104 place invariants in 1 ms
[2022-05-15 16:21:38] [INFO ] Implicit Places using invariants in 443 ms returned [122, 143, 154]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 447 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/204 places, 2600/2600 transitions.
Applied a total of 0 rules in 67 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/204 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s101 0) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 963 ms.
Product exploration explored 100000 steps with 0 reset in 1057 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 752607 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 752607 steps, saw 611838 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:21:43] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:43] [INFO ] Computed 101 place invariants in 6 ms
[2022-05-15 16:21:43] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2022-05-15 16:21:43] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 16:21:43] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:21:43] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:21:43] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:21:43] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:21:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:43] [INFO ] After 24ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:21:43] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 16:21:44] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1065 ms
[2022-05-15 16:21:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1066 ms
[2022-05-15 16:21:44] [INFO ] After 1103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-15 16:21:44] [INFO ] After 1292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 61 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 814929 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 814929 steps, saw 662245 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:21:48] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:48] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:21:48] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:21:48] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:21:48] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:21:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 10 ms returned sat
[2022-05-15 16:21:48] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 16:21:48] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:21:48] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:48] [INFO ] After 24ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:21:48] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2022-05-15 16:21:48] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 16:21:48] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2022-05-15 16:21:48] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 16:21:48] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2022-05-15 16:21:49] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-15 16:21:49] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-15 16:21:49] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:21:49] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2022-05-15 16:21:49] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:21:49] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 16:21:49] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1082 ms
[2022-05-15 16:21:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1082 ms
[2022-05-15 16:21:49] [INFO ] After 1118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 16:21:49] [INFO ] After 1268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 53 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 50 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:49] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:21:50] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-05-15 16:21:50] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:50] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-15 16:21:50] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:50] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
[2022-05-15 16:21:50] [INFO ] Redundant transitions in 167 ms returned []
[2022-05-15 16:21:50] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:50] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:21:51] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 9 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 2496 output transitions
Drop transitions removed 2496 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 4 transition count 4
Applied a total of 106 rules in 6 ms. Remains 4 /201 variables (removed 197) and now considering 4/2600 (removed 2596) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2022-05-15 16:21:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:21:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 16:21:51] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:21:51] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:21:51] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:21:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 16:21:51] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:21:51] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 16:21:51] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:21:51] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:21:51] [INFO ] Flatten gal took : 0 ms
[2022-05-15 16:21:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5844109123097927644.gal : 1 ms
[2022-05-15 16:21:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16418961757581461619.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms123232666832661317;'/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/ReachabilityCardinality5844109123097927644.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16418961757581461619.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...320
Loading property file /tmp/ReachabilityCardinality16418961757581461619.prop.
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,4,0.00469,3900,2,7,5,25,7,0,26,14,0
Total reachable state count : 4

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1,0.005021,3900,2,5,6,25,7,0,29,14,0
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 67 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:51] [INFO ] Computed 101 place invariants in 0 ms
[2022-05-15 16:21:52] [INFO ] Implicit Places using invariants in 430 ms returned []
[2022-05-15 16:21:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:52] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:21:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:52] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
[2022-05-15 16:21:53] [INFO ] Redundant transitions in 64 ms returned []
[2022-05-15 16:21:53] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:53] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:21:53] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 843132 steps, run timeout after 3070 ms. (steps per millisecond=274 ) properties seen :{}
Probabilistic random walk after 843132 steps, saw 684303 distinct states, run finished after 3070 ms. (steps per millisecond=274 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:21:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:57] [INFO ] Computed 101 place invariants in 0 ms
[2022-05-15 16:21:57] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:21:57] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:21:57] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:21:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:21:57] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:21:57] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:21:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:21:57] [INFO ] After 26ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:21:57] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2022-05-15 16:21:57] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-05-15 16:21:57] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2022-05-15 16:21:57] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 16:21:57] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 16:21:58] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2022-05-15 16:21:58] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2022-05-15 16:21:58] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 16:21:58] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2022-05-15 16:21:58] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 16:21:58] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:21:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1098 ms
[2022-05-15 16:21:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1098 ms
[2022-05-15 16:21:58] [INFO ] After 1136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-15 16:21:58] [INFO ] After 1298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 61 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 801414 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :{}
Probabilistic random walk after 801414 steps, saw 651492 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:22:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:01] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:01] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:22:01] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:22:01] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:22:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 11 ms returned sat
[2022-05-15 16:22:01] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 16:22:02] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:22:02] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:22:02] [INFO ] After 24ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:22:02] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:22:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 16:22:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-15 16:22:03] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1049 ms
[2022-05-15 16:22:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1049 ms
[2022-05-15 16:22:03] [INFO ] After 1084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-15 16:22:03] [INFO ] After 1247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 51 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 50 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:03] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:22:03] [INFO ] Implicit Places using invariants in 473 ms returned []
[2022-05-15 16:22:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:03] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:22:03] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:22:04] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2022-05-15 16:22:04] [INFO ] Redundant transitions in 66 ms returned []
[2022-05-15 16:22:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:04] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:22:05] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 9 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 2496 output transitions
Drop transitions removed 2496 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 4 transition count 4
Applied a total of 106 rules in 3 ms. Remains 4 /201 variables (removed 197) and now considering 4/2600 (removed 2596) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2022-05-15 16:22:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:22:05] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 16:22:05] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:22:05] [INFO ] After 8ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:22:05] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:22:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 16:22:05] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:22:05] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 16:22:05] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:22:05] [INFO ] Flatten gal took : 0 ms
[2022-05-15 16:22:05] [INFO ] Flatten gal took : 0 ms
[2022-05-15 16:22:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2094094805872781271.gal : 1 ms
[2022-05-15 16:22:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7030232830296310905.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13380981836747481951;'/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/ReachabilityCardinality2094094805872781271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7030232830296310905.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/ReachabilityCardinality7030232830296310905.prop.
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,4,0.005275,3900,2,7,5,25,7,0,26,14,0
Total reachable state count : 4

Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1,0.005902,3900,2,5,6,25,7,0,29,14,0
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 975 ms.
Product exploration explored 100000 steps with 0 reset in 983 ms.
Built C files in :
/tmp/ltsmin15582115290328108440
[2022-05-15 16:22:07] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2022-05-15 16:22:07] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15582115290328108440
Running compilation step : cd /tmp/ltsmin15582115290328108440;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15582115290328108440;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15582115290328108440;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 129 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:10] [INFO ] Computed 101 place invariants in 0 ms
[2022-05-15 16:22:11] [INFO ] Implicit Places using invariants in 601 ms returned []
[2022-05-15 16:22:11] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:11] [INFO ] Computed 101 place invariants in 12 ms
[2022-05-15 16:22:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:22:12] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2022-05-15 16:22:12] [INFO ] Redundant transitions in 61 ms returned []
[2022-05-15 16:22:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:12] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:14] [INFO ] Dead Transitions using invariants and state equation in 1767 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin13974041608477714763
[2022-05-15 16:22:14] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2022-05-15 16:22:14] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13974041608477714763
Running compilation step : cd /tmp/ltsmin13974041608477714763;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13974041608477714763;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13974041608477714763;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 16:22:17] [INFO ] Flatten gal took : 230 ms
[2022-05-15 16:22:17] [INFO ] Flatten gal took : 224 ms
[2022-05-15 16:22:17] [INFO ] Time to serialize gal into /tmp/LTL12810976446371442279.gal : 51 ms
[2022-05-15 16:22:18] [INFO ] Time to serialize properties into /tmp/LTL10880448090861934018.ltl : 42 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12810976446371442279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10880448090861934018.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1281097...268
Read 1 LTL properties
Checking formula 0 : !((G("((p3_0==0)||(p0_35==1))")))
Formula 0 simplified : !G"((p3_0==0)||(p0_35==1))"
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1179 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.3154,354244,1,0,5362,2.50237e+06,5229,2654,35708,1.05226e+06,5483
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Dekker-PT-050-LTLCardinality-15 finished in 54728 ms.
All properties solved by simple procedures.
Total runtime 79121 ms.

BK_STOP 1652631752152

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;