Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 12:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 13 12:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-03b-LTLFireability-00
FORMULA_NAME DLCround-PT-03b-LTLFireability-01
FORMULA_NAME DLCround-PT-03b-LTLFireability-02
FORMULA_NAME DLCround-PT-03b-LTLFireability-03
FORMULA_NAME DLCround-PT-03b-LTLFireability-04
FORMULA_NAME DLCround-PT-03b-LTLFireability-05
FORMULA_NAME DLCround-PT-03b-LTLFireability-06
FORMULA_NAME DLCround-PT-03b-LTLFireability-07
FORMULA_NAME DLCround-PT-03b-LTLFireability-08
FORMULA_NAME DLCround-PT-03b-LTLFireability-09
FORMULA_NAME DLCround-PT-03b-LTLFireability-10
FORMULA_NAME DLCround-PT-03b-LTLFireability-11
FORMULA_NAME DLCround-PT-03b-LTLFireability-12
FORMULA_NAME DLCround-PT-03b-LTLFireability-13
FORMULA_NAME DLCround-PT-03b-LTLFireability-14
FORMULA_NAME DLCround-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716340413133

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 01:13:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 01:13:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:13:35] [INFO ] Load time of PNML (sax parser for PT used): 467 ms
[2024-05-22 01:13:36] [INFO ] Transformed 1383 places.
[2024-05-22 01:13:36] [INFO ] Transformed 1887 transitions.
[2024-05-22 01:13:36] [INFO ] Found NUPN structural information;
[2024-05-22 01:13:36] [INFO ] Parsed PT model containing 1383 places and 1887 transitions and 4809 arcs in 747 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DLCround-PT-03b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1887/1887 transitions.
Discarding 228 places :
Symmetric choice reduction at 0 with 228 rule applications. Total rules 228 place count 1155 transition count 1659
Iterating global reduction 0 with 228 rules applied. Total rules applied 456 place count 1155 transition count 1659
Discarding 168 places :
Symmetric choice reduction at 0 with 168 rule applications. Total rules 624 place count 987 transition count 1491
Iterating global reduction 0 with 168 rules applied. Total rules applied 792 place count 987 transition count 1491
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 795 place count 987 transition count 1488
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 832 place count 950 transition count 1425
Iterating global reduction 1 with 37 rules applied. Total rules applied 869 place count 950 transition count 1425
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 893 place count 926 transition count 1401
Iterating global reduction 1 with 24 rules applied. Total rules applied 917 place count 926 transition count 1401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 918 place count 926 transition count 1400
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 931 place count 913 transition count 1387
Iterating global reduction 2 with 13 rules applied. Total rules applied 944 place count 913 transition count 1387
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 957 place count 900 transition count 1374
Iterating global reduction 2 with 13 rules applied. Total rules applied 970 place count 900 transition count 1374
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 982 place count 888 transition count 1362
Iterating global reduction 2 with 12 rules applied. Total rules applied 994 place count 888 transition count 1362
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1004 place count 878 transition count 1352
Iterating global reduction 2 with 10 rules applied. Total rules applied 1014 place count 878 transition count 1352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1019 place count 873 transition count 1347
Iterating global reduction 2 with 5 rules applied. Total rules applied 1024 place count 873 transition count 1347
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1029 place count 868 transition count 1342
Iterating global reduction 2 with 5 rules applied. Total rules applied 1034 place count 868 transition count 1342
Applied a total of 1034 rules in 719 ms. Remains 868 /1383 variables (removed 515) and now considering 1342/1887 (removed 545) transitions.
// Phase 1: matrix 1342 rows 868 cols
[2024-05-22 01:13:37] [INFO ] Computed 52 invariants in 36 ms
[2024-05-22 01:13:37] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-22 01:13:37] [INFO ] Invariant cache hit.
[2024-05-22 01:13:39] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
Running 1341 sub problems to find dead transitions.
[2024-05-22 01:13:39] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 867/2210 variables, and 0 constraints, problems are : Problem set: 0 solved, 1341 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 1341/1341 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1341 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 867/2210 variables, and 0 constraints, problems are : Problem set: 0 solved, 1341 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 0/1341 constraints, Known Traps: 0/0 constraints]
After SMT, in 60873ms problems are : Problem set: 0 solved, 1341 unsolved
Search for dead transitions found 0 dead transitions in 60928ms
Starting structural reductions in LTL mode, iteration 1 : 868/1383 places, 1342/1887 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63662 ms. Remains : 868/1383 places, 1342/1887 transitions.
Support contains 40 out of 868 places after structural reductions.
[2024-05-22 01:14:40] [INFO ] Flatten gal took : 244 ms
[2024-05-22 01:14:40] [INFO ] Flatten gal took : 86 ms
[2024-05-22 01:14:40] [INFO ] Input system was already deterministic with 1342 transitions.
Support contains 37 out of 868 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2659 ms. (15 steps per ms) remains 1/30 properties
BEST_FIRST walk for 39381 steps (8 resets) in 129 ms. (302 steps per ms) remains 0/1 properties
Computed a total of 102 stabilizing places and 102 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1||F((p1&&X((p1 U (p2||G(p1)))))))))))'
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 851 transition count 1323
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 851 transition count 1323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 851 transition count 1322
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 49 place count 837 transition count 1308
Iterating global reduction 1 with 14 rules applied. Total rules applied 63 place count 837 transition count 1308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 837 transition count 1306
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 830 transition count 1299
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 830 transition count 1299
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 825 transition count 1294
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 825 transition count 1294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 823 transition count 1292
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 823 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 822 transition count 1291
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 822 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 821 transition count 1290
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 821 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 820 transition count 1289
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 820 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 819 transition count 1288
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 819 transition count 1288
Applied a total of 101 rules in 300 ms. Remains 819 /868 variables (removed 49) and now considering 1288/1342 (removed 54) transitions.
// Phase 1: matrix 1288 rows 819 cols
[2024-05-22 01:14:42] [INFO ] Computed 52 invariants in 8 ms
[2024-05-22 01:14:43] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-22 01:14:43] [INFO ] Invariant cache hit.
[2024-05-22 01:14:43] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Running 1287 sub problems to find dead transitions.
[2024-05-22 01:14:44] [INFO ] Invariant cache hit.
(s9 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/2107 variables, and 0 constraints, problems are : Problem set: 0 solved, 1287 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, State Equation: 0/819 constraints, PredecessorRefiner: 1287/1287 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1287 unsolved
At refinement iteration 1 (OVERLAPS) 1/819 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 1287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/2107 variables, and 52 constraints, problems are : Problem set: 0 solved, 1287 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 0/819 constraints, PredecessorRefiner: 0/1287 constraints, Known Traps: 0/0 constraints]
After SMT, in 60749ms problems are : Problem set: 0 solved, 1287 unsolved
Search for dead transitions found 0 dead transitions in 60779ms
Starting structural reductions in LTL mode, iteration 1 : 819/868 places, 1288/1342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62387 ms. Remains : 819/868 places, 1288/1342 transitions.
Stuttering acceptance computed with spot in 547 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-00
Stuttering criterion allowed to conclude after 51309 steps with 1 reset in 503 ms.
FORMULA DLCround-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-00 finished in 63599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Graph (trivial) has 825 edges and 868 vertex of which 257 / 868 are part of one of the 20 SCC in 8 ms
Free SCC test removed 237 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 170 place count 630 transition count 913
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 201 rules applied. Total rules applied 371 place count 461 transition count 881
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 391 place count 441 transition count 881
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 391 place count 441 transition count 827
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 499 place count 387 transition count 827
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 538 place count 348 transition count 689
Iterating global reduction 3 with 39 rules applied. Total rules applied 577 place count 348 transition count 689
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 580 place count 348 transition count 686
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 580 place count 348 transition count 683
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 586 place count 345 transition count 683
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 587 place count 344 transition count 676
Iterating global reduction 4 with 1 rules applied. Total rules applied 588 place count 344 transition count 676
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 589 place count 344 transition count 675
Performed 123 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 835 place count 221 transition count 548
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 839 place count 221 transition count 544
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 852 place count 208 transition count 468
Iterating global reduction 6 with 13 rules applied. Total rules applied 865 place count 208 transition count 468
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 877 place count 208 transition count 456
Performed 16 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 909 place count 192 transition count 533
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 913 place count 188 transition count 495
Iterating global reduction 7 with 4 rules applied. Total rules applied 917 place count 188 transition count 495
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 934 place count 188 transition count 478
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 955 place count 188 transition count 457
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 963 place count 180 transition count 441
Iterating global reduction 8 with 8 rules applied. Total rules applied 971 place count 180 transition count 441
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 979 place count 172 transition count 383
Iterating global reduction 8 with 8 rules applied. Total rules applied 987 place count 172 transition count 383
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 995 place count 172 transition count 375
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 996 place count 171 transition count 374
Applied a total of 996 rules in 566 ms. Remains 171 /868 variables (removed 697) and now considering 374/1342 (removed 968) transitions.
[2024-05-22 01:15:46] [INFO ] Flow matrix only has 358 transitions (discarded 16 similar events)
// Phase 1: matrix 358 rows 171 cols
[2024-05-22 01:15:46] [INFO ] Computed 52 invariants in 3 ms
[2024-05-22 01:15:46] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 01:15:46] [INFO ] Flow matrix only has 358 transitions (discarded 16 similar events)
[2024-05-22 01:15:46] [INFO ] Invariant cache hit.
[2024-05-22 01:15:46] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-22 01:15:46] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-22 01:15:46] [INFO ] Redundant transitions in 27 ms returned []
Running 326 sub problems to find dead transitions.
[2024-05-22 01:15:46] [INFO ] Flow matrix only has 358 transitions (discarded 16 similar events)
[2024-05-22 01:15:46] [INFO ] Invariant cache hit.
[2024-05-22 01:15:46] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 357/528 variables, 171/223 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 28/251 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/529 variables, and 251 constraints, problems are : Problem set: 0 solved, 326 unsolved in 16289 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 171/171 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 357/528 variables, 171/223 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 28/251 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 326/577 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (OVERLAPS) 0/528 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/529 variables, and 577 constraints, problems are : Problem set: 0 solved, 326 unsolved in 20305 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 171/171 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints]
After SMT, in 36750ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 36754ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/868 places, 374/1342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37849 ms. Remains : 171/868 places, 374/1342 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-01
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-01 finished in 37965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Graph (trivial) has 823 edges and 868 vertex of which 239 / 868 are part of one of the 21 SCC in 2 ms
Free SCC test removed 218 places
Ensure Unique test removed 237 transitions
Reduce isomorphic transitions removed 237 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 176 place count 649 transition count 929
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 207 rules applied. Total rules applied 383 place count 474 transition count 897
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 404 place count 454 transition count 896
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 405 place count 453 transition count 896
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 405 place count 453 transition count 839
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 519 place count 396 transition count 839
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 556 place count 359 transition count 709
Iterating global reduction 4 with 37 rules applied. Total rules applied 593 place count 359 transition count 709
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 596 place count 359 transition count 706
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 596 place count 359 transition count 702
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 604 place count 355 transition count 702
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 605 place count 354 transition count 695
Iterating global reduction 5 with 1 rules applied. Total rules applied 606 place count 354 transition count 695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 607 place count 354 transition count 694
Performed 127 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 6 with 254 rules applied. Total rules applied 861 place count 227 transition count 563
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 865 place count 227 transition count 559
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 877 place count 215 transition count 490
Iterating global reduction 7 with 12 rules applied. Total rules applied 889 place count 215 transition count 490
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 899 place count 215 transition count 480
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 901 place count 214 transition count 479
Performed 16 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 933 place count 198 transition count 561
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 934 place count 198 transition count 560
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 937 place count 195 transition count 532
Iterating global reduction 9 with 3 rules applied. Total rules applied 940 place count 195 transition count 532
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 953 place count 195 transition count 519
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 972 place count 195 transition count 500
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 978 place count 189 transition count 488
Iterating global reduction 10 with 6 rules applied. Total rules applied 984 place count 189 transition count 488
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 990 place count 183 transition count 444
Iterating global reduction 10 with 6 rules applied. Total rules applied 996 place count 183 transition count 444
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1002 place count 183 transition count 438
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1003 place count 182 transition count 437
Applied a total of 1003 rules in 267 ms. Remains 182 /868 variables (removed 686) and now considering 437/1342 (removed 905) transitions.
[2024-05-22 01:16:24] [INFO ] Flow matrix only has 418 transitions (discarded 19 similar events)
// Phase 1: matrix 418 rows 182 cols
[2024-05-22 01:16:24] [INFO ] Computed 52 invariants in 2 ms
[2024-05-22 01:16:24] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 01:16:24] [INFO ] Flow matrix only has 418 transitions (discarded 19 similar events)
[2024-05-22 01:16:24] [INFO ] Invariant cache hit.
[2024-05-22 01:16:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 01:16:24] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-05-22 01:16:24] [INFO ] Redundant transitions in 7 ms returned []
Running 392 sub problems to find dead transitions.
[2024-05-22 01:16:24] [INFO ] Flow matrix only has 418 transitions (discarded 19 similar events)
[2024-05-22 01:16:24] [INFO ] Invariant cache hit.
[2024-05-22 01:16:24] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 2/182 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 417/599 variables, 182/234 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 36/270 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 0/599 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/600 variables, and 270 constraints, problems are : Problem set: 0 solved, 392 unsolved in 23953 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 182/182 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 2/182 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 417/599 variables, 182/234 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 36/270 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 392/662 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 8 (OVERLAPS) 0/599 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/600 variables, and 662 constraints, problems are : Problem set: 0 solved, 392 unsolved in 23376 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 182/182 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints]
After SMT, in 47482ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 47487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 182/868 places, 437/1342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48329 ms. Remains : 182/868 places, 437/1342 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-02 finished in 48460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1&&X(p0))||X(G(p0)))))'
Support contains 2 out of 868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 850 transition count 1322
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 850 transition count 1322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 850 transition count 1321
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 53 place count 834 transition count 1305
Iterating global reduction 1 with 16 rules applied. Total rules applied 69 place count 834 transition count 1305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 834 transition count 1302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 828 transition count 1296
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 828 transition count 1296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 824 transition count 1292
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 824 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 823 transition count 1291
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 823 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 822 transition count 1290
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 822 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 821 transition count 1289
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 821 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 820 transition count 1288
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 820 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 819 transition count 1287
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 819 transition count 1287
Applied a total of 102 rules in 349 ms. Remains 819 /868 variables (removed 49) and now considering 1287/1342 (removed 55) transitions.
// Phase 1: matrix 1287 rows 819 cols
[2024-05-22 01:17:12] [INFO ] Computed 52 invariants in 9 ms
[2024-05-22 01:17:13] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-22 01:17:13] [INFO ] Invariant cache hit.
[2024-05-22 01:17:14] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
Running 1286 sub problems to find dead transitions.
[2024-05-22 01:17:14] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1286 unsolved
SMT process timed out in 30515ms, After SMT, problems are : Problem set: 0 solved, 1286 unsolved
Search for dead transitions found 0 dead transitions in 30538ms
Starting structural reductions in LTL mode, iteration 1 : 819/868 places, 1287/1342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32265 ms. Remains : 819/868 places, 1287/1342 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 608 ms.
Product exploration explored 100000 steps with 50000 reset in 526 ms.
Computed a total of 100 stabilizing places and 100 stable transitions
Computed a total of 100 stabilizing places and 100 stable transitions
Detected a total of 100/819 stabilizing places and 100/1287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-03b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-03b-LTLFireability-03 finished in 33627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Graph (trivial) has 820 edges and 868 vertex of which 257 / 868 are part of one of the 20 SCC in 1 ms
Free SCC test removed 237 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 630 transition count 915
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 197 rules applied. Total rules applied 365 place count 463 transition count 885
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 384 place count 444 transition count 885
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 384 place count 444 transition count 830
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 494 place count 389 transition count 830
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 532 place count 351 transition count 699
Iterating global reduction 3 with 38 rules applied. Total rules applied 570 place count 351 transition count 699
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 573 place count 351 transition count 696
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 573 place count 351 transition count 692
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 581 place count 347 transition count 692
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 582 place count 346 transition count 685
Iterating global reduction 4 with 1 rules applied. Total rules applied 583 place count 346 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 584 place count 346 transition count 684
Performed 121 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 5 with 242 rules applied. Total rules applied 826 place count 225 transition count 560
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 829 place count 225 transition count 557
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 842 place count 212 transition count 481
Iterating global reduction 6 with 13 rules applied. Total rules applied 855 place count 212 transition count 481
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 867 place count 212 transition count 469
Performed 17 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 901 place count 195 transition count 549
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 905 place count 191 transition count 511
Iterating global reduction 7 with 4 rules applied. Total rules applied 909 place count 191 transition count 511
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 926 place count 191 transition count 494
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 8 with 20 rules applied. Total rules applied 946 place count 191 transition count 474
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 952 place count 185 transition count 462
Iterating global reduction 8 with 6 rules applied. Total rules applied 958 place count 185 transition count 462
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 964 place count 179 transition count 418
Iterating global reduction 8 with 6 rules applied. Total rules applied 970 place count 179 transition count 418
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 976 place count 179 transition count 412
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 978 place count 179 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 979 place count 179 transition count 411
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 980 place count 178 transition count 409
Iterating global reduction 9 with 1 rules applied. Total rules applied 981 place count 178 transition count 409
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 982 place count 177 transition count 402
Iterating global reduction 9 with 1 rules applied. Total rules applied 983 place count 177 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 984 place count 177 transition count 401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 985 place count 176 transition count 400
Applied a total of 985 rules in 160 ms. Remains 176 /868 variables (removed 692) and now considering 400/1342 (removed 942) transitions.
[2024-05-22 01:17:46] [INFO ] Flow matrix only has 383 transitions (discarded 17 similar events)
// Phase 1: matrix 383 rows 176 cols
[2024-05-22 01:17:46] [INFO ] Computed 52 invariants in 2 ms
[2024-05-22 01:17:46] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 01:17:46] [INFO ] Flow matrix only has 383 transitions (discarded 17 similar events)
[2024-05-22 01:17:46] [INFO ] Invariant cache hit.
[2024-05-22 01:17:46] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-22 01:17:46] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-22 01:17:46] [INFO ] Redundant transitions in 2 ms returned []
Running 350 sub problems to find dead transitions.
[2024-05-22 01:17:46] [INFO ] Flow matrix only has 383 transitions (discarded 17 similar events)
[2024-05-22 01:17:46] [INFO ] Invariant cache hit.
[2024-05-22 01:17:46] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 382/558 variables, 176/228 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 29/257 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/559 variables, and 257 constraints, problems are : Problem set: 0 solved, 350 unsolved in 21450 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 176/176 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 382/558 variables, 176/228 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 29/257 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 350/607 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 8 (OVERLAPS) 0/558 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/559 variables, and 607 constraints, problems are : Problem set: 0 solved, 350 unsolved in 23906 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 176/176 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 0/0 constraints]
After SMT, in 45477ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 45480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 176/868 places, 400/1342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46100 ms. Remains : 176/868 places, 400/1342 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-04 finished in 46184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 850 transition count 1322
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 850 transition count 1322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 850 transition count 1321
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 52 place count 835 transition count 1306
Iterating global reduction 1 with 15 rules applied. Total rules applied 67 place count 835 transition count 1306
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 70 place count 835 transition count 1303
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 829 transition count 1297
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 829 transition count 1297
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 825 transition count 1293
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 825 transition count 1293
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 823 transition count 1291
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 823 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 822 transition count 1290
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 822 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 821 transition count 1289
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 821 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 820 transition count 1288
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 820 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 819 transition count 1287
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 819 transition count 1287
Applied a total of 102 rules in 205 ms. Remains 819 /868 variables (removed 49) and now considering 1287/1342 (removed 55) transitions.
// Phase 1: matrix 1287 rows 819 cols
[2024-05-22 01:18:32] [INFO ] Computed 52 invariants in 5 ms
[2024-05-22 01:18:32] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-22 01:18:32] [INFO ] Invariant cache hit.
[2024-05-22 01:18:33] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
Running 1286 sub problems to find dead transitions.
[2024-05-22 01:18:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1286 unsolved
SMT process timed out in 30382ms, After SMT, problems are : Problem set: 0 solved, 1286 unsolved
Search for dead transitions found 0 dead transitions in 30397ms
Starting structural reductions in LTL mode, iteration 1 : 819/868 places, 1287/1342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31814 ms. Remains : 819/868 places, 1287/1342 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Product exploration explored 100000 steps with 50000 reset in 389 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/819 stabilizing places and 99/1287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-03b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-03b-LTLFireability-06 finished in 32878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Graph (trivial) has 825 edges and 868 vertex of which 257 / 868 are part of one of the 20 SCC in 1 ms
Free SCC test removed 237 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 630 transition count 914
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 200 rules applied. Total rules applied 369 place count 462 transition count 882
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 389 place count 442 transition count 882
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 389 place count 442 transition count 828
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 497 place count 388 transition count 828
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 537 place count 348 transition count 689
Iterating global reduction 3 with 40 rules applied. Total rules applied 577 place count 348 transition count 689
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 580 place count 348 transition count 686
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 580 place count 348 transition count 682
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 588 place count 344 transition count 682
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 589 place count 343 transition count 675
Iterating global reduction 4 with 1 rules applied. Total rules applied 590 place count 343 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 591 place count 343 transition count 674
Performed 122 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 5 with 244 rules applied. Total rules applied 835 place count 221 transition count 548
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 839 place count 221 transition count 544
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 852 place count 208 transition count 468
Iterating global reduction 6 with 13 rules applied. Total rules applied 865 place count 208 transition count 468
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 877 place count 208 transition count 456
Performed 16 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 909 place count 192 transition count 537
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 912 place count 189 transition count 509
Iterating global reduction 7 with 3 rules applied. Total rules applied 915 place count 189 transition count 509
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 928 place count 189 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 949 place count 189 transition count 475
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 957 place count 181 transition count 459
Iterating global reduction 8 with 8 rules applied. Total rules applied 965 place count 181 transition count 459
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 973 place count 173 transition count 401
Iterating global reduction 8 with 8 rules applied. Total rules applied 981 place count 173 transition count 401
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 989 place count 173 transition count 393
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 990 place count 172 transition count 392
Applied a total of 990 rules in 111 ms. Remains 172 /868 variables (removed 696) and now considering 392/1342 (removed 950) transitions.
[2024-05-22 01:19:05] [INFO ] Flow matrix only has 371 transitions (discarded 21 similar events)
// Phase 1: matrix 371 rows 172 cols
[2024-05-22 01:19:05] [INFO ] Computed 52 invariants in 1 ms
[2024-05-22 01:19:05] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 01:19:05] [INFO ] Flow matrix only has 371 transitions (discarded 21 similar events)
[2024-05-22 01:19:05] [INFO ] Invariant cache hit.
[2024-05-22 01:19:05] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-22 01:19:05] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-05-22 01:19:05] [INFO ] Redundant transitions in 4 ms returned []
Running 344 sub problems to find dead transitions.
[2024-05-22 01:19:05] [INFO ] Flow matrix only has 371 transitions (discarded 21 similar events)
[2024-05-22 01:19:05] [INFO ] Invariant cache hit.
[2024-05-22 01:19:05] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (OVERLAPS) 370/542 variables, 172/224 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 29/253 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (OVERLAPS) 0/542 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/543 variables, and 253 constraints, problems are : Problem set: 0 solved, 344 unsolved in 22194 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 172/172 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (OVERLAPS) 370/542 variables, 172/224 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 29/253 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 344/597 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (OVERLAPS) 0/542 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/543 variables, and 597 constraints, problems are : Problem set: 0 solved, 344 unsolved in 24711 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 172/172 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 0/0 constraints]
After SMT, in 47079ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 47084ms
Starting structural reductions in SI_LTL mode, iteration 1 : 172/868 places, 392/1342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47695 ms. Remains : 172/868 places, 392/1342 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-07 finished in 47744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||(p2 U (p3||G(p2)))))))'
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 853 transition count 1326
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 853 transition count 1326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 853 transition count 1325
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 840 transition count 1312
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 840 transition count 1312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 840 transition count 1310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 834 transition count 1304
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 834 transition count 1304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 829 transition count 1299
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 829 transition count 1299
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 827 transition count 1297
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 827 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 826 transition count 1296
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 826 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 825 transition count 1295
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 825 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 824 transition count 1294
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 824 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 823 transition count 1293
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 823 transition count 1293
Applied a total of 93 rules in 195 ms. Remains 823 /868 variables (removed 45) and now considering 1293/1342 (removed 49) transitions.
// Phase 1: matrix 1293 rows 823 cols
[2024-05-22 01:19:52] [INFO ] Computed 52 invariants in 5 ms
[2024-05-22 01:19:53] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-22 01:19:53] [INFO ] Invariant cache hit.
[2024-05-22 01:19:54] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Running 1292 sub problems to find dead transitions.
[2024-05-22 01:19:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/822 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
SMT process timed out in 30324ms, After SMT, problems are : Problem set: 0 solved, 1292 unsolved
Search for dead transitions found 0 dead transitions in 30339ms
Starting structural reductions in LTL mode, iteration 1 : 823/868 places, 1293/1342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32080 ms. Remains : 823/868 places, 1293/1342 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-08 finished in 32409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Graph (trivial) has 820 edges and 868 vertex of which 257 / 868 are part of one of the 20 SCC in 2 ms
Free SCC test removed 237 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 167 place count 630 transition count 916
Reduce places removed 166 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 198 rules applied. Total rules applied 365 place count 464 transition count 884
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 385 place count 444 transition count 884
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 385 place count 444 transition count 829
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 495 place count 389 transition count 829
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 533 place count 351 transition count 692
Iterating global reduction 3 with 38 rules applied. Total rules applied 571 place count 351 transition count 692
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 574 place count 351 transition count 689
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 574 place count 351 transition count 685
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 582 place count 347 transition count 685
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 583 place count 346 transition count 678
Iterating global reduction 4 with 1 rules applied. Total rules applied 584 place count 346 transition count 678
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 585 place count 346 transition count 677
Performed 122 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 5 with 244 rules applied. Total rules applied 829 place count 224 transition count 551
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 833 place count 224 transition count 547
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 846 place count 211 transition count 471
Iterating global reduction 6 with 13 rules applied. Total rules applied 859 place count 211 transition count 471
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 871 place count 211 transition count 459
Performed 16 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 903 place count 195 transition count 536
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 907 place count 191 transition count 498
Iterating global reduction 7 with 4 rules applied. Total rules applied 911 place count 191 transition count 498
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 928 place count 191 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 943 place count 191 transition count 466
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 951 place count 183 transition count 450
Iterating global reduction 8 with 8 rules applied. Total rules applied 959 place count 183 transition count 450
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 967 place count 175 transition count 392
Iterating global reduction 8 with 8 rules applied. Total rules applied 975 place count 175 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 983 place count 175 transition count 384
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 984 place count 174 transition count 383
Applied a total of 984 rules in 171 ms. Remains 174 /868 variables (removed 694) and now considering 383/1342 (removed 959) transitions.
[2024-05-22 01:20:25] [INFO ] Flow matrix only has 365 transitions (discarded 18 similar events)
// Phase 1: matrix 365 rows 174 cols
[2024-05-22 01:20:25] [INFO ] Computed 52 invariants in 2 ms
[2024-05-22 01:20:25] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 01:20:25] [INFO ] Flow matrix only has 365 transitions (discarded 18 similar events)
[2024-05-22 01:20:25] [INFO ] Invariant cache hit.
[2024-05-22 01:20:25] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 01:20:25] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-22 01:20:25] [INFO ] Redundant transitions in 2 ms returned []
Running 338 sub problems to find dead transitions.
[2024-05-22 01:20:25] [INFO ] Flow matrix only has 365 transitions (discarded 18 similar events)
[2024-05-22 01:20:25] [INFO ] Invariant cache hit.
[2024-05-22 01:20:25] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 2/174 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 364/538 variables, 174/226 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 33/259 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 0/538 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/539 variables, and 259 constraints, problems are : Problem set: 0 solved, 338 unsolved in 22058 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 174/174 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 2/174 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 364/538 variables, 174/226 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 33/259 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 338/597 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/539 variables, and 597 constraints, problems are : Problem set: 0 solved, 338 unsolved in 23207 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 174/174 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
After SMT, in 45373ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 45376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/868 places, 383/1342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46186 ms. Remains : 174/868 places, 383/1342 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-09 finished in 46403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U X((X((p0 U p3))||p2))))'
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 851 transition count 1323
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 851 transition count 1323
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 836 transition count 1308
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 836 transition count 1308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 836 transition count 1305
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 829 transition count 1298
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 829 transition count 1298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 824 transition count 1293
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 824 transition count 1293
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 822 transition count 1291
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 822 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 821 transition count 1290
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 821 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 820 transition count 1289
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 820 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 819 transition count 1288
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 819 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 818 transition count 1287
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 818 transition count 1287
Applied a total of 103 rules in 207 ms. Remains 818 /868 variables (removed 50) and now considering 1287/1342 (removed 55) transitions.
// Phase 1: matrix 1287 rows 818 cols
[2024-05-22 01:21:11] [INFO ] Computed 52 invariants in 6 ms
[2024-05-22 01:21:12] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-22 01:21:12] [INFO ] Invariant cache hit.
[2024-05-22 01:21:13] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
Running 1286 sub problems to find dead transitions.
[2024-05-22 01:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1286 unsolved
SMT process timed out in 30383ms, After SMT, problems are : Problem set: 0 solved, 1286 unsolved
Search for dead transitions found 0 dead transitions in 30398ms
Starting structural reductions in LTL mode, iteration 1 : 818/868 places, 1287/1342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32197 ms. Remains : 818/868 places, 1287/1342 transitions.
Stuttering acceptance computed with spot in 412 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 475 ms.
Product exploration explored 100000 steps with 50000 reset in 604 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 18 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-03b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-03b-LTLFireability-10 finished in 33758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F((p1&&X(p1)))))))'
Support contains 3 out of 868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 850 transition count 1322
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 850 transition count 1322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 850 transition count 1321
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 52 place count 835 transition count 1306
Iterating global reduction 1 with 15 rules applied. Total rules applied 67 place count 835 transition count 1306
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 70 place count 835 transition count 1303
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 829 transition count 1297
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 829 transition count 1297
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 825 transition count 1293
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 825 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 824 transition count 1292
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 824 transition count 1292
Applied a total of 92 rules in 119 ms. Remains 824 /868 variables (removed 44) and now considering 1292/1342 (removed 50) transitions.
// Phase 1: matrix 1292 rows 824 cols
[2024-05-22 01:21:45] [INFO ] Computed 52 invariants in 5 ms
[2024-05-22 01:21:45] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-22 01:21:45] [INFO ] Invariant cache hit.
[2024-05-22 01:21:46] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Running 1291 sub problems to find dead transitions.
[2024-05-22 01:21:46] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
SMT process timed out in 30474ms, After SMT, problems are : Problem set: 0 solved, 1291 unsolved
Search for dead transitions found 0 dead transitions in 30493ms
Starting structural reductions in LTL mode, iteration 1 : 824/868 places, 1292/1342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32072 ms. Remains : 824/868 places, 1292/1342 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-13
Product exploration explored 100000 steps with 33389 reset in 222 ms.
Product exploration explored 100000 steps with 33430 reset in 231 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 5768 steps (0 resets) in 37 ms. (151 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 824 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1292/1292 transitions.
Applied a total of 0 rules in 18 ms. Remains 824 /824 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2024-05-22 01:22:18] [INFO ] Invariant cache hit.
[2024-05-22 01:22:19] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-22 01:22:19] [INFO ] Invariant cache hit.
[2024-05-22 01:22:19] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Running 1291 sub problems to find dead transitions.
[2024-05-22 01:22:20] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
SMT process timed out in 30304ms, After SMT, problems are : Problem set: 0 solved, 1291 unsolved
Search for dead transitions found 0 dead transitions in 30315ms
Finished structural reductions in LTL mode , in 1 iterations and 31576 ms. Remains : 824/824 places, 1292/1292 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4050 steps (0 resets) in 19 ms. (202 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33346 reset in 224 ms.
Product exploration explored 100000 steps with 33244 reset in 233 ms.
Built C files in :
/tmp/ltsmin12210761362732908886
[2024-05-22 01:22:51] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12210761362732908886
Running compilation step : cd /tmp/ltsmin12210761362732908886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12210761362732908886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12210761362732908886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 824 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1292/1292 transitions.
Applied a total of 0 rules in 18 ms. Remains 824 /824 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2024-05-22 01:22:54] [INFO ] Invariant cache hit.
[2024-05-22 01:22:55] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-22 01:22:55] [INFO ] Invariant cache hit.
[2024-05-22 01:22:56] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Running 1291 sub problems to find dead transitions.
[2024-05-22 01:22:56] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
SMT process timed out in 30317ms, After SMT, problems are : Problem set: 0 solved, 1291 unsolved
Search for dead transitions found 0 dead transitions in 30328ms
Finished structural reductions in LTL mode , in 1 iterations and 31576 ms. Remains : 824/824 places, 1292/1292 transitions.
Built C files in :
/tmp/ltsmin6742596089077606857
[2024-05-22 01:23:26] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6742596089077606857
Running compilation step : cd /tmp/ltsmin6742596089077606857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6742596089077606857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6742596089077606857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 01:23:29] [INFO ] Flatten gal took : 98 ms
[2024-05-22 01:23:29] [INFO ] Flatten gal took : 84 ms
[2024-05-22 01:23:29] [INFO ] Time to serialize gal into /tmp/LTL4527971947645925917.gal : 20 ms
[2024-05-22 01:23:29] [INFO ] Time to serialize properties into /tmp/LTL7215306566145036386.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4527971947645925917.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16690535477533708368.hoa' '-atoms' '/tmp/LTL7215306566145036386.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7215306566145036386.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16690535477533708368.hoa
Detected timeout of ITS tools.
[2024-05-22 01:23:44] [INFO ] Flatten gal took : 48 ms
[2024-05-22 01:23:44] [INFO ] Flatten gal took : 46 ms
[2024-05-22 01:23:45] [INFO ] Time to serialize gal into /tmp/LTL15504521910271671094.gal : 13 ms
[2024-05-22 01:23:45] [INFO ] Time to serialize properties into /tmp/LTL2639878800998095618.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15504521910271671094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2639878800998095618.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(p24!=1)")&&(X("(p24!=1)")))))&&("((p564==0)||(p1336==0))"))))
Formula 0 simplified : FG(!"(p24!=1)" | X!"(p24!=1)") | G!"((p564==0)||(p1336==0))"
Detected timeout of ITS tools.
[2024-05-22 01:24:00] [INFO ] Flatten gal took : 38 ms
[2024-05-22 01:24:00] [INFO ] Applying decomposition
[2024-05-22 01:24:00] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1183211194825333546.txt' '-o' '/tmp/graph1183211194825333546.bin' '-w' '/tmp/graph1183211194825333546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1183211194825333546.bin' '-l' '-1' '-v' '-w' '/tmp/graph1183211194825333546.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:24:00] [INFO ] Decomposing Gal with order
[2024-05-22 01:24:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:24:00] [INFO ] Removed a total of 959 redundant transitions.
[2024-05-22 01:24:00] [INFO ] Flatten gal took : 239 ms
[2024-05-22 01:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 62 ms.
[2024-05-22 01:24:01] [INFO ] Time to serialize gal into /tmp/LTL14459483076028663253.gal : 31 ms
[2024-05-22 01:24:01] [INFO ] Time to serialize properties into /tmp/LTL10124387423807978768.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14459483076028663253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10124387423807978768.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(i1.i0.i0.u9.p24!=1)")&&(X("(i1.i0.i0.u9.p24!=1)")))))&&("((i8.u119.p564==0)||(i10.i0.i3.u300.p1336==0))"))))
Formula 0 simplified : FG(!"(i1.i0.i0.u9.p24!=1)" | X!"(i1.i0.i0.u9.p24!=1)") | G!"((i8.u119.p564==0)||(i10.i0.i3.u300.p1336==0))"
Detected timeout of ITS tools.
Treatment of property DLCround-PT-03b-LTLFireability-13 finished in 150852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(X(G(p1))))))))'
Support contains 3 out of 868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 849 transition count 1321
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 849 transition count 1321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 849 transition count 1320
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 54 place count 834 transition count 1305
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 834 transition count 1305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 834 transition count 1302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 828 transition count 1296
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 828 transition count 1296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 824 transition count 1292
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 824 transition count 1292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 822 transition count 1290
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 822 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 821 transition count 1289
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 821 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 820 transition count 1288
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 820 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 819 transition count 1287
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 819 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 818 transition count 1286
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 818 transition count 1286
Applied a total of 104 rules in 286 ms. Remains 818 /868 variables (removed 50) and now considering 1286/1342 (removed 56) transitions.
// Phase 1: matrix 1286 rows 818 cols
[2024-05-22 01:24:16] [INFO ] Computed 52 invariants in 7 ms
[2024-05-22 01:24:16] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-22 01:24:16] [INFO ] Invariant cache hit.
[2024-05-22 01:24:17] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Running 1285 sub problems to find dead transitions.
[2024-05-22 01:24:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1285 unsolved
SMT process timed out in 30519ms, After SMT, problems are : Problem set: 0 solved, 1285 unsolved
Search for dead transitions found 0 dead transitions in 30537ms
Starting structural reductions in LTL mode, iteration 1 : 818/868 places, 1286/1342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32394 ms. Remains : 818/868 places, 1286/1342 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 507 ms.
Stack based approach found an accepted trace after 17113 steps with 0 reset with depth 17114 and stack size 1075 in 168 ms.
FORMULA DLCround-PT-03b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DLCround-PT-03b-LTLFireability-14 finished in 33451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p1))&&p0))&&F(p2)))'
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Graph (trivial) has 818 edges and 868 vertex of which 242 / 868 are part of one of the 19 SCC in 2 ms
Free SCC test removed 223 places
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 174 place count 644 transition count 926
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 203 rules applied. Total rules applied 377 place count 471 transition count 896
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 397 place count 452 transition count 895
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 398 place count 451 transition count 895
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 398 place count 451 transition count 839
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 510 place count 395 transition count 839
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 548 place count 357 transition count 707
Iterating global reduction 4 with 38 rules applied. Total rules applied 586 place count 357 transition count 707
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 590 place count 357 transition count 703
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 590 place count 357 transition count 699
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 598 place count 353 transition count 699
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 599 place count 352 transition count 692
Iterating global reduction 5 with 1 rules applied. Total rules applied 600 place count 352 transition count 692
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 601 place count 352 transition count 691
Performed 127 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 6 with 254 rules applied. Total rules applied 855 place count 225 transition count 560
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 860 place count 225 transition count 555
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 872 place count 213 transition count 483
Iterating global reduction 7 with 12 rules applied. Total rules applied 884 place count 213 transition count 483
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 895 place count 213 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 897 place count 212 transition count 471
Performed 17 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 931 place count 195 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 932 place count 195 transition count 550
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 937 place count 190 transition count 504
Iterating global reduction 9 with 5 rules applied. Total rules applied 942 place count 190 transition count 504
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 959 place count 190 transition count 487
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 979 place count 190 transition count 467
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 986 place count 183 transition count 453
Iterating global reduction 10 with 7 rules applied. Total rules applied 993 place count 183 transition count 453
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1000 place count 176 transition count 402
Iterating global reduction 10 with 7 rules applied. Total rules applied 1007 place count 176 transition count 402
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1014 place count 176 transition count 395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1015 place count 175 transition count 394
Applied a total of 1015 rules in 150 ms. Remains 175 /868 variables (removed 693) and now considering 394/1342 (removed 948) transitions.
[2024-05-22 01:24:49] [INFO ] Flow matrix only has 378 transitions (discarded 16 similar events)
// Phase 1: matrix 378 rows 175 cols
[2024-05-22 01:24:49] [INFO ] Computed 52 invariants in 2 ms
[2024-05-22 01:24:49] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-22 01:24:50] [INFO ] Flow matrix only has 378 transitions (discarded 16 similar events)
[2024-05-22 01:24:50] [INFO ] Invariant cache hit.
[2024-05-22 01:24:50] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-22 01:24:50] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-05-22 01:24:50] [INFO ] Redundant transitions in 3 ms returned []
Running 348 sub problems to find dead transitions.
[2024-05-22 01:24:50] [INFO ] Flow matrix only has 378 transitions (discarded 16 similar events)
[2024-05-22 01:24:50] [INFO ] Invariant cache hit.
[2024-05-22 01:24:50] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 2/175 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 377/552 variables, 175/227 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 28/255 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/552 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/553 variables, and 255 constraints, problems are : Problem set: 0 solved, 348 unsolved in 23032 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 175/175 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 2/175 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 377/552 variables, 175/227 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 28/255 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 348/603 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (OVERLAPS) 0/552 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/553 variables, and 603 constraints, problems are : Problem set: 0 solved, 348 unsolved in 23202 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 175/175 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
After SMT, in 46343ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 46346ms
Starting structural reductions in SI_LTL mode, iteration 1 : 175/868 places, 394/1342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47126 ms. Remains : 175/868 places, 394/1342 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-15 finished in 47314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F((p1&&X(p1)))))))'
Found a Shortening insensitive property : DLCround-PT-03b-LTLFireability-13
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 868 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 868/868 places, 1342/1342 transitions.
Graph (trivial) has 823 edges and 868 vertex of which 257 / 868 are part of one of the 20 SCC in 1 ms
Free SCC test removed 237 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 630 transition count 914
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 200 rules applied. Total rules applied 369 place count 462 transition count 882
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 389 place count 442 transition count 882
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 389 place count 442 transition count 827
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 499 place count 387 transition count 827
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 538 place count 348 transition count 689
Iterating global reduction 3 with 39 rules applied. Total rules applied 577 place count 348 transition count 689
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 580 place count 348 transition count 686
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 580 place count 348 transition count 682
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 588 place count 344 transition count 682
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 589 place count 343 transition count 675
Iterating global reduction 4 with 1 rules applied. Total rules applied 590 place count 343 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 591 place count 343 transition count 674
Performed 122 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 5 with 244 rules applied. Total rules applied 835 place count 221 transition count 548
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 839 place count 221 transition count 544
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 851 place count 209 transition count 475
Iterating global reduction 6 with 12 rules applied. Total rules applied 863 place count 209 transition count 475
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 874 place count 209 transition count 464
Performed 16 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 906 place count 193 transition count 541
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 910 place count 189 transition count 503
Iterating global reduction 7 with 4 rules applied. Total rules applied 914 place count 189 transition count 503
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 931 place count 189 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 935 place count 189 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 936 place count 188 transition count 481
Applied a total of 936 rules in 115 ms. Remains 188 /868 variables (removed 680) and now considering 481/1342 (removed 861) transitions.
[2024-05-22 01:25:37] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
// Phase 1: matrix 457 rows 188 cols
[2024-05-22 01:25:37] [INFO ] Computed 52 invariants in 8 ms
[2024-05-22 01:25:37] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 01:25:37] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2024-05-22 01:25:37] [INFO ] Invariant cache hit.
[2024-05-22 01:25:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-22 01:25:37] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2024-05-22 01:25:37] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2024-05-22 01:25:37] [INFO ] Invariant cache hit.
[2024-05-22 01:25:37] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/644 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 30/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (OVERLAPS) 0/644 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/645 variables, and 270 constraints, problems are : Problem set: 0 solved, 424 unsolved in 28822 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 188/188 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/644 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 30/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 424/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/645 variables, and 694 constraints, problems are : Problem set: 0 solved, 424 unsolved in 26944 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 188/188 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
After SMT, in 55983ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 55989ms
Starting structural reductions in LI_LTL mode, iteration 1 : 188/868 places, 481/1342 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56758 ms. Remains : 188/868 places, 481/1342 transitions.
Running random walk in product with property : DLCround-PT-03b-LTLFireability-13
Product exploration explored 100000 steps with 33209 reset in 635 ms.
Product exploration explored 100000 steps with 33405 reset in 687 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 627 steps (0 resets) in 16 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 481/481 transitions.
Applied a total of 0 rules in 1 ms. Remains 188 /188 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-22 01:26:35] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2024-05-22 01:26:35] [INFO ] Invariant cache hit.
[2024-05-22 01:26:36] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-22 01:26:36] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2024-05-22 01:26:36] [INFO ] Invariant cache hit.
[2024-05-22 01:26:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-22 01:26:36] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2024-05-22 01:26:36] [INFO ] Flow matrix only has 457 transitions (discarded 24 similar events)
[2024-05-22 01:26:36] [INFO ] Invariant cache hit.
[2024-05-22 01:26:36] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/644 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 30/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (OVERLAPS) 0/644 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/645 variables, and 270 constraints, problems are : Problem set: 0 solved, 424 unsolved in 26884 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 188/188 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/644 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 30/270 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 424/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/645 variables, and 694 constraints, problems are : Problem set: 0 solved, 424 unsolved in 26535 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 188/188 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
After SMT, in 53572ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 53575ms
Finished structural reductions in LTL mode , in 1 iterations and 54235 ms. Remains : 188/188 places, 481/481 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 570 steps (0 resets) in 9 ms. (57 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33463 reset in 830 ms.
Product exploration explored 100000 steps with 33333 reset in 583 ms.
Built C files in :
/tmp/ltsmin1038289902864791417
[2024-05-22 01:27:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1038289902864791417
Running compilation step : cd /tmp/ltsmin1038289902864791417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1567 ms.
Running link step : cd /tmp/ltsmin1038289902864791417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1038289902864791417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased419375057160989800.hoa' '--buchi-type=spotba'
LTSmin run took 5771 ms.
Treatment of property DLCround-PT-03b-LTLFireability-13 finished in 123002 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-22 01:27:39] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13865978982122635175
[2024-05-22 01:27:39] [INFO ] Computing symmetric may disable matrix : 1342 transitions.
[2024-05-22 01:27:39] [INFO ] Applying decomposition
[2024-05-22 01:27:39] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:27:39] [INFO ] Computing symmetric may enable matrix : 1342 transitions.
[2024-05-22 01:27:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:27:40] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5409871695148788548.txt' '-o' '/tmp/graph5409871695148788548.bin' '-w' '/tmp/graph5409871695148788548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5409871695148788548.bin' '-l' '-1' '-v' '-w' '/tmp/graph5409871695148788548.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:27:40] [INFO ] Decomposing Gal with order
[2024-05-22 01:27:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:27:40] [INFO ] Removed a total of 992 redundant transitions.
[2024-05-22 01:27:40] [INFO ] Computing Do-Not-Accords matrix : 1342 transitions.
[2024-05-22 01:27:40] [INFO ] Flatten gal took : 119 ms
[2024-05-22 01:27:40] [INFO ] Computation of Completed DNA matrix. took 84 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 33 ms.
[2024-05-22 01:27:40] [INFO ] Built C files in 516ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13865978982122635175
Running compilation step : cd /tmp/ltsmin13865978982122635175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 01:27:40] [INFO ] Time to serialize gal into /tmp/LTLFireability1009282503935545252.gal : 18 ms
[2024-05-22 01:27:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16285627770097751425.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1009282503935545252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16285627770097751425.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("((i7.u128.p564==0)||(i9.i1.i3.u321.p1336==0))")&&(G(F(("(i0.i1.i2.u10.p24!=1)")&&(X("(i0.i1.i2.u10.p24!=1)"))))))))
Formula 0 simplified : FG(!"(i0.i1.i2.u10.p24!=1)" | X!"(i0.i1.i2.u10.p24!=1)") | G!"((i7.u128.p564==0)||(i9.i1.i3.u321.p1336==0))"
Compilation finished in 8676 ms.
Running link step : cd /tmp/ltsmin13865978982122635175;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin13865978982122635175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](<>(((LTLAPp1==true)&&X((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 01:52:22] [INFO ] Applying decomposition
[2024-05-22 01:52:22] [INFO ] Flatten gal took : 88 ms
[2024-05-22 01:52:22] [INFO ] Decomposing Gal with order
[2024-05-22 01:52:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:52:23] [INFO ] Removed a total of 760 redundant transitions.
[2024-05-22 01:52:23] [INFO ] Flatten gal took : 130 ms
[2024-05-22 01:52:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2197 labels/synchronizations in 517 ms.
[2024-05-22 01:52:23] [INFO ] Time to serialize gal into /tmp/LTLFireability577116790299249637.gal : 16 ms
[2024-05-22 01:52:23] [INFO ] Time to serialize properties into /tmp/LTLFireability10707056597827554853.ltl : 9 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability577116790299249637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10707056597827554853.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("((i0.i0.i0.u13.p564==0)||(i1.i0.i0.i0.i0.u98.p1336==0))")&&(G(F(("(i0.i0.i0.i0.i0.i0.i0.u8.p24!=1)")&&(X("(i0.i0.i0.i0.i0.i0.i0...175
Formula 0 simplified : FG(!"(i0.i0.i0.i0.i0.i0.i0.u8.p24!=1)" | X!"(i0.i0.i0.i0.i0.i0.i0.u8.p24!=1)") | G!"((i0.i0.i0.u13.p564==0)||(i1.i0.i0.i0.i0.u98.p13...163
ITS-tools command line returned an error code 137
[2024-05-22 02:09:05] [INFO ] Flatten gal took : 108 ms
[2024-05-22 02:09:06] [INFO ] Input system was already deterministic with 1342 transitions.
[2024-05-22 02:09:06] [INFO ] Transformed 868 places.
[2024-05-22 02:09:06] [INFO ] Transformed 1342 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
[2024-05-22 02:09:06] [INFO ] Time to serialize gal into /tmp/LTLFireability8968265403643165619.gal : 7 ms
[2024-05-22 02:09:06] [INFO ] Time to serialize properties into /tmp/LTLFireability4200235431563075228.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8968265403643165619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4200235431563075228.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("((p564==0)||(p1336==0))")&&(G(F(("(p24!=1)")&&(X("(p24!=1)"))))))))
Formula 0 simplified : FG(!"(p24!=1)" | X!"(p24!=1)") | G!"((p564==0)||(p1336==0))"

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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DLCround-PT-03b, 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 r114-smll-171624275300124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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