fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r136-tall-171631131900108
Last Updated
July 7, 2024

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2026.523 85102.00 119478.00 240.30 FFTTFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 21:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 20:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K Apr 11 20:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 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-LTLFireability-00
FORMULA_NAME Dekker-PT-050-LTLFireability-01
FORMULA_NAME Dekker-PT-050-LTLFireability-02
FORMULA_NAME Dekker-PT-050-LTLFireability-03
FORMULA_NAME Dekker-PT-050-LTLFireability-04
FORMULA_NAME Dekker-PT-050-LTLFireability-05
FORMULA_NAME Dekker-PT-050-LTLFireability-06
FORMULA_NAME Dekker-PT-050-LTLFireability-07
FORMULA_NAME Dekker-PT-050-LTLFireability-08
FORMULA_NAME Dekker-PT-050-LTLFireability-09
FORMULA_NAME Dekker-PT-050-LTLFireability-10
FORMULA_NAME Dekker-PT-050-LTLFireability-11
FORMULA_NAME Dekker-PT-050-LTLFireability-12
FORMULA_NAME Dekker-PT-050-LTLFireability-13
FORMULA_NAME Dekker-PT-050-LTLFireability-14
FORMULA_NAME Dekker-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716336209155

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:03:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:03:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:03:30] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-05-22 00:03:30] [INFO ] Transformed 250 places.
[2024-05-22 00:03:30] [INFO ] Transformed 2600 transitions.
[2024-05-22 00:03:30] [INFO ] Found NUPN structural information;
[2024-05-22 00:03:30] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-050-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 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 61 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:03:30] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2024-05-22 00:03:30] [INFO ] Computed 150 invariants in 22 ms
[2024-05-22 00:03:32] [INFO ] Implicit Places using invariants in 1194 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1226 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 20 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1323 ms. Remains : 201/250 places, 2600/2600 transitions.
Support contains 58 out of 201 places after structural reductions.
[2024-05-22 00:03:32] [INFO ] Flatten gal took : 211 ms
[2024-05-22 00:03:32] [INFO ] Flatten gal took : 131 ms
[2024-05-22 00:03:32] [INFO ] Input system was already deterministic with 2600 transitions.
Reduction of identical properties reduced properties to check from 33 to 31
RANDOM walk for 40000 steps (8 resets) in 1914 ms. (20 steps per ms) remains 1/31 properties
BEST_FIRST walk for 408 steps (0 resets) in 9 ms. (40 steps per ms) remains 0/1 properties
FORMULA Dekker-PT-050-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Dekker-PT-050-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&G(p1))))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 26 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:03:34] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2024-05-22 00:03:34] [INFO ] Computed 101 invariants in 11 ms
[2024-05-22 00:03:34] [INFO ] Implicit Places using invariants in 473 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 483 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 28 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 538 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-00 finished in 966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p1 U p2)||p0))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 20 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:03:34] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:03:34] [INFO ] Invariant cache hit.
[2024-05-22 00:03:35] [INFO ] Implicit Places using invariants in 465 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 477 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 509 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2772 steps with 918 reset in 79 ms.
FORMULA Dekker-PT-050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-01 finished in 799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(p1) U X(!p2)))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:03:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:03:35] [INFO ] Invariant cache hit.
[2024-05-22 00:03:36] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-22 00:03:36] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:03:36] [INFO ] Invariant cache hit.
[2024-05-22 00:03:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 00:03:36] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Running 2550 sub problems to find dead transitions.
[2024-05-22 00:03:36] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:03:36] [INFO ] Invariant cache hit.
[2024-05-22 00:03:36] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 99/299 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 11 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:03:50] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:03:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:04:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/401 variables, and 380 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30074 ms.
Refiners :[Domain max(s): 200/201 constraints, Positive P Invariants (semi-flows): 99/100 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/201 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 2550/2550 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 99/299 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 80/380 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 4 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:04:16] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:04:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:04:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/401 variables, and 443 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30045 ms.
Refiners :[Domain max(s): 200/201 constraints, Positive P Invariants (semi-flows): 99/100 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/201 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 0/2550 constraints, Known Traps: 143/143 constraints]
After SMT, in 62479ms problems are : Problem set: 0 solved, 2550 unsolved
Search for dead transitions found 0 dead transitions in 62523ms
Finished structural reductions in LTL mode , in 1 iterations and 63452 ms. Remains : 201/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 697 ms.
Product exploration explored 100000 steps with 50000 reset in 713 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 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Dekker-PT-050-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLFireability-03 finished in 65046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 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 120 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:40] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:40] [INFO ] Invariant cache hit.
[2024-05-22 00:04:41] [INFO ] Implicit Places using invariants in 463 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 470 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 83 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 674 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-04
Product exploration explored 100000 steps with 965 reset in 921 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 3 ms.
FORMULA Dekker-PT-050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-04 finished in 1690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p0) U p1)) U X(p2))||!(G(!p2) U p1)))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 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.
[2024-05-22 00:04:42] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:42] [INFO ] Invariant cache hit.
[2024-05-22 00:04:42] [INFO ] Implicit Places using invariants in 404 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 408 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 439 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (OR (NOT p0) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-06
Product exploration explored 100000 steps with 997 reset in 918 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 108 in 2 ms.
FORMULA Dekker-PT-050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-06 finished in 1654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((G(p1)||G(p2)))))'
Support contains 8 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 82 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:44] [INFO ] Invariant cache hit.
[2024-05-22 00:04:44] [INFO ] Implicit Places using invariants in 367 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 386 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 70 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 538 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 1001 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-07 finished in 1639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 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 72 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:45] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:45] [INFO ] Invariant cache hit.
[2024-05-22 00:04:46] [INFO ] Implicit Places using invariants in 459 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 462 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 64 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 601 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-08
Product exploration explored 100000 steps with 770 reset in 914 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 2 ms.
FORMULA Dekker-PT-050-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-08 finished in 1611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (X(F(p1)) U G(p2)))))'
Support contains 12 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:47] [INFO ] Invariant cache hit.
[2024-05-22 00:04:47] [INFO ] Implicit Places using invariants in 386 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 389 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 417 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-09
Product exploration explored 100000 steps with 4174 reset in 918 ms.
Stack based approach found an accepted trace after 27 steps with 2 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-09 finished in 1636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:49] [INFO ] Invariant cache hit.
[2024-05-22 00:04:49] [INFO ] Implicit Places using invariants in 462 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 492 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-11 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 9 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 74 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:49] [INFO ] Invariant cache hit.
[2024-05-22 00:04:50] [INFO ] Implicit Places using invariants in 397 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 401 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 87 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 563 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-12
Product exploration explored 100000 steps with 6 reset in 1000 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-12 finished in 1733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:51] [INFO ] Invariant cache hit.
[2024-05-22 00:04:51] [INFO ] Implicit Places using invariants in 372 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 393 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 19 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 427 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-13 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (X(X(F(p2)))&&p1)))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:52] [INFO ] Invariant cache hit.
[2024-05-22 00:04:52] [INFO ] Implicit Places using invariants in 383 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 386 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p2)), true, p0, (NOT p2), (NOT p2)]
Running random walk in product with property : Dekker-PT-050-LTLFireability-14
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLFireability-14 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(p0) U p1)&&X((p0 U p2))))))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-22 00:04:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2024-05-22 00:04:52] [INFO ] Invariant cache hit.
[2024-05-22 00:04:53] [INFO ] Implicit Places using invariants in 383 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 387 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 413 ms. Remains : 200/201 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Dekker-PT-050-LTLFireability-15
Product exploration explored 100000 steps with 211 reset in 1022 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Dekker-PT-050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLFireability-15 finished in 1588 ms.
All properties solved by simple procedures.
Total runtime 83910 ms.

BK_STOP 1716336294257

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is Dekker-PT-050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631131900108"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;