fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r037-tajo-167813690300380
Last Updated
May 14, 2023

About the Execution of ITS-Tools for BugTracking-PT-q3m256

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9143.544 3600000.00 13970550.00 197.50 TFFTTTT?TFFFFFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q3m256-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678350936991

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 08:35:39] [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]
[2023-03-09 08:35:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:35:40] [INFO ] Load time of PNML (sax parser for PT used): 1228 ms
[2023-03-09 08:35:40] [INFO ] Transformed 754 places.
[2023-03-09 08:35:41] [INFO ] Transformed 27370 transitions.
[2023-03-09 08:35:41] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1617 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 514 places in 244 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m256-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 130 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-09 08:35:41] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-09 08:35:42] [INFO ] Computed 8 place invariants in 95 ms
[2023-03-09 08:35:42] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-09 08:35:42] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-09 08:35:42] [INFO ] Invariant cache hit.
[2023-03-09 08:35:43] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-09 08:35:45] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned []
Implicit Place search using SMT with State Equation took 3213 ms to find 0 implicit places.
[2023-03-09 08:35:45] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-09 08:35:45] [INFO ] Invariant cache hit.
[2023-03-09 08:35:46] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4294 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 6 out of 237 places after structural reductions.
[2023-03-09 08:35:46] [INFO ] Flatten gal took : 416 ms
[2023-03-09 08:35:46] [INFO ] Flatten gal took : 292 ms
[2023-03-09 08:35:47] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 124154 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124154 steps, saw 60036 distinct states, run finished after 3015 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:35:51] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-09 08:35:51] [INFO ] Invariant cache hit.
[2023-03-09 08:35:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:35:52] [INFO ] After 889ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 08:35:52] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-09 08:35:52] [INFO ] After 136ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:35:52] [INFO ] After 1276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:35:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:35:53] [INFO ] After 653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:35:53] [INFO ] After 362ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 08:35:54] [INFO ] Deduced a trap composed of 21 places in 365 ms of which 8 ms to minimize.
[2023-03-09 08:35:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2023-03-09 08:35:54] [INFO ] After 1152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-09 08:35:54] [INFO ] After 2123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 ms.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 255 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10163 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=781 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 145289 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145289 steps, saw 69913 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:35:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:35:58] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-09 08:35:58] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:35:59] [INFO ] After 704ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 08:35:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:35:59] [INFO ] After 146ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:35:59] [INFO ] After 945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:35:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:35:59] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:36:00] [INFO ] After 330ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 08:36:00] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 1 ms to minimize.
[2023-03-09 08:36:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-09 08:36:00] [INFO ] After 1125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 270 ms.
[2023-03-09 08:36:01] [INFO ] After 2024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 71 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 61 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:36:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:36:01] [INFO ] Invariant cache hit.
[2023-03-09 08:36:01] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-09 08:36:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:36:01] [INFO ] Invariant cache hit.
[2023-03-09 08:36:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:36:03] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2023-03-09 08:36:04] [INFO ] Redundant transitions in 316 ms returned []
[2023-03-09 08:36:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:36:04] [INFO ] Invariant cache hit.
[2023-03-09 08:36:05] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3905 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 569 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-09 08:36:05] [INFO ] Computed 9 place invariants in 33 ms
[2023-03-09 08:36:05] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 08:36:06] [INFO ] After 652ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 08:36:06] [INFO ] After 779ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:36:06] [INFO ] After 899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:36:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 08:36:07] [INFO ] After 961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:36:08] [INFO ] After 1311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-09 08:36:08] [INFO ] After 1617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 226 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-09 08:36:08] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-09 08:36:08] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-09 08:36:09] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-09 08:36:09] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-09 08:36:09] [INFO ] Invariant cache hit.
[2023-03-09 08:36:09] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:36:10] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-09 08:36:10] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-09 08:36:10] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-09 08:36:10] [INFO ] Invariant cache hit.
[2023-03-09 08:36:11] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3097 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BugTracking-PT-q3m256-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s82 1) (LT s180 1) (LT s17 1) (LT s99 1) (LT s203 1)), p1:(AND (GEQ s10 1) (GEQ s82 1) (GEQ s180 1)), p2:(OR (LT s17 1) (LT s99 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22 reset in 791 ms.
Product exploration explored 100000 steps with 23 reset in 767 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 564 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 140560 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140560 steps, saw 67694 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 08:36:17] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-09 08:36:17] [INFO ] Invariant cache hit.
[2023-03-09 08:36:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:36:18] [INFO ] After 542ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 08:36:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:36:18] [INFO ] After 202ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:36:18] [INFO ] After 867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:36:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:36:19] [INFO ] After 829ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:20] [INFO ] After 528ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:20] [INFO ] Deduced a trap composed of 40 places in 459 ms of which 1 ms to minimize.
[2023-03-09 08:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 609 ms
[2023-03-09 08:36:21] [INFO ] After 1843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 547 ms.
[2023-03-09 08:36:22] [INFO ] After 3333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 155 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 113 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10135 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=921 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 141371 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141371 steps, saw 67287 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 08:36:25] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:36:25] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-09 08:36:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:36:26] [INFO ] After 527ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 08:36:26] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:36:26] [INFO ] After 234ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:36:26] [INFO ] After 872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:36:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:36:27] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:27] [INFO ] After 379ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:28] [INFO ] Deduced a trap composed of 38 places in 353 ms of which 2 ms to minimize.
[2023-03-09 08:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 471 ms
[2023-03-09 08:36:29] [INFO ] Deduced a trap composed of 22 places in 421 ms of which 0 ms to minimize.
[2023-03-09 08:36:29] [INFO ] Deduced a trap composed of 42 places in 385 ms of which 0 ms to minimize.
[2023-03-09 08:36:30] [INFO ] Deduced a trap composed of 60 places in 388 ms of which 0 ms to minimize.
[2023-03-09 08:36:30] [INFO ] Deduced a trap composed of 59 places in 369 ms of which 0 ms to minimize.
[2023-03-09 08:36:30] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 1 ms to minimize.
[2023-03-09 08:36:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2368 ms
[2023-03-09 08:36:32] [INFO ] Deduced a trap composed of 69 places in 753 ms of which 1 ms to minimize.
[2023-03-09 08:36:32] [INFO ] Deduced a trap composed of 41 places in 523 ms of which 1 ms to minimize.
[2023-03-09 08:36:33] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 1 ms to minimize.
[2023-03-09 08:36:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1978 ms
[2023-03-09 08:36:33] [INFO ] After 5705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 389 ms.
[2023-03-09 08:36:33] [INFO ] After 6922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:36:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:36:33] [INFO ] Invariant cache hit.
[2023-03-09 08:36:34] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-09 08:36:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:36:34] [INFO ] Invariant cache hit.
[2023-03-09 08:36:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:36:35] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2023-03-09 08:36:35] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-09 08:36:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:36:35] [INFO ] Invariant cache hit.
[2023-03-09 08:36:36] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2996 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 270 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-09 08:36:37] [INFO ] Computed 9 place invariants in 23 ms
[2023-03-09 08:36:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 08:36:37] [INFO ] After 465ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 08:36:37] [INFO ] After 603ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-09 08:36:37] [INFO ] After 794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2023-03-09 08:36:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 08:36:38] [INFO ] After 629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:38] [INFO ] After 997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-09 08:36:39] [INFO ] After 1306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 537 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 60 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-09 08:36:40] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-09 08:36:40] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-09 08:36:40] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-09 08:36:40] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-09 08:36:40] [INFO ] Invariant cache hit.
[2023-03-09 08:36:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:36:42] [INFO ] Implicit Places using invariants and state equation in 2020 ms returned []
Implicit Place search using SMT with State Equation took 2390 ms to find 0 implicit places.
[2023-03-09 08:36:42] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-09 08:36:42] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-09 08:36:42] [INFO ] Invariant cache hit.
[2023-03-09 08:36:43] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3335 ms. Remains : 235/235 places, 2753/2753 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 536 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 128094 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128094 steps, saw 61894 distinct states, run finished after 3006 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 08:36:47] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-09 08:36:47] [INFO ] Invariant cache hit.
[2023-03-09 08:36:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:36:48] [INFO ] After 459ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 08:36:48] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:36:48] [INFO ] After 145ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:36:48] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:36:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:36:49] [INFO ] After 753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:49] [INFO ] After 583ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:50] [INFO ] Deduced a trap composed of 40 places in 408 ms of which 2 ms to minimize.
[2023-03-09 08:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2023-03-09 08:36:51] [INFO ] After 1789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-09 08:36:51] [INFO ] After 3116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 147 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10104 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1010 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 139940 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139940 steps, saw 66329 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 08:36:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:36:55] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-09 08:36:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:36:55] [INFO ] After 530ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 08:36:55] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:36:56] [INFO ] After 259ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:36:56] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:36:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:36:57] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:57] [INFO ] After 446ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 08:36:58] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 1 ms to minimize.
[2023-03-09 08:36:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 502 ms
[2023-03-09 08:36:58] [INFO ] Deduced a trap composed of 22 places in 470 ms of which 1 ms to minimize.
[2023-03-09 08:36:59] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 0 ms to minimize.
[2023-03-09 08:36:59] [INFO ] Deduced a trap composed of 60 places in 362 ms of which 1 ms to minimize.
[2023-03-09 08:37:00] [INFO ] Deduced a trap composed of 59 places in 385 ms of which 0 ms to minimize.
[2023-03-09 08:37:00] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 1 ms to minimize.
[2023-03-09 08:37:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2405 ms
[2023-03-09 08:37:01] [INFO ] Deduced a trap composed of 69 places in 397 ms of which 0 ms to minimize.
[2023-03-09 08:37:01] [INFO ] Deduced a trap composed of 41 places in 433 ms of which 1 ms to minimize.
[2023-03-09 08:37:02] [INFO ] Deduced a trap composed of 27 places in 367 ms of which 0 ms to minimize.
[2023-03-09 08:37:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1489 ms
[2023-03-09 08:37:02] [INFO ] After 5390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-03-09 08:37:02] [INFO ] After 6750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 51 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 43 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:37:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:37:03] [INFO ] Invariant cache hit.
[2023-03-09 08:37:03] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-09 08:37:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:37:03] [INFO ] Invariant cache hit.
[2023-03-09 08:37:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:37:05] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
[2023-03-09 08:37:05] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-09 08:37:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:37:05] [INFO ] Invariant cache hit.
[2023-03-09 08:37:06] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3154 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 281 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-09 08:37:06] [INFO ] Computed 9 place invariants in 21 ms
[2023-03-09 08:37:06] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 08:37:07] [INFO ] After 521ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 08:37:07] [INFO ] After 680ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-09 08:37:07] [INFO ] After 904ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2023-03-09 08:37:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 08:37:08] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 08:37:08] [INFO ] After 1285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 408 ms.
[2023-03-09 08:37:09] [INFO ] After 1780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 633 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22 reset in 811 ms.
Product exploration explored 100000 steps with 22 reset in 712 ms.
Built C files in :
/tmp/ltsmin12083333005024495986
[2023-03-09 08:37:12] [INFO ] Too many transitions (2753) to apply POR reductions. Disabling POR matrices.
[2023-03-09 08:37:12] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12083333005024495986
Running compilation step : cd /tmp/ltsmin12083333005024495986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12083333005024495986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12083333005024495986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 72 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-09 08:37:15] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-09 08:37:15] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-09 08:37:15] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-09 08:37:15] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-09 08:37:15] [INFO ] Invariant cache hit.
[2023-03-09 08:37:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:37:17] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2023-03-09 08:37:17] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-09 08:37:17] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-09 08:37:17] [INFO ] Invariant cache hit.
[2023-03-09 08:37:18] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3522 ms. Remains : 235/235 places, 2753/2753 transitions.
Built C files in :
/tmp/ltsmin5645512843059523347
[2023-03-09 08:37:18] [INFO ] Too many transitions (2753) to apply POR reductions. Disabling POR matrices.
[2023-03-09 08:37:18] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5645512843059523347
Running compilation step : cd /tmp/ltsmin5645512843059523347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5645512843059523347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5645512843059523347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 08:37:22] [INFO ] Flatten gal took : 187 ms
[2023-03-09 08:37:22] [INFO ] Flatten gal took : 168 ms
[2023-03-09 08:37:22] [INFO ] Time to serialize gal into /tmp/LTL14837367176683910183.gal : 48 ms
[2023-03-09 08:37:22] [INFO ] Time to serialize properties into /tmp/LTL10358423942244777826.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14837367176683910183.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10518051986658391702.hoa' '-atoms' '/tmp/LTL10358423942244777826.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10358423942244777826.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10518051986658391702.hoa
Detected timeout of ITS tools.
[2023-03-09 08:37:37] [INFO ] Flatten gal took : 132 ms
[2023-03-09 08:37:37] [INFO ] Flatten gal took : 131 ms
[2023-03-09 08:37:37] [INFO ] Time to serialize gal into /tmp/LTL7344198400602500106.gal : 25 ms
[2023-03-09 08:37:37] [INFO ] Time to serialize properties into /tmp/LTL13562928406462606124.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7344198400602500106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13562928406462606124.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))"))&&(F((G...288
Formula 0 simplified : F(G!"((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))" | G(F!"(((...276
Detected timeout of ITS tools.
[2023-03-09 08:37:53] [INFO ] Flatten gal took : 151 ms
[2023-03-09 08:37:53] [INFO ] Applying decomposition
[2023-03-09 08:37:53] [INFO ] Flatten gal took : 140 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16421649643985022451.txt' '-o' '/tmp/graph16421649643985022451.bin' '-w' '/tmp/graph16421649643985022451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16421649643985022451.bin' '-l' '-1' '-v' '-w' '/tmp/graph16421649643985022451.weights' '-q' '0' '-e' '0.001'
[2023-03-09 08:37:53] [INFO ] Decomposing Gal with order
[2023-03-09 08:37:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 08:37:54] [INFO ] Removed a total of 346 redundant transitions.
[2023-03-09 08:37:54] [INFO ] Flatten gal took : 293 ms
[2023-03-09 08:37:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 29 ms.
[2023-03-09 08:37:54] [INFO ] Time to serialize gal into /tmp/LTL5889339524705354803.gal : 40 ms
[2023-03-09 08:37:54] [INFO ] Time to serialize properties into /tmp/LTL8699899060307146633.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5889339524705354803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8699899060307146633.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("((((i2.u3.l10<1)||(i2.u3.x2_FIX_AGAIN_q6<1))||((i2.u3.ch2_BUG_REPORT_q6<1)||(u6.l19<1)))||((u6.x3_BUG_REPORT_q0<1)||(u6.ch3_B...342
Formula 0 simplified : F(G!"((((i2.u3.l10<1)||(i2.u3.x2_FIX_AGAIN_q6<1))||((i2.u3.ch2_BUG_REPORT_q6<1)||(u6.l19<1)))||((u6.x3_BUG_REPORT_q0<1)||(u6.ch3_BUG...330
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6378399550118529681
[2023-03-09 08:38:09] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6378399550118529681
Running compilation step : cd /tmp/ltsmin6378399550118529681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6378399550118529681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6378399550118529681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BugTracking-PT-q3m256-LTLFireability-07 finished in 124134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
[2023-03-09 08:38:13] [INFO ] Flatten gal took : 160 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14701648938226792932
[2023-03-09 08:38:13] [INFO ] Too many transitions (2750) to apply POR reductions. Disabling POR matrices.
[2023-03-09 08:38:13] [INFO ] Applying decomposition
[2023-03-09 08:38:13] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14701648938226792932
Running compilation step : cd /tmp/ltsmin14701648938226792932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 08:38:13] [INFO ] Flatten gal took : 104 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4114219109859253214.txt' '-o' '/tmp/graph4114219109859253214.bin' '-w' '/tmp/graph4114219109859253214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4114219109859253214.bin' '-l' '-1' '-v' '-w' '/tmp/graph4114219109859253214.weights' '-q' '0' '-e' '0.001'
[2023-03-09 08:38:13] [INFO ] Decomposing Gal with order
[2023-03-09 08:38:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 08:38:14] [INFO ] Removed a total of 334 redundant transitions.
[2023-03-09 08:38:14] [INFO ] Flatten gal took : 332 ms
[2023-03-09 08:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 93 ms.
[2023-03-09 08:38:14] [INFO ] Time to serialize gal into /tmp/LTLFireability16813569269962220395.gal : 82 ms
[2023-03-09 08:38:14] [INFO ] Time to serialize properties into /tmp/LTLFireability17274367743276657510.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16813569269962220395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17274367743276657510.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((F("((((i2.u3.l10<1)||(i2.u3.x2_FIX_AGAIN_q6<1))||((i2.u3.ch2_BUG_REPORT_q6<1)||(u6.l19<1)))||((u6.x3_BUG_REPORT_q0<1)||(u6.ch3_B...342
Formula 0 simplified : F(G!"((((i2.u3.l10<1)||(i2.u3.x2_FIX_AGAIN_q6<1))||((i2.u3.ch2_BUG_REPORT_q6<1)||(u6.l19<1)))||((u6.x3_BUG_REPORT_q0<1)||(u6.ch3_BUG...330
Compilation finished in 7252 ms.
Running link step : cd /tmp/ltsmin14701648938226792932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin14701648938226792932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 08:59:06] [INFO ] Flatten gal took : 314 ms
[2023-03-09 08:59:06] [INFO ] Time to serialize gal into /tmp/LTLFireability8345146915489169603.gal : 53 ms
[2023-03-09 08:59:06] [INFO ] Time to serialize properties into /tmp/LTLFireability17101784618717639693.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8345146915489169603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17101784618717639693.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G((F("((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))"))&&(F((G...288
Formula 0 simplified : F(G!"((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))" | G(F!"(((...276
Detected timeout of ITS tools.
[2023-03-09 09:19:57] [INFO ] Flatten gal took : 289 ms
[2023-03-09 09:19:58] [INFO ] Input system was already deterministic with 2750 transitions.
[2023-03-09 09:19:58] [INFO ] Transformed 237 places.
[2023-03-09 09:19:58] [INFO ] Transformed 2750 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 09:19:58] [INFO ] Time to serialize gal into /tmp/LTLFireability667351328213797740.gal : 47 ms
[2023-03-09 09:19:58] [INFO ] Time to serialize properties into /tmp/LTLFireability9046428290974713230.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability667351328213797740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9046428290974713230.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))"))&&(F((G...288
Formula 0 simplified : F(G!"((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))" | G(F!"(((...276
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6901856 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16021064 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="BugTracking-PT-q3m256"
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-5348"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m256, 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 r037-tajo-167813690300380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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