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.r021-smll-171620127800062.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 gold2023
Input is ASLink-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127800062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 921K 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 ASLink-PT-06b-LTLCardinality-00
FORMULA_NAME ASLink-PT-06b-LTLCardinality-01
FORMULA_NAME ASLink-PT-06b-LTLCardinality-02
FORMULA_NAME ASLink-PT-06b-LTLCardinality-03
FORMULA_NAME ASLink-PT-06b-LTLCardinality-04
FORMULA_NAME ASLink-PT-06b-LTLCardinality-05
FORMULA_NAME ASLink-PT-06b-LTLCardinality-06
FORMULA_NAME ASLink-PT-06b-LTLCardinality-07
FORMULA_NAME ASLink-PT-06b-LTLCardinality-08
FORMULA_NAME ASLink-PT-06b-LTLCardinality-09
FORMULA_NAME ASLink-PT-06b-LTLCardinality-10
FORMULA_NAME ASLink-PT-06b-LTLCardinality-11
FORMULA_NAME ASLink-PT-06b-LTLCardinality-12
FORMULA_NAME ASLink-PT-06b-LTLCardinality-13
FORMULA_NAME ASLink-PT-06b-LTLCardinality-14
FORMULA_NAME ASLink-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716427273434

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 01:21:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 01:21:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:21:16] [INFO ] Load time of PNML (sax parser for PT used): 349 ms
[2024-05-23 01:21:16] [INFO ] Transformed 2826 places.
[2024-05-23 01:21:16] [INFO ] Transformed 3513 transitions.
[2024-05-23 01:21:16] [INFO ] Found NUPN structural information;
[2024-05-23 01:21:16] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 538 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-06b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-06b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 2826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Discarding 171 places :
Symmetric choice reduction at 0 with 171 rule applications. Total rules 171 place count 2655 transition count 3342
Iterating global reduction 0 with 171 rules applied. Total rules applied 342 place count 2655 transition count 3342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 343 place count 2655 transition count 3341
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 409 place count 2589 transition count 3237
Iterating global reduction 1 with 66 rules applied. Total rules applied 475 place count 2589 transition count 3237
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 494 place count 2589 transition count 3218
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 504 place count 2579 transition count 3208
Iterating global reduction 2 with 10 rules applied. Total rules applied 514 place count 2579 transition count 3208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 517 place count 2576 transition count 3198
Iterating global reduction 2 with 3 rules applied. Total rules applied 520 place count 2576 transition count 3198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 522 place count 2574 transition count 3196
Iterating global reduction 2 with 2 rules applied. Total rules applied 524 place count 2574 transition count 3196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 526 place count 2572 transition count 3187
Iterating global reduction 2 with 2 rules applied. Total rules applied 528 place count 2572 transition count 3187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 529 place count 2571 transition count 3179
Iterating global reduction 2 with 1 rules applied. Total rules applied 530 place count 2571 transition count 3179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 531 place count 2570 transition count 3178
Iterating global reduction 2 with 1 rules applied. Total rules applied 532 place count 2570 transition count 3178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 533 place count 2569 transition count 3170
Iterating global reduction 2 with 1 rules applied. Total rules applied 534 place count 2569 transition count 3170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 535 place count 2568 transition count 3162
Iterating global reduction 2 with 1 rules applied. Total rules applied 536 place count 2568 transition count 3162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 537 place count 2567 transition count 3161
Iterating global reduction 2 with 1 rules applied. Total rules applied 538 place count 2567 transition count 3161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 539 place count 2566 transition count 3153
Iterating global reduction 2 with 1 rules applied. Total rules applied 540 place count 2566 transition count 3153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 541 place count 2565 transition count 3145
Iterating global reduction 2 with 1 rules applied. Total rules applied 542 place count 2565 transition count 3145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 543 place count 2564 transition count 3144
Iterating global reduction 2 with 1 rules applied. Total rules applied 544 place count 2564 transition count 3144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 545 place count 2563 transition count 3136
Iterating global reduction 2 with 1 rules applied. Total rules applied 546 place count 2563 transition count 3136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 547 place count 2562 transition count 3128
Iterating global reduction 2 with 1 rules applied. Total rules applied 548 place count 2562 transition count 3128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 549 place count 2561 transition count 3127
Iterating global reduction 2 with 1 rules applied. Total rules applied 550 place count 2561 transition count 3127
Applied a total of 550 rules in 4781 ms. Remains 2561 /2826 variables (removed 265) and now considering 3127/3513 (removed 386) transitions.
// Phase 1: matrix 3127 rows 2561 cols
[2024-05-23 01:21:22] [INFO ] Computed 277 invariants in 296 ms
[2024-05-23 01:21:24] [INFO ] Implicit Places using invariants in 2285 ms returned []
[2024-05-23 01:21:24] [INFO ] Invariant cache hit.
[2024-05-23 01:21:26] [INFO ] Implicit Places using invariants and state equation in 2620 ms returned []
Implicit Place search using SMT with State Equation took 4948 ms to find 0 implicit places.
[2024-05-23 01:21:26] [INFO ] Invariant cache hit.
[2024-05-23 01:21:30] [INFO ] Dead Transitions using invariants and state equation in 3711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2561/2826 places, 3127/3513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13444 ms. Remains : 2561/2826 places, 3127/3513 transitions.
Support contains 22 out of 2561 places after structural reductions.
[2024-05-23 01:21:31] [INFO ] Flatten gal took : 358 ms
[2024-05-23 01:21:31] [INFO ] Flatten gal took : 230 ms
[2024-05-23 01:21:31] [INFO ] Input system was already deterministic with 3127 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-23 01:21:32] [INFO ] Invariant cache hit.
[2024-05-23 01:21:33] [INFO ] [Real]Absence check using 67 positive place invariants in 77 ms returned sat
[2024-05-23 01:21:33] [INFO ] [Real]Absence check using 67 positive and 210 generalized place invariants in 291 ms returned sat
[2024-05-23 01:21:36] [INFO ] After 3921ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 01:21:37] [INFO ] [Nat]Absence check using 67 positive place invariants in 42 ms returned sat
[2024-05-23 01:21:37] [INFO ] [Nat]Absence check using 67 positive and 210 generalized place invariants in 166 ms returned sat
[2024-05-23 01:21:42] [INFO ] After 4840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 01:21:44] [INFO ] Deduced a trap composed of 84 places in 1073 ms of which 6 ms to minimize.
[2024-05-23 01:21:45] [INFO ] Deduced a trap composed of 85 places in 962 ms of which 7 ms to minimize.
[2024-05-23 01:21:46] [INFO ] Deduced a trap composed of 67 places in 1564 ms of which 2 ms to minimize.
[2024-05-23 01:21:48] [INFO ] Deduced a trap composed of 78 places in 1275 ms of which 4 ms to minimize.
[2024-05-23 01:21:49] [INFO ] Deduced a trap composed of 107 places in 1418 ms of which 2 ms to minimize.
[2024-05-23 01:21:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 7287 ms
[2024-05-23 01:21:51] [INFO ] Deduced a trap composed of 22 places in 894 ms of which 2 ms to minimize.
[2024-05-23 01:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1355 ms
[2024-05-23 01:21:53] [INFO ] Deduced a trap composed of 49 places in 1292 ms of which 3 ms to minimize.
[2024-05-23 01:21:54] [INFO ] Deduced a trap composed of 69 places in 1197 ms of which 1 ms to minimize.
[2024-05-23 01:21:55] [INFO ] Deduced a trap composed of 104 places in 868 ms of which 2 ms to minimize.
[2024-05-23 01:21:56] [INFO ] Deduced a trap composed of 62 places in 923 ms of which 1 ms to minimize.
[2024-05-23 01:21:58] [INFO ] Deduced a trap composed of 141 places in 971 ms of which 2 ms to minimize.
[2024-05-23 01:21:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 6376 ms
[2024-05-23 01:22:00] [INFO ] Deduced a trap composed of 46 places in 1265 ms of which 2 ms to minimize.
[2024-05-23 01:22:02] [INFO ] Deduced a trap composed of 66 places in 1183 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 01:22:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 01:22:02] [INFO ] After 25547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 1 properties in 1130 ms.
Support contains 9 out of 2561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Drop transitions removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 0 with 469 rules applied. Total rules applied 469 place count 2561 transition count 2658
Reduce places removed 469 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 476 rules applied. Total rules applied 945 place count 2092 transition count 2651
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 950 place count 2088 transition count 2650
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 951 place count 2087 transition count 2650
Performed 683 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 683 Pre rules applied. Total rules applied 951 place count 2087 transition count 1967
Deduced a syphon composed of 683 places in 7 ms
Ensure Unique test removed 63 places
Reduce places removed 746 places and 0 transitions.
Iterating global reduction 4 with 1429 rules applied. Total rules applied 2380 place count 1341 transition count 1967
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2426 place count 1335 transition count 1927
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2466 place count 1295 transition count 1927
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2466 place count 1295 transition count 1903
Deduced a syphon composed of 24 places in 6 ms
Ensure Unique test removed 23 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 71 rules applied. Total rules applied 2537 place count 1248 transition count 1903
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 2537 place count 1248 transition count 1881
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 2581 place count 1226 transition count 1881
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2582 place count 1225 transition count 1873
Iterating global reduction 6 with 1 rules applied. Total rules applied 2583 place count 1225 transition count 1873
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2584 place count 1224 transition count 1865
Iterating global reduction 6 with 1 rules applied. Total rules applied 2585 place count 1224 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2586 place count 1223 transition count 1857
Iterating global reduction 6 with 1 rules applied. Total rules applied 2587 place count 1223 transition count 1857
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2588 place count 1222 transition count 1849
Iterating global reduction 6 with 1 rules applied. Total rules applied 2589 place count 1222 transition count 1849
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2590 place count 1221 transition count 1841
Iterating global reduction 6 with 1 rules applied. Total rules applied 2591 place count 1221 transition count 1841
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2592 place count 1220 transition count 1833
Iterating global reduction 6 with 1 rules applied. Total rules applied 2593 place count 1220 transition count 1833
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2594 place count 1219 transition count 1825
Iterating global reduction 6 with 1 rules applied. Total rules applied 2595 place count 1219 transition count 1825
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 6 with 391 rules applied. Total rules applied 2986 place count 1023 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2987 place count 1022 transition count 1629
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 2989 place count 1021 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2990 place count 1020 transition count 1628
Iterating global reduction 6 with 1 rules applied. Total rules applied 2991 place count 1020 transition count 1628
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 2993 place count 1020 transition count 1626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2994 place count 1019 transition count 1626
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2996 place count 1018 transition count 1635
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 3003 place count 1018 transition count 1628
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 3010 place count 1011 transition count 1628
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 3015 place count 1011 transition count 1623
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3020 place count 1006 transition count 1623
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 3026 place count 1006 transition count 1623
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3027 place count 1005 transition count 1622
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 3045 place count 993 transition count 1616
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3051 place count 987 transition count 1616
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3051 place count 987 transition count 1598
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3088 place count 968 transition count 1598
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 12 with 8 rules applied. Total rules applied 3096 place count 960 transition count 1598
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3096 place count 960 transition count 1597
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3098 place count 959 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3099 place count 958 transition count 1596
Iterating global reduction 13 with 1 rules applied. Total rules applied 3100 place count 958 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3101 place count 957 transition count 1595
Iterating global reduction 13 with 1 rules applied. Total rules applied 3102 place count 957 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3103 place count 956 transition count 1594
Iterating global reduction 13 with 1 rules applied. Total rules applied 3104 place count 956 transition count 1594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3105 place count 956 transition count 1593
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 14 with 24 rules applied. Total rules applied 3129 place count 944 transition count 1581
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 3134 place count 939 transition count 1576
Iterating global reduction 14 with 5 rules applied. Total rules applied 3139 place count 939 transition count 1576
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3145 place count 939 transition count 1570
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3151 place count 933 transition count 1570
Applied a total of 3151 rules in 1553 ms. Remains 933 /2561 variables (removed 1628) and now considering 1570/3127 (removed 1557) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1554 ms. Remains : 933/2561 places, 1570/3127 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 184993 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184993 steps, saw 41229 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1570 rows 933 cols
[2024-05-23 01:22:08] [INFO ] Computed 162 invariants in 87 ms
[2024-05-23 01:22:08] [INFO ] [Real]Absence check using 42 positive place invariants in 25 ms returned sat
[2024-05-23 01:22:08] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 71 ms returned sat
[2024-05-23 01:22:09] [INFO ] After 1484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 01:22:10] [INFO ] [Nat]Absence check using 42 positive place invariants in 17 ms returned sat
[2024-05-23 01:22:10] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 46 ms returned sat
[2024-05-23 01:22:11] [INFO ] After 1662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 01:22:12] [INFO ] Deduced a trap composed of 84 places in 341 ms of which 1 ms to minimize.
[2024-05-23 01:22:12] [INFO ] Deduced a trap composed of 97 places in 355 ms of which 1 ms to minimize.
[2024-05-23 01:22:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 892 ms
[2024-05-23 01:22:13] [INFO ] After 3347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 756 ms.
[2024-05-23 01:22:14] [INFO ] After 4481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 254 ms.
Support contains 9 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1570/1570 transitions.
Applied a total of 0 rules in 54 ms. Remains 933 /933 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 933/933 places, 1570/1570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1570/1570 transitions.
Applied a total of 0 rules in 52 ms. Remains 933 /933 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
[2024-05-23 01:22:14] [INFO ] Invariant cache hit.
[2024-05-23 01:22:16] [INFO ] Implicit Places using invariants in 1697 ms returned [1, 18, 19, 31, 48, 66, 102, 141, 145, 154, 155, 157, 174, 193, 262, 266, 267, 278, 279, 281, 298, 316, 387, 391, 392, 403, 404, 406, 423, 441, 463, 481, 515, 516, 527, 528, 530, 547, 565, 634, 638, 639, 650, 651, 653, 670, 688, 757, 761, 762, 765, 777, 778, 779, 797, 799, 803, 821, 822, 823, 824, 836, 842, 848, 854, 860, 866, 872, 878, 884, 890, 896]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1702 ms to find 72 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 861/933 places, 1570/1570 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 861 transition count 1447
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 132 rules applied. Total rules applied 255 place count 738 transition count 1438
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 260 place count 733 transition count 1438
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 260 place count 733 transition count 1407
Deduced a syphon composed of 31 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 323 place count 701 transition count 1407
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 335 place count 697 transition count 1399
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 343 place count 689 transition count 1399
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 357 place count 675 transition count 1385
Iterating global reduction 5 with 14 rules applied. Total rules applied 371 place count 675 transition count 1385
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 374 place count 675 transition count 1382
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 377 place count 672 transition count 1376
Iterating global reduction 6 with 3 rules applied. Total rules applied 380 place count 672 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 381 place count 671 transition count 1375
Iterating global reduction 6 with 1 rules applied. Total rules applied 382 place count 671 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 383 place count 670 transition count 1373
Iterating global reduction 6 with 1 rules applied. Total rules applied 384 place count 670 transition count 1373
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 472 place count 626 transition count 1329
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 477 place count 621 transition count 1324
Iterating global reduction 6 with 5 rules applied. Total rules applied 482 place count 621 transition count 1324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 487 place count 621 transition count 1319
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 491 place count 619 transition count 1320
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 505 place count 619 transition count 1306
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 520 place count 604 transition count 1306
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 539 place count 604 transition count 1306
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 540 place count 604 transition count 1305
Applied a total of 540 rules in 611 ms. Remains 604 /861 variables (removed 257) and now considering 1305/1570 (removed 265) transitions.
// Phase 1: matrix 1305 rows 604 cols
[2024-05-23 01:22:17] [INFO ] Computed 84 invariants in 67 ms
[2024-05-23 01:22:17] [INFO ] Implicit Places using invariants in 845 ms returned [73, 92, 98, 101, 103, 107, 108, 162, 178, 184, 187, 189, 194, 195, 248, 265, 271, 274, 277, 282, 283, 353, 359, 362, 364, 369, 370, 423, 439, 445, 448, 450, 455, 456, 509, 525, 531, 534, 536]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 849 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 565/933 places, 1305/1570 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 565 transition count 1304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 564 transition count 1304
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 19 place count 547 transition count 1287
Iterating global reduction 2 with 17 rules applied. Total rules applied 36 place count 547 transition count 1287
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 542 transition count 1282
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 542 transition count 1282
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 531 transition count 1271
Free-agglomeration rule applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 86 place count 531 transition count 1253
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 104 place count 513 transition count 1253
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 109 place count 513 transition count 1248
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 114 place count 508 transition count 1248
Applied a total of 114 rules in 166 ms. Remains 508 /565 variables (removed 57) and now considering 1248/1305 (removed 57) transitions.
// Phase 1: matrix 1248 rows 508 cols
[2024-05-23 01:22:18] [INFO ] Computed 45 invariants in 19 ms
[2024-05-23 01:22:18] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-05-23 01:22:18] [INFO ] Invariant cache hit.
[2024-05-23 01:22:20] [INFO ] Implicit Places using invariants and state equation in 1387 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 508/933 places, 1248/1570 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5494 ms. Remains : 508/933 places, 1248/1570 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 141609 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{4=1}
Probabilistic random walk after 141609 steps, saw 85063 distinct states, run finished after 3005 ms. (steps per millisecond=47 ) properties seen :1
Running SMT prover for 4 properties.
[2024-05-23 01:22:23] [INFO ] Invariant cache hit.
[2024-05-23 01:22:23] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-23 01:22:23] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 21 ms returned sat
[2024-05-23 01:22:23] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 01:22:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 01:22:24] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-23 01:22:25] [INFO ] After 1076ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:22:25] [INFO ] After 1452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 225 ms.
[2024-05-23 01:22:25] [INFO ] After 1855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 281 ms.
Support contains 7 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 1248/1248 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 505 transition count 1245
Applied a total of 6 rules in 69 ms. Remains 505 /508 variables (removed 3) and now considering 1245/1248 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 505/508 places, 1245/1248 transitions.
Incomplete random walk after 10000 steps, including 183 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 151853 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151853 steps, saw 90613 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1245 rows 505 cols
[2024-05-23 01:22:29] [INFO ] Computed 45 invariants in 20 ms
[2024-05-23 01:22:29] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 01:22:29] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 21 ms returned sat
[2024-05-23 01:22:29] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 01:22:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 01:22:29] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 22 ms returned sat
[2024-05-23 01:22:31] [INFO ] After 956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:22:31] [INFO ] After 1246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 166 ms.
[2024-05-23 01:22:31] [INFO ] After 1610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 209 ms.
Support contains 7 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1245/1245 transitions.
Applied a total of 0 rules in 35 ms. Remains 505 /505 variables (removed 0) and now considering 1245/1245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 505/505 places, 1245/1245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1245/1245 transitions.
Applied a total of 0 rules in 34 ms. Remains 505 /505 variables (removed 0) and now considering 1245/1245 (removed 0) transitions.
[2024-05-23 01:22:31] [INFO ] Invariant cache hit.
[2024-05-23 01:22:32] [INFO ] Implicit Places using invariants in 936 ms returned []
[2024-05-23 01:22:32] [INFO ] Invariant cache hit.
[2024-05-23 01:22:34] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3209 ms to find 0 implicit places.
[2024-05-23 01:22:35] [INFO ] Redundant transitions in 190 ms returned []
[2024-05-23 01:22:35] [INFO ] Invariant cache hit.
[2024-05-23 01:22:36] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4648 ms. Remains : 505/505 places, 1245/1245 transitions.
Applied a total of 0 rules in 21 ms. Remains 505 /505 variables (removed 0) and now considering 1245/1245 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-23 01:22:36] [INFO ] Invariant cache hit.
[2024-05-23 01:22:36] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 01:22:36] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-23 01:22:36] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 01:22:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-23 01:22:36] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-23 01:22:37] [INFO ] After 1064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:22:38] [INFO ] After 1334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 234 ms.
[2024-05-23 01:22:38] [INFO ] After 1823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 101 stabilizing places and 101 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(X(p1)||G(p0))))))'
Support contains 3 out of 2561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2557 transition count 3116
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2557 transition count 3116
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 2554 transition count 3106
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 2554 transition count 3106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2554 transition count 3105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 2552 transition count 3103
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 2552 transition count 3103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2550 transition count 3094
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2550 transition count 3094
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2549 transition count 3086
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2549 transition count 3086
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2548 transition count 3085
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2548 transition count 3085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2547 transition count 3077
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2547 transition count 3077
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2546 transition count 3069
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2546 transition count 3069
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2545 transition count 3068
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2545 transition count 3068
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 2544 transition count 3060
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 2544 transition count 3060
Applied a total of 35 rules in 2812 ms. Remains 2544 /2561 variables (removed 17) and now considering 3060/3127 (removed 67) transitions.
// Phase 1: matrix 3060 rows 2544 cols
[2024-05-23 01:22:41] [INFO ] Computed 277 invariants in 42 ms
[2024-05-23 01:22:43] [INFO ] Implicit Places using invariants in 2304 ms returned []
[2024-05-23 01:22:43] [INFO ] Invariant cache hit.
[2024-05-23 01:22:45] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 4157 ms to find 0 implicit places.
[2024-05-23 01:22:45] [INFO ] Invariant cache hit.
[2024-05-23 01:22:49] [INFO ] Dead Transitions using invariants and state equation in 3562 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2544/2561 places, 3060/3127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10533 ms. Remains : 2544/2561 places, 3060/3127 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 310 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1005 0), p1:(AND (EQ s724 0) (EQ s2386 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 202 reset in 740 ms.
Product exploration explored 100000 steps with 199 reset in 504 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 1058 steps, including 2 resets, run visited all 3 properties in 22 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2544/2544 places, 3060/3060 transitions.
Applied a total of 0 rules in 329 ms. Remains 2544 /2544 variables (removed 0) and now considering 3060/3060 (removed 0) transitions.
[2024-05-23 01:22:51] [INFO ] Invariant cache hit.
[2024-05-23 01:22:53] [INFO ] Implicit Places using invariants in 1849 ms returned [2378, 2389, 2400, 2408, 2416, 2424, 2432, 2443, 2451, 2459, 2470]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1852 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2533/2544 places, 3060/3060 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2520 transition count 3047
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2520 transition count 3047
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 2509 transition count 3036
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 2509 transition count 3036
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 2500 transition count 3027
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 2500 transition count 3027
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 2496 transition count 3023
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 2496 transition count 3023
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 2494 transition count 3021
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 2494 transition count 3021
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 2492 transition count 3019
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 2492 transition count 3019
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 2490 transition count 3017
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 2490 transition count 3017
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 2488 transition count 3015
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 2488 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2487 transition count 3014
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2487 transition count 3014
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 2486 transition count 3013
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 2486 transition count 3013
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 2485 transition count 3012
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 2485 transition count 3012
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 2484 transition count 3011
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 2484 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 2483 transition count 3010
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 2483 transition count 3010
Applied a total of 100 rules in 2951 ms. Remains 2483 /2533 variables (removed 50) and now considering 3010/3060 (removed 50) transitions.
// Phase 1: matrix 3010 rows 2483 cols
[2024-05-23 01:22:56] [INFO ] Computed 266 invariants in 43 ms
[2024-05-23 01:22:58] [INFO ] Implicit Places using invariants in 1882 ms returned []
[2024-05-23 01:22:58] [INFO ] Invariant cache hit.
[2024-05-23 01:23:09] [INFO ] Implicit Places using invariants and state equation in 11058 ms returned []
Implicit Place search using SMT with State Equation took 12942 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2483/2544 places, 3010/3060 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18075 ms. Remains : 2483/2544 places, 3010/3060 transitions.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 1558 steps, including 2 resets, run visited all 3 properties in 46 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 205 reset in 583 ms.
Product exploration explored 100000 steps with 192 reset in 470 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2483/2483 places, 3010/3010 transitions.
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 2483 transition count 3010
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 448 place count 2483 transition count 3009
Performed 452 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 452 Pre rules applied. Total rules applied 448 place count 2483 transition count 3119
Deduced a syphon composed of 899 places in 13 ms
Iterating global reduction 2 with 452 rules applied. Total rules applied 900 place count 2483 transition count 3119
Discarding 246 places :
Symmetric choice reduction at 2 with 246 rule applications. Total rules 1146 place count 2237 transition count 2873
Deduced a syphon composed of 653 places in 8 ms
Iterating global reduction 2 with 246 rules applied. Total rules applied 1392 place count 2237 transition count 2873
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1392 place count 2237 transition count 2878
Deduced a syphon composed of 658 places in 8 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 1397 place count 2237 transition count 2878
Performed 427 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1085 places in 5 ms
Iterating global reduction 2 with 427 rules applied. Total rules applied 1824 place count 2237 transition count 2879
Discarding 167 places :
Symmetric choice reduction at 2 with 167 rule applications. Total rules 1991 place count 2070 transition count 2710
Deduced a syphon composed of 921 places in 5 ms
Iterating global reduction 2 with 167 rules applied. Total rules applied 2158 place count 2070 transition count 2710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2159 place count 2069 transition count 2708
Deduced a syphon composed of 921 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2160 place count 2069 transition count 2708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2162 place count 2069 transition count 2706
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 958 places in 5 ms
Iterating global reduction 3 with 37 rules applied. Total rules applied 2199 place count 2069 transition count 2832
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2209 place count 2059 transition count 2810
Deduced a syphon composed of 948 places in 6 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 2219 place count 2059 transition count 2810
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 949 places in 5 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2220 place count 2059 transition count 2812
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2221 place count 2058 transition count 2810
Deduced a syphon composed of 948 places in 4 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2222 place count 2058 transition count 2810
Deduced a syphon composed of 948 places in 5 ms
Applied a total of 2222 rules in 2100 ms. Remains 2058 /2483 variables (removed 425) and now considering 2810/3010 (removed 200) transitions.
[2024-05-23 01:23:14] [INFO ] Redundant transitions in 145 ms returned []
// Phase 1: matrix 2810 rows 2058 cols
[2024-05-23 01:23:14] [INFO ] Computed 266 invariants in 58 ms
[2024-05-23 01:23:18] [INFO ] Dead Transitions using invariants and state equation in 3925 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2058/2483 places, 2810/3010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6185 ms. Remains : 2058/2483 places, 2810/3010 transitions.
Built C files in :
/tmp/ltsmin2499622508846378031
[2024-05-23 01:23:18] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2499622508846378031
Running compilation step : cd /tmp/ltsmin2499622508846378031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2499622508846378031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2499622508846378031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3010/3010 transitions.
Applied a total of 0 rules in 179 ms. Remains 2483 /2483 variables (removed 0) and now considering 3010/3010 (removed 0) transitions.
// Phase 1: matrix 3010 rows 2483 cols
[2024-05-23 01:23:21] [INFO ] Computed 266 invariants in 40 ms
[2024-05-23 01:23:23] [INFO ] Implicit Places using invariants in 1732 ms returned []
[2024-05-23 01:23:23] [INFO ] Invariant cache hit.
[2024-05-23 01:23:26] [INFO ] Implicit Places using invariants and state equation in 2864 ms returned []
Implicit Place search using SMT with State Equation took 4596 ms to find 0 implicit places.
[2024-05-23 01:23:26] [INFO ] Invariant cache hit.
[2024-05-23 01:23:29] [INFO ] Dead Transitions using invariants and state equation in 2798 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7575 ms. Remains : 2483/2483 places, 3010/3010 transitions.
Built C files in :
/tmp/ltsmin13544649039320957879
[2024-05-23 01:23:29] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13544649039320957879
Running compilation step : cd /tmp/ltsmin13544649039320957879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13544649039320957879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13544649039320957879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 01:23:32] [INFO ] Flatten gal took : 112 ms
[2024-05-23 01:23:32] [INFO ] Flatten gal took : 111 ms
[2024-05-23 01:23:32] [INFO ] Time to serialize gal into /tmp/LTL16955832738787411662.gal : 30 ms
[2024-05-23 01:23:32] [INFO ] Time to serialize properties into /tmp/LTL11540157944344482536.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16955832738787411662.gal' '-t' 'CGAL' '-hoa' '/tmp/aut387857152880522371.hoa' '-atoms' '/tmp/LTL11540157944344482536.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11540157944344482536.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut387857152880522371.hoa
Detected timeout of ITS tools.
[2024-05-23 01:23:48] [INFO ] Flatten gal took : 154 ms
[2024-05-23 01:23:48] [INFO ] Flatten gal took : 172 ms
[2024-05-23 01:23:48] [INFO ] Time to serialize gal into /tmp/LTL17980942581524150250.gal : 28 ms
[2024-05-23 01:23:48] [INFO ] Time to serialize properties into /tmp/LTL523830261027507688.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17980942581524150250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL523830261027507688.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(p1097==0)"))&&((X("((p784==0)&&(p2660==1))"))||(G("(p1097==0)")))))))
Formula 0 simplified : XG(G!"(p1097==0)" | (X!"((p784==0)&&(p2660==1))" & F!"(p1097==0)"))
Detected timeout of ITS tools.
[2024-05-23 01:24:03] [INFO ] Flatten gal took : 102 ms
[2024-05-23 01:24:03] [INFO ] Applying decomposition
[2024-05-23 01:24:03] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1308801649485944208.txt' '-o' '/tmp/graph1308801649485944208.bin' '-w' '/tmp/graph1308801649485944208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1308801649485944208.bin' '-l' '-1' '-v' '-w' '/tmp/graph1308801649485944208.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:24:04] [INFO ] Decomposing Gal with order
[2024-05-23 01:24:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:24:04] [INFO ] Removed a total of 2224 redundant transitions.
[2024-05-23 01:24:05] [INFO ] Flatten gal took : 433 ms
[2024-05-23 01:24:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 39 ms.
[2024-05-23 01:24:05] [INFO ] Time to serialize gal into /tmp/LTL6600561616856763956.gal : 40 ms
[2024-05-23 01:24:05] [INFO ] Time to serialize properties into /tmp/LTL7667952183650698360.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6600561616856763956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7667952183650698360.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(i9.i1.i1.u383.p1097==0)"))&&((X("((i5.i3.i0.u278.p784==0)&&(i25.u916.p2660==1))"))||(G("(i9.i1.i1.u383.p1097==0)")))))))
Formula 0 simplified : XG(G!"(i9.i1.i1.u383.p1097==0)" | (X!"((i5.i3.i0.u278.p784==0)&&(i25.u916.p2660==1))" & F!"(i9.i1.i1.u383.p1097==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9152331379062210448
[2024-05-23 01:24:20] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9152331379062210448
Running compilation step : cd /tmp/ltsmin9152331379062210448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9152331379062210448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9152331379062210448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06b-LTLCardinality-00 finished in 104717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(F(p1))))))'
Support contains 3 out of 2561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2560 transition count 2651
Reduce places removed 475 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 482 rules applied. Total rules applied 957 place count 2085 transition count 2644
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 961 place count 2081 transition count 2644
Performed 685 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 685 Pre rules applied. Total rules applied 961 place count 2081 transition count 1959
Deduced a syphon composed of 685 places in 8 ms
Ensure Unique test removed 63 places
Reduce places removed 748 places and 0 transitions.
Iterating global reduction 3 with 1433 rules applied. Total rules applied 2394 place count 1333 transition count 1959
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 46 rules applied. Total rules applied 2440 place count 1327 transition count 1919
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 2480 place count 1287 transition count 1919
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2480 place count 1287 transition count 1895
Deduced a syphon composed of 24 places in 7 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 2552 place count 1239 transition count 1895
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 2552 place count 1239 transition count 1872
Deduced a syphon composed of 23 places in 7 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 2598 place count 1216 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2599 place count 1215 transition count 1864
Iterating global reduction 5 with 1 rules applied. Total rules applied 2600 place count 1215 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2601 place count 1214 transition count 1856
Iterating global reduction 5 with 1 rules applied. Total rules applied 2602 place count 1214 transition count 1856
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2603 place count 1213 transition count 1848
Iterating global reduction 5 with 1 rules applied. Total rules applied 2604 place count 1213 transition count 1848
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2605 place count 1212 transition count 1840
Iterating global reduction 5 with 1 rules applied. Total rules applied 2606 place count 1212 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2607 place count 1211 transition count 1832
Iterating global reduction 5 with 1 rules applied. Total rules applied 2608 place count 1211 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2609 place count 1210 transition count 1824
Iterating global reduction 5 with 1 rules applied. Total rules applied 2610 place count 1210 transition count 1824
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2611 place count 1209 transition count 1816
Iterating global reduction 5 with 1 rules applied. Total rules applied 2612 place count 1209 transition count 1816
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 5 with 387 rules applied. Total rules applied 2999 place count 1015 transition count 1623
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3000 place count 1014 transition count 1622
Ensure Unique test removed 1 places
Iterating global reduction 5 with 2 rules applied. Total rules applied 3002 place count 1013 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3003 place count 1012 transition count 1621
Iterating global reduction 5 with 1 rules applied. Total rules applied 3004 place count 1012 transition count 1621
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 3006 place count 1012 transition count 1619
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3007 place count 1011 transition count 1619
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3009 place count 1010 transition count 1628
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3011 place count 1008 transition count 1626
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 18 rules applied. Total rules applied 3029 place count 996 transition count 1620
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 3035 place count 990 transition count 1620
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 3035 place count 990 transition count 1602
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 37 rules applied. Total rules applied 3072 place count 971 transition count 1602
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 9 with 13 rules applied. Total rules applied 3085 place count 958 transition count 1602
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 3085 place count 958 transition count 1601
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3087 place count 957 transition count 1601
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 3125 place count 938 transition count 1582
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 3137 place count 926 transition count 1570
Iterating global reduction 10 with 12 rules applied. Total rules applied 3149 place count 926 transition count 1570
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 3155 place count 920 transition count 1564
Iterating global reduction 10 with 6 rules applied. Total rules applied 3161 place count 920 transition count 1564
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3167 place count 920 transition count 1558
Applied a total of 3167 rules in 1322 ms. Remains 920 /2561 variables (removed 1641) and now considering 1558/3127 (removed 1569) transitions.
// Phase 1: matrix 1558 rows 920 cols
[2024-05-23 01:24:24] [INFO ] Computed 156 invariants in 32 ms
[2024-05-23 01:24:25] [INFO ] Implicit Places using invariants in 1265 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 379, 380, 392, 393, 395, 412, 430, 450, 469, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 752, 763, 764, 765, 783, 785, 789, 807, 808, 809, 810, 823, 829, 835, 841, 847, 853, 859, 865, 871, 877, 883]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 1268 ms to find 71 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 849/2561 places, 1558/3127 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 849 transition count 1439
Reduce places removed 119 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 121 rules applied. Total rules applied 240 place count 730 transition count 1437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 728 transition count 1437
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 242 place count 728 transition count 1406
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 305 place count 696 transition count 1406
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 317 place count 692 transition count 1398
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 325 place count 684 transition count 1398
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 339 place count 670 transition count 1384
Iterating global reduction 5 with 14 rules applied. Total rules applied 353 place count 670 transition count 1384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 356 place count 670 transition count 1381
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 359 place count 667 transition count 1375
Iterating global reduction 6 with 3 rules applied. Total rules applied 362 place count 667 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 363 place count 666 transition count 1374
Iterating global reduction 6 with 1 rules applied. Total rules applied 364 place count 666 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 365 place count 665 transition count 1372
Iterating global reduction 6 with 1 rules applied. Total rules applied 366 place count 665 transition count 1372
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 468 place count 614 transition count 1321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 472 place count 612 transition count 1322
Applied a total of 472 rules in 197 ms. Remains 612 /849 variables (removed 237) and now considering 1322/1558 (removed 236) transitions.
// Phase 1: matrix 1322 rows 612 cols
[2024-05-23 01:24:26] [INFO ] Computed 80 invariants in 39 ms
[2024-05-23 01:24:27] [INFO ] Implicit Places using invariants in 978 ms returned [88, 94, 99, 174, 180, 185, 264, 270, 275, 354, 360, 365, 442, 448, 453, 530, 536, 541, 609]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 980 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 593/2561 places, 1322/3127 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 593 transition count 1321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 592 transition count 1321
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 580 transition count 1309
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 580 transition count 1309
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 568 transition count 1297
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 568 transition count 1297
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 563 transition count 1292
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 563 transition count 1292
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 557 transition count 1286
Applied a total of 72 rules in 127 ms. Remains 557 /593 variables (removed 36) and now considering 1286/1322 (removed 36) transitions.
// Phase 1: matrix 1286 rows 557 cols
[2024-05-23 01:24:27] [INFO ] Computed 61 invariants in 15 ms
[2024-05-23 01:24:28] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-23 01:24:28] [INFO ] Invariant cache hit.
[2024-05-23 01:24:30] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 557/2561 places, 1286/3127 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6683 ms. Remains : 557/2561 places, 1286/3127 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s320 1), p1:(OR (EQ s239 0) (EQ s553 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 25020 reset in 922 ms.
Product exploration explored 100000 steps with 25045 reset in 638 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 128 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 301250 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301250 steps, saw 70935 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:24:34] [INFO ] Invariant cache hit.
[2024-05-23 01:24:35] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:24:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 01:24:35] [INFO ] [Nat]Absence check using 10 positive and 51 generalized place invariants in 26 ms returned sat
[2024-05-23 01:24:36] [INFO ] After 1075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:24:36] [INFO ] After 1223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-23 01:24:36] [INFO ] After 1429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 1286/1286 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 557 transition count 1256
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 66 place count 527 transition count 1250
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 527 transition count 1232
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 102 place count 509 transition count 1232
Applied a total of 102 rules in 71 ms. Remains 509 /557 variables (removed 48) and now considering 1232/1286 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 509/557 places, 1232/1286 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 281070 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281070 steps, saw 128045 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1232 rows 509 cols
[2024-05-23 01:24:39] [INFO ] Computed 61 invariants in 16 ms
[2024-05-23 01:24:39] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:24:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-23 01:24:39] [INFO ] [Nat]Absence check using 11 positive and 50 generalized place invariants in 34 ms returned sat
[2024-05-23 01:24:41] [INFO ] After 1339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:24:41] [INFO ] After 1411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-23 01:24:41] [INFO ] After 1636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1232/1232 transitions.
Applied a total of 0 rules in 20 ms. Remains 509 /509 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 509/509 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1232/1232 transitions.
Applied a total of 0 rules in 21 ms. Remains 509 /509 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 01:24:41] [INFO ] Invariant cache hit.
[2024-05-23 01:24:42] [INFO ] Implicit Places using invariants in 969 ms returned [88, 89, 159, 160, 232, 233, 305, 306, 376, 377]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 972 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 499/509 places, 1232/1232 transitions.
Applied a total of 0 rules in 33 ms. Remains 499 /499 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1027 ms. Remains : 499/509 places, 1232/1232 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 278011 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278011 steps, saw 127256 distinct states, run finished after 3005 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1232 rows 499 cols
[2024-05-23 01:24:45] [INFO ] Computed 51 invariants in 14 ms
[2024-05-23 01:24:45] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:24:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-23 01:24:45] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 38 ms returned sat
[2024-05-23 01:24:46] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:24:47] [INFO ] After 1278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-23 01:24:47] [INFO ] After 1538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 1232/1232 transitions.
Applied a total of 0 rules in 33 ms. Remains 499 /499 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 499/499 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 1232/1232 transitions.
Applied a total of 0 rules in 33 ms. Remains 499 /499 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 01:24:47] [INFO ] Invariant cache hit.
[2024-05-23 01:24:48] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-05-23 01:24:48] [INFO ] Invariant cache hit.
[2024-05-23 01:24:49] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2616 ms to find 0 implicit places.
[2024-05-23 01:24:49] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-23 01:24:49] [INFO ] Invariant cache hit.
[2024-05-23 01:24:50] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3713 ms. Remains : 499/499 places, 1232/1232 transitions.
Applied a total of 0 rules in 20 ms. Remains 499 /499 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-23 01:24:50] [INFO ] Invariant cache hit.
[2024-05-23 01:24:51] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:24:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 01:24:51] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 23 ms returned sat
[2024-05-23 01:24:51] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:24:52] [INFO ] After 862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-23 01:24:52] [INFO ] After 1029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1286/1286 transitions.
Applied a total of 0 rules in 21 ms. Remains 557 /557 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
// Phase 1: matrix 1286 rows 557 cols
[2024-05-23 01:24:52] [INFO ] Computed 61 invariants in 15 ms
[2024-05-23 01:24:53] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-23 01:24:53] [INFO ] Invariant cache hit.
[2024-05-23 01:24:54] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2024-05-23 01:24:54] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-23 01:24:54] [INFO ] Invariant cache hit.
[2024-05-23 01:24:55] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3553 ms. Remains : 557/557 places, 1286/1286 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 307562 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307562 steps, saw 72406 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:24:59] [INFO ] Invariant cache hit.
[2024-05-23 01:24:59] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:24:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-23 01:24:59] [INFO ] [Nat]Absence check using 10 positive and 51 generalized place invariants in 26 ms returned sat
[2024-05-23 01:25:00] [INFO ] After 883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:25:00] [INFO ] After 1023ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-23 01:25:00] [INFO ] After 1222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 1286/1286 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 557 transition count 1256
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 66 place count 527 transition count 1250
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 527 transition count 1232
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 102 place count 509 transition count 1232
Applied a total of 102 rules in 68 ms. Remains 509 /557 variables (removed 48) and now considering 1232/1286 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 509/557 places, 1232/1286 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 298361 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298361 steps, saw 140200 distinct states, run finished after 3005 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1232 rows 509 cols
[2024-05-23 01:25:03] [INFO ] Computed 61 invariants in 10 ms
[2024-05-23 01:25:03] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:25:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 01:25:03] [INFO ] [Nat]Absence check using 11 positive and 50 generalized place invariants in 23 ms returned sat
[2024-05-23 01:25:04] [INFO ] After 1075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:25:04] [INFO ] After 1147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-23 01:25:04] [INFO ] After 1314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1232/1232 transitions.
Applied a total of 0 rules in 20 ms. Remains 509 /509 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 509/509 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1232/1232 transitions.
Applied a total of 0 rules in 20 ms. Remains 509 /509 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 01:25:05] [INFO ] Invariant cache hit.
[2024-05-23 01:25:05] [INFO ] Implicit Places using invariants in 949 ms returned [88, 89, 159, 160, 232, 233, 305, 306, 376, 377]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 951 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 499/509 places, 1232/1232 transitions.
Applied a total of 0 rules in 30 ms. Remains 499 /499 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1003 ms. Remains : 499/509 places, 1232/1232 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279697 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279697 steps, saw 127680 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1232 rows 499 cols
[2024-05-23 01:25:09] [INFO ] Computed 51 invariants in 10 ms
[2024-05-23 01:25:09] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:25:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 01:25:09] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 24 ms returned sat
[2024-05-23 01:25:10] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:25:10] [INFO ] After 1046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-23 01:25:10] [INFO ] After 1213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 1232/1232 transitions.
Applied a total of 0 rules in 20 ms. Remains 499 /499 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 499/499 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 1232/1232 transitions.
Applied a total of 0 rules in 20 ms. Remains 499 /499 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 01:25:10] [INFO ] Invariant cache hit.
[2024-05-23 01:25:10] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-23 01:25:10] [INFO ] Invariant cache hit.
[2024-05-23 01:25:12] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2024-05-23 01:25:12] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-23 01:25:12] [INFO ] Invariant cache hit.
[2024-05-23 01:25:13] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3530 ms. Remains : 499/499 places, 1232/1232 transitions.
Applied a total of 0 rules in 29 ms. Remains 499 /499 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-23 01:25:14] [INFO ] Invariant cache hit.
[2024-05-23 01:25:14] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:25:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-23 01:25:14] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 38 ms returned sat
[2024-05-23 01:25:15] [INFO ] After 1020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:25:15] [INFO ] After 1133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-23 01:25:15] [INFO ] After 1369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1229 reset in 412 ms.
Product exploration explored 100000 steps with 1282 reset in 472 ms.
Built C files in :
/tmp/ltsmin2837873860652281078
[2024-05-23 01:25:16] [INFO ] Computing symmetric may disable matrix : 1286 transitions.
[2024-05-23 01:25:16] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:25:16] [INFO ] Computing symmetric may enable matrix : 1286 transitions.
[2024-05-23 01:25:16] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:25:17] [INFO ] Computing Do-Not-Accords matrix : 1286 transitions.
[2024-05-23 01:25:17] [INFO ] Computation of Completed DNA matrix. took 86 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:25:17] [INFO ] Built C files in 432ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2837873860652281078
Running compilation step : cd /tmp/ltsmin2837873860652281078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2837873860652281078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2837873860652281078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1286/1286 transitions.
Applied a total of 0 rules in 23 ms. Remains 557 /557 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
// Phase 1: matrix 1286 rows 557 cols
[2024-05-23 01:25:20] [INFO ] Computed 61 invariants in 12 ms
[2024-05-23 01:25:20] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-23 01:25:20] [INFO ] Invariant cache hit.
[2024-05-23 01:25:22] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
[2024-05-23 01:25:22] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-23 01:25:22] [INFO ] Invariant cache hit.
[2024-05-23 01:25:24] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4108 ms. Remains : 557/557 places, 1286/1286 transitions.
Built C files in :
/tmp/ltsmin16841477922976613641
[2024-05-23 01:25:24] [INFO ] Computing symmetric may disable matrix : 1286 transitions.
[2024-05-23 01:25:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:25:24] [INFO ] Computing symmetric may enable matrix : 1286 transitions.
[2024-05-23 01:25:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:25:24] [INFO ] Computing Do-Not-Accords matrix : 1286 transitions.
[2024-05-23 01:25:24] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:25:24] [INFO ] Built C files in 340ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16841477922976613641
Running compilation step : cd /tmp/ltsmin16841477922976613641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16841477922976613641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16841477922976613641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 01:25:27] [INFO ] Flatten gal took : 49 ms
[2024-05-23 01:25:27] [INFO ] Flatten gal took : 49 ms
[2024-05-23 01:25:27] [INFO ] Time to serialize gal into /tmp/LTL3799604970937869054.gal : 8 ms
[2024-05-23 01:25:27] [INFO ] Time to serialize properties into /tmp/LTL199972996625145690.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3799604970937869054.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8241773630321590640.hoa' '-atoms' '/tmp/LTL199972996625145690.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL199972996625145690.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8241773630321590640.hoa
Detected timeout of ITS tools.
[2024-05-23 01:25:43] [INFO ] Flatten gal took : 49 ms
[2024-05-23 01:25:43] [INFO ] Flatten gal took : 42 ms
[2024-05-23 01:25:43] [INFO ] Time to serialize gal into /tmp/LTL2314045665432871894.gal : 11 ms
[2024-05-23 01:25:43] [INFO ] Time to serialize properties into /tmp/LTL1723102924116149840.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2314045665432871894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1723102924116149840.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(p1447==1)"))||(X(X(F("((p1071==0)||(p2746==1))")))))))
Formula 0 simplified : F(G!"(p1447==1)" & XXG!"((p1071==0)||(p2746==1))")
Detected timeout of ITS tools.
[2024-05-23 01:25:58] [INFO ] Flatten gal took : 38 ms
[2024-05-23 01:25:58] [INFO ] Applying decomposition
[2024-05-23 01:25:58] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15843998794004875205.txt' '-o' '/tmp/graph15843998794004875205.bin' '-w' '/tmp/graph15843998794004875205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15843998794004875205.bin' '-l' '-1' '-v' '-w' '/tmp/graph15843998794004875205.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:25:58] [INFO ] Decomposing Gal with order
[2024-05-23 01:25:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:25:58] [INFO ] Removed a total of 2512 redundant transitions.
[2024-05-23 01:25:58] [INFO ] Flatten gal took : 74 ms
[2024-05-23 01:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 23 ms.
[2024-05-23 01:25:58] [INFO ] Time to serialize gal into /tmp/LTL6650636638720802474.gal : 11 ms
[2024-05-23 01:25:58] [INFO ] Time to serialize properties into /tmp/LTL5668426781025996214.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6650636638720802474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5668426781025996214.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(i7.u78.p1447==1)"))||(X(X(F("((i5.u61.p1071==0)||(i11.u135.p2746==1))")))))))
Formula 0 simplified : F(G!"(i7.u78.p1447==1)" & XXG!"((i5.u61.p1071==0)||(i11.u135.p2746==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin476950333809710204
[2024-05-23 01:26:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin476950333809710204
Running compilation step : cd /tmp/ltsmin476950333809710204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin476950333809710204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin476950333809710204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06b-LTLCardinality-02 finished in 113226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G((G(p1) U X(X(p2))))))))'
Support contains 6 out of 2561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2558 transition count 3124
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2558 transition count 3124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 2556 transition count 3122
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 2556 transition count 3122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 2556 transition count 3121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 2555 transition count 3120
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 2555 transition count 3120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 2554 transition count 3119
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 2554 transition count 3119
Applied a total of 15 rules in 1290 ms. Remains 2554 /2561 variables (removed 7) and now considering 3119/3127 (removed 8) transitions.
// Phase 1: matrix 3119 rows 2554 cols
[2024-05-23 01:26:17] [INFO ] Computed 277 invariants in 40 ms
[2024-05-23 01:26:19] [INFO ] Implicit Places using invariants in 2044 ms returned []
[2024-05-23 01:26:19] [INFO ] Invariant cache hit.
[2024-05-23 01:26:21] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 4100 ms to find 0 implicit places.
[2024-05-23 01:26:21] [INFO ] Invariant cache hit.
[2024-05-23 01:26:25] [INFO ] Dead Transitions using invariants and state equation in 3418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2554/2561 places, 3119/3127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8810 ms. Remains : 2554/2561 places, 3119/3127 transitions.
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s420 0) (EQ s1869 1)), p1:(OR (EQ s640 0) (EQ s480 1)), p2:(OR (EQ s1442 0) (EQ s2257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19975 reset in 1241 ms.
Product exploration explored 100000 steps with 19994 reset in 1117 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:26:28] [INFO ] Invariant cache hit.
[2024-05-23 01:26:29] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:26:30] [INFO ] [Nat]Absence check using 62 positive place invariants in 55 ms returned sat
[2024-05-23 01:26:30] [INFO ] [Nat]Absence check using 62 positive and 215 generalized place invariants in 286 ms returned sat
[2024-05-23 01:26:41] [INFO ] After 12593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2554/2554 places, 3119/3119 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 2554 transition count 2652
Reduce places removed 467 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 470 rules applied. Total rules applied 937 place count 2087 transition count 2649
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 940 place count 2085 transition count 2648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 941 place count 2084 transition count 2648
Performed 687 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 687 Pre rules applied. Total rules applied 941 place count 2084 transition count 1961
Deduced a syphon composed of 687 places in 5 ms
Ensure Unique test removed 62 places
Reduce places removed 749 places and 0 transitions.
Iterating global reduction 4 with 1436 rules applied. Total rules applied 2377 place count 1335 transition count 1961
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 4 with 45 rules applied. Total rules applied 2422 place count 1329 transition count 1922
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 2461 place count 1290 transition count 1922
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2461 place count 1290 transition count 1898
Deduced a syphon composed of 24 places in 5 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2533 place count 1242 transition count 1898
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2533 place count 1242 transition count 1875
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2579 place count 1219 transition count 1875
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 3 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 6 with 386 rules applied. Total rules applied 2965 place count 1026 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2966 place count 1025 transition count 1681
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 2968 place count 1024 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2969 place count 1023 transition count 1680
Iterating global reduction 6 with 1 rules applied. Total rules applied 2970 place count 1023 transition count 1680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 2972 place count 1023 transition count 1678
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2973 place count 1022 transition count 1678
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2975 place count 1021 transition count 1687
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 2982 place count 1021 transition count 1680
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 2989 place count 1014 transition count 1680
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2994 place count 1014 transition count 1675
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2999 place count 1009 transition count 1675
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 3005 place count 1009 transition count 1675
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3006 place count 1008 transition count 1674
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 10 with 16 rules applied. Total rules applied 3022 place count 997 transition count 1669
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3027 place count 992 transition count 1669
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 17 Pre rules applied. Total rules applied 3027 place count 992 transition count 1652
Deduced a syphon composed of 17 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 35 rules applied. Total rules applied 3062 place count 974 transition count 1652
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 12 with 6 rules applied. Total rules applied 3068 place count 968 transition count 1652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3068 place count 968 transition count 1651
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3070 place count 967 transition count 1651
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 24 rules applied. Total rules applied 3094 place count 955 transition count 1639
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 3099 place count 950 transition count 1634
Iterating global reduction 13 with 5 rules applied. Total rules applied 3104 place count 950 transition count 1634
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 3109 place count 950 transition count 1629
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 3114 place count 945 transition count 1629
Applied a total of 3114 rules in 686 ms. Remains 945 /2554 variables (removed 1609) and now considering 1629/3119 (removed 1490) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 945/2554 places, 1629/3119 transitions.
Finished random walk after 9685 steps, including 111 resets, run visited all 1 properties in 39 ms. (steps per millisecond=248 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p2)))
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06b-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06b-LTLCardinality-03 finished in 26376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2560 transition count 2651
Reduce places removed 475 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 482 rules applied. Total rules applied 957 place count 2085 transition count 2644
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 962 place count 2081 transition count 2643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 963 place count 2080 transition count 2643
Performed 687 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 687 Pre rules applied. Total rules applied 963 place count 2080 transition count 1956
Deduced a syphon composed of 687 places in 5 ms
Ensure Unique test removed 64 places
Reduce places removed 751 places and 0 transitions.
Iterating global reduction 4 with 1438 rules applied. Total rules applied 2401 place count 1329 transition count 1956
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2447 place count 1323 transition count 1916
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2487 place count 1283 transition count 1916
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 2487 place count 1283 transition count 1891
Deduced a syphon composed of 25 places in 5 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 75 rules applied. Total rules applied 2562 place count 1233 transition count 1891
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2562 place count 1233 transition count 1867
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2610 place count 1209 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2611 place count 1208 transition count 1859
Iterating global reduction 6 with 1 rules applied. Total rules applied 2612 place count 1208 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2613 place count 1207 transition count 1851
Iterating global reduction 6 with 1 rules applied. Total rules applied 2614 place count 1207 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2615 place count 1206 transition count 1843
Iterating global reduction 6 with 1 rules applied. Total rules applied 2616 place count 1206 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2617 place count 1205 transition count 1835
Iterating global reduction 6 with 1 rules applied. Total rules applied 2618 place count 1205 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2619 place count 1204 transition count 1827
Iterating global reduction 6 with 1 rules applied. Total rules applied 2620 place count 1204 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2621 place count 1203 transition count 1819
Iterating global reduction 6 with 1 rules applied. Total rules applied 2622 place count 1203 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2623 place count 1202 transition count 1811
Iterating global reduction 6 with 1 rules applied. Total rules applied 2624 place count 1202 transition count 1811
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 6 with 380 rules applied. Total rules applied 3004 place count 1012 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3005 place count 1011 transition count 1620
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 3007 place count 1010 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3008 place count 1009 transition count 1619
Iterating global reduction 6 with 1 rules applied. Total rules applied 3009 place count 1009 transition count 1619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 3011 place count 1009 transition count 1617
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3012 place count 1008 transition count 1617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3014 place count 1007 transition count 1626
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3016 place count 1005 transition count 1624
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 18 rules applied. Total rules applied 3034 place count 993 transition count 1618
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3040 place count 987 transition count 1618
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 18 Pre rules applied. Total rules applied 3040 place count 987 transition count 1600
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 37 rules applied. Total rules applied 3077 place count 968 transition count 1600
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 10 with 13 rules applied. Total rules applied 3090 place count 955 transition count 1600
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 3090 place count 955 transition count 1599
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3092 place count 954 transition count 1599
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 3128 place count 936 transition count 1581
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 3139 place count 925 transition count 1570
Iterating global reduction 11 with 11 rules applied. Total rules applied 3150 place count 925 transition count 1570
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 3156 place count 919 transition count 1564
Iterating global reduction 11 with 6 rules applied. Total rules applied 3162 place count 919 transition count 1564
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3168 place count 919 transition count 1558
Applied a total of 3168 rules in 878 ms. Remains 919 /2561 variables (removed 1642) and now considering 1558/3127 (removed 1569) transitions.
// Phase 1: matrix 1558 rows 919 cols
[2024-05-23 01:26:43] [INFO ] Computed 155 invariants in 20 ms
[2024-05-23 01:26:45] [INFO ] Implicit Places using invariants in 1321 ms returned [1, 18, 19, 31, 48, 66, 86, 140, 150, 151, 153, 170, 188, 208, 259, 260, 272, 273, 275, 292, 310, 330, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 752, 763, 764, 765, 783, 785, 789, 807, 808, 809, 810, 823, 829, 835, 841, 847, 853, 859, 865, 871, 877, 883]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1323 ms to find 70 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 849/2561 places, 1558/3127 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 849 transition count 1435
Reduce places removed 123 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 124 rules applied. Total rules applied 247 place count 726 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 248 place count 725 transition count 1434
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 248 place count 725 transition count 1403
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 311 place count 693 transition count 1403
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 323 place count 689 transition count 1395
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 331 place count 681 transition count 1395
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 346 place count 666 transition count 1380
Iterating global reduction 5 with 15 rules applied. Total rules applied 361 place count 666 transition count 1380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 364 place count 666 transition count 1377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 364 place count 666 transition count 1376
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 366 place count 665 transition count 1376
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 369 place count 662 transition count 1370
Iterating global reduction 6 with 3 rules applied. Total rules applied 372 place count 662 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 661 transition count 1369
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 661 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 375 place count 660 transition count 1367
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 660 transition count 1367
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 476 place count 610 transition count 1317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 480 place count 608 transition count 1318
Applied a total of 480 rules in 168 ms. Remains 608 /849 variables (removed 241) and now considering 1318/1558 (removed 240) transitions.
// Phase 1: matrix 1318 rows 608 cols
[2024-05-23 01:26:45] [INFO ] Computed 80 invariants in 12 ms
[2024-05-23 01:26:46] [INFO ] Implicit Places using invariants in 1016 ms returned [89, 95, 100, 176, 182, 187, 264, 270, 276, 353, 359, 364, 441, 447, 452, 529, 535, 540, 605]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1019 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 589/2561 places, 1318/3127 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 589 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 588 transition count 1317
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 576 transition count 1305
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 576 transition count 1305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 564 transition count 1293
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 564 transition count 1293
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 558 transition count 1287
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 558 transition count 1287
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 552 transition count 1281
Applied a total of 74 rules in 154 ms. Remains 552 /589 variables (removed 37) and now considering 1281/1318 (removed 37) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-05-23 01:26:46] [INFO ] Computed 61 invariants in 18 ms
[2024-05-23 01:26:47] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2024-05-23 01:26:47] [INFO ] Invariant cache hit.
[2024-05-23 01:26:49] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2857 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 552/2561 places, 1281/3127 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6399 ms. Remains : 552/2561 places, 1281/3127 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s248 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1331 reset in 390 ms.
Product exploration explored 100000 steps with 1290 reset in 289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 319908 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319908 steps, saw 80049 distinct states, run finished after 3005 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:26:53] [INFO ] Invariant cache hit.
[2024-05-23 01:26:53] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:26:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 01:26:53] [INFO ] [Nat]Absence check using 11 positive and 50 generalized place invariants in 26 ms returned sat
[2024-05-23 01:26:54] [INFO ] After 787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:26:54] [INFO ] After 855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-23 01:26:54] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 552 transition count 1251
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 65 place count 522 transition count 1246
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 522 transition count 1229
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 99 place count 505 transition count 1229
Applied a total of 99 rules in 68 ms. Remains 505 /552 variables (removed 47) and now considering 1229/1281 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 505/552 places, 1229/1281 transitions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 296875 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296875 steps, saw 139270 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1229 rows 505 cols
[2024-05-23 01:26:57] [INFO ] Computed 61 invariants in 11 ms
[2024-05-23 01:26:57] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:26:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-23 01:26:57] [INFO ] [Nat]Absence check using 12 positive and 49 generalized place invariants in 23 ms returned sat
[2024-05-23 01:26:58] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:26:58] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-23 01:26:58] [INFO ] After 802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 21 ms. Remains 505 /505 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 505/505 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 20 ms. Remains 505 /505 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2024-05-23 01:26:58] [INFO ] Invariant cache hit.
[2024-05-23 01:26:59] [INFO ] Implicit Places using invariants in 651 ms returned [90, 91, 161, 162, 233, 234, 304, 305, 375, 376]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 652 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 495/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 20 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 693 ms. Remains : 495/505 places, 1229/1229 transitions.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 297367 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 297367 steps, saw 139658 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1229 rows 495 cols
[2024-05-23 01:27:02] [INFO ] Computed 51 invariants in 11 ms
[2024-05-23 01:27:02] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:27:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 01:27:02] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 27 ms returned sat
[2024-05-23 01:27:03] [INFO ] After 587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:27:03] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-23 01:27:03] [INFO ] After 873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 33 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 495/495 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 32 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2024-05-23 01:27:03] [INFO ] Invariant cache hit.
[2024-05-23 01:27:04] [INFO ] Implicit Places using invariants in 916 ms returned []
[2024-05-23 01:27:04] [INFO ] Invariant cache hit.
[2024-05-23 01:27:05] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
[2024-05-23 01:27:05] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-23 01:27:05] [INFO ] Invariant cache hit.
[2024-05-23 01:27:06] [INFO ] Dead Transitions using invariants and state equation in 1008 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3439 ms. Remains : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 33 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-23 01:27:06] [INFO ] Invariant cache hit.
[2024-05-23 01:27:06] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:27:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:27:07] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 35 ms returned sat
[2024-05-23 01:27:07] [INFO ] After 959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:27:08] [INFO ] After 1020ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-23 01:27:08] [INFO ] After 1257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Applied a total of 0 rules in 36 ms. Remains 552 /552 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-05-23 01:27:08] [INFO ] Computed 61 invariants in 18 ms
[2024-05-23 01:27:09] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-05-23 01:27:09] [INFO ] Invariant cache hit.
[2024-05-23 01:27:11] [INFO ] Implicit Places using invariants and state equation in 1740 ms returned []
Implicit Place search using SMT with State Equation took 2779 ms to find 0 implicit places.
[2024-05-23 01:27:11] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-23 01:27:11] [INFO ] Invariant cache hit.
[2024-05-23 01:27:12] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3891 ms. Remains : 552/552 places, 1281/1281 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 126 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 282870 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282870 steps, saw 71662 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:27:15] [INFO ] Invariant cache hit.
[2024-05-23 01:27:15] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:27:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 01:27:15] [INFO ] [Nat]Absence check using 11 positive and 50 generalized place invariants in 27 ms returned sat
[2024-05-23 01:27:16] [INFO ] After 940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:27:16] [INFO ] After 1006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-23 01:27:16] [INFO ] After 1176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 552 transition count 1251
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 65 place count 522 transition count 1246
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 522 transition count 1229
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 99 place count 505 transition count 1229
Applied a total of 99 rules in 66 ms. Remains 505 /552 variables (removed 47) and now considering 1229/1281 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 505/552 places, 1229/1281 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279408 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279408 steps, saw 127295 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1229 rows 505 cols
[2024-05-23 01:27:20] [INFO ] Computed 61 invariants in 10 ms
[2024-05-23 01:27:20] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:27:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-23 01:27:20] [INFO ] [Nat]Absence check using 12 positive and 49 generalized place invariants in 22 ms returned sat
[2024-05-23 01:27:20] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:27:21] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-23 01:27:21] [INFO ] After 971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 34 ms. Remains 505 /505 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 505/505 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 33 ms. Remains 505 /505 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2024-05-23 01:27:21] [INFO ] Invariant cache hit.
[2024-05-23 01:27:21] [INFO ] Implicit Places using invariants in 804 ms returned [90, 91, 161, 162, 233, 234, 304, 305, 375, 376]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 806 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 495/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 33 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 873 ms. Remains : 495/505 places, 1229/1229 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 305436 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305436 steps, saw 145785 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1229 rows 495 cols
[2024-05-23 01:27:25] [INFO ] Computed 51 invariants in 12 ms
[2024-05-23 01:27:25] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:27:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-23 01:27:25] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 32 ms returned sat
[2024-05-23 01:27:26] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:27:26] [INFO ] After 914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-23 01:27:26] [INFO ] After 1130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 19 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 495/495 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 19 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2024-05-23 01:27:26] [INFO ] Invariant cache hit.
[2024-05-23 01:27:27] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-23 01:27:27] [INFO ] Invariant cache hit.
[2024-05-23 01:27:28] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 2594 ms to find 0 implicit places.
[2024-05-23 01:27:28] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-23 01:27:28] [INFO ] Invariant cache hit.
[2024-05-23 01:27:29] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3604 ms. Remains : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 20 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-23 01:27:29] [INFO ] Invariant cache hit.
[2024-05-23 01:27:30] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:27:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-23 01:27:30] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 33 ms returned sat
[2024-05-23 01:27:31] [INFO ] After 1030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:27:31] [INFO ] After 1094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-23 01:27:31] [INFO ] After 1303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1331 reset in 374 ms.
Product exploration explored 100000 steps with 1315 reset in 445 ms.
Built C files in :
/tmp/ltsmin2759934921283185741
[2024-05-23 01:27:32] [INFO ] Computing symmetric may disable matrix : 1281 transitions.
[2024-05-23 01:27:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:27:32] [INFO ] Computing symmetric may enable matrix : 1281 transitions.
[2024-05-23 01:27:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:27:32] [INFO ] Computing Do-Not-Accords matrix : 1281 transitions.
[2024-05-23 01:27:32] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:27:32] [INFO ] Built C files in 308ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2759934921283185741
Running compilation step : cd /tmp/ltsmin2759934921283185741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2759934921283185741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2759934921283185741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Applied a total of 0 rules in 36 ms. Remains 552 /552 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-05-23 01:27:35] [INFO ] Computed 61 invariants in 18 ms
[2024-05-23 01:27:36] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-23 01:27:36] [INFO ] Invariant cache hit.
[2024-05-23 01:27:38] [INFO ] Implicit Places using invariants and state equation in 2001 ms returned []
Implicit Place search using SMT with State Equation took 2647 ms to find 0 implicit places.
[2024-05-23 01:27:38] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-23 01:27:38] [INFO ] Invariant cache hit.
[2024-05-23 01:27:39] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3694 ms. Remains : 552/552 places, 1281/1281 transitions.
Built C files in :
/tmp/ltsmin4327120651294663359
[2024-05-23 01:27:39] [INFO ] Computing symmetric may disable matrix : 1281 transitions.
[2024-05-23 01:27:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:27:39] [INFO ] Computing symmetric may enable matrix : 1281 transitions.
[2024-05-23 01:27:39] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:27:39] [INFO ] Computing Do-Not-Accords matrix : 1281 transitions.
[2024-05-23 01:27:39] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:27:40] [INFO ] Built C files in 437ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4327120651294663359
Running compilation step : cd /tmp/ltsmin4327120651294663359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4327120651294663359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4327120651294663359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 01:27:43] [INFO ] Flatten gal took : 38 ms
[2024-05-23 01:27:43] [INFO ] Flatten gal took : 38 ms
[2024-05-23 01:27:43] [INFO ] Time to serialize gal into /tmp/LTL12162365971317829452.gal : 7 ms
[2024-05-23 01:27:43] [INFO ] Time to serialize properties into /tmp/LTL2039650304804487466.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12162365971317829452.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15795841439786670603.hoa' '-atoms' '/tmp/LTL2039650304804487466.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2039650304804487466.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15795841439786670603.hoa
Detected timeout of ITS tools.
[2024-05-23 01:27:58] [INFO ] Flatten gal took : 40 ms
[2024-05-23 01:27:58] [INFO ] Flatten gal took : 41 ms
[2024-05-23 01:27:58] [INFO ] Time to serialize gal into /tmp/LTL9725129841098917160.gal : 7 ms
[2024-05-23 01:27:58] [INFO ] Time to serialize properties into /tmp/LTL16218115985176897514.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9725129841098917160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16218115985176897514.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p200==0)||(p1154==1))"))))
Formula 0 simplified : FG!"((p200==0)||(p1154==1))"
Detected timeout of ITS tools.
[2024-05-23 01:28:13] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:28:13] [INFO ] Applying decomposition
[2024-05-23 01:28:13] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8907278832591870083.txt' '-o' '/tmp/graph8907278832591870083.bin' '-w' '/tmp/graph8907278832591870083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8907278832591870083.bin' '-l' '-1' '-v' '-w' '/tmp/graph8907278832591870083.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:28:13] [INFO ] Decomposing Gal with order
[2024-05-23 01:28:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:28:13] [INFO ] Removed a total of 2521 redundant transitions.
[2024-05-23 01:28:13] [INFO ] Flatten gal took : 73 ms
[2024-05-23 01:28:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 23 ms.
[2024-05-23 01:28:13] [INFO ] Time to serialize gal into /tmp/LTL271636739467521520.gal : 11 ms
[2024-05-23 01:28:13] [INFO ] Time to serialize properties into /tmp/LTL11270300976558803709.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL271636739467521520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11270300976558803709.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u25.p200==0)||(i5.u54.p1154==1))"))))
Formula 0 simplified : FG!"((i1.u25.p200==0)||(i5.u54.p1154==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4132958975574485060
[2024-05-23 01:28:28] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4132958975574485060
Running compilation step : cd /tmp/ltsmin4132958975574485060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4132958975574485060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4132958975574485060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06b-LTLCardinality-04 finished in 108867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 2561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2556 transition count 3115
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2556 transition count 3115
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 2552 transition count 3104
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 2552 transition count 3104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 2552 transition count 3102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 2550 transition count 3100
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 2550 transition count 3100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 2548 transition count 3091
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 2548 transition count 3091
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 2547 transition count 3083
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 2547 transition count 3083
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 2546 transition count 3082
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 2546 transition count 3082
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 2545 transition count 3074
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 2545 transition count 3074
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 2544 transition count 3066
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 2544 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 2543 transition count 3065
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 2543 transition count 3065
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 2542 transition count 3057
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 2542 transition count 3057
Applied a total of 40 rules in 2553 ms. Remains 2542 /2561 variables (removed 19) and now considering 3057/3127 (removed 70) transitions.
// Phase 1: matrix 3057 rows 2542 cols
[2024-05-23 01:28:34] [INFO ] Computed 277 invariants in 42 ms
[2024-05-23 01:28:36] [INFO ] Implicit Places using invariants in 2012 ms returned [2376, 2387, 2398, 2406, 2414, 2422, 2430, 2441, 2449, 2457, 2468]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2015 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2531/2561 places, 3057/3127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2518 transition count 3044
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2518 transition count 3044
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 2507 transition count 3033
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 2507 transition count 3033
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 2498 transition count 3024
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 2498 transition count 3024
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 2494 transition count 3020
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 2494 transition count 3020
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 2492 transition count 3018
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 2492 transition count 3018
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 2490 transition count 3016
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 2490 transition count 3016
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 2488 transition count 3014
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 2488 transition count 3014
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 2486 transition count 3012
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 2486 transition count 3012
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2485 transition count 3011
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2485 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 2484 transition count 3010
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 2484 transition count 3010
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 2483 transition count 3009
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 2483 transition count 3009
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 2482 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 2482 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 2481 transition count 3007
Applied a total of 100 rules in 3111 ms. Remains 2481 /2531 variables (removed 50) and now considering 3007/3057 (removed 50) transitions.
// Phase 1: matrix 3007 rows 2481 cols
[2024-05-23 01:28:39] [INFO ] Computed 266 invariants in 37 ms
[2024-05-23 01:28:41] [INFO ] Implicit Places using invariants in 1683 ms returned []
[2024-05-23 01:28:41] [INFO ] Invariant cache hit.
[2024-05-23 01:28:47] [INFO ] Implicit Places using invariants and state equation in 6802 ms returned []
Implicit Place search using SMT with State Equation took 8487 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2481/2561 places, 3007/3127 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16167 ms. Remains : 2481/2561 places, 3007/3127 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s506 1) (EQ s249 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 729 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLCardinality-11 finished in 16310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 2561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 471 rules applied. Total rules applied 471 place count 2560 transition count 2655
Reduce places removed 471 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 478 rules applied. Total rules applied 949 place count 2089 transition count 2648
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 954 place count 2085 transition count 2647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 955 place count 2084 transition count 2647
Performed 685 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 685 Pre rules applied. Total rules applied 955 place count 2084 transition count 1962
Deduced a syphon composed of 685 places in 6 ms
Ensure Unique test removed 63 places
Reduce places removed 748 places and 0 transitions.
Iterating global reduction 4 with 1433 rules applied. Total rules applied 2388 place count 1336 transition count 1962
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2434 place count 1330 transition count 1922
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2474 place count 1290 transition count 1922
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2474 place count 1290 transition count 1898
Deduced a syphon composed of 24 places in 5 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2546 place count 1242 transition count 1898
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2546 place count 1242 transition count 1875
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2592 place count 1219 transition count 1875
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2593 place count 1218 transition count 1867
Iterating global reduction 6 with 1 rules applied. Total rules applied 2594 place count 1218 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2595 place count 1217 transition count 1859
Iterating global reduction 6 with 1 rules applied. Total rules applied 2596 place count 1217 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2597 place count 1216 transition count 1851
Iterating global reduction 6 with 1 rules applied. Total rules applied 2598 place count 1216 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2599 place count 1215 transition count 1843
Iterating global reduction 6 with 1 rules applied. Total rules applied 2600 place count 1215 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2601 place count 1214 transition count 1835
Iterating global reduction 6 with 1 rules applied. Total rules applied 2602 place count 1214 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2603 place count 1213 transition count 1827
Iterating global reduction 6 with 1 rules applied. Total rules applied 2604 place count 1213 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2605 place count 1212 transition count 1819
Iterating global reduction 6 with 1 rules applied. Total rules applied 2606 place count 1212 transition count 1819
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 6 with 387 rules applied. Total rules applied 2993 place count 1018 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2994 place count 1017 transition count 1625
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 2996 place count 1016 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2997 place count 1015 transition count 1624
Iterating global reduction 6 with 1 rules applied. Total rules applied 2998 place count 1015 transition count 1624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 3000 place count 1015 transition count 1622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3001 place count 1014 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3003 place count 1013 transition count 1631
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3005 place count 1011 transition count 1629
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 18 rules applied. Total rules applied 3023 place count 999 transition count 1623
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3029 place count 993 transition count 1623
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 18 Pre rules applied. Total rules applied 3029 place count 993 transition count 1605
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 37 rules applied. Total rules applied 3066 place count 974 transition count 1605
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 10 with 13 rules applied. Total rules applied 3079 place count 961 transition count 1605
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 3079 place count 961 transition count 1604
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3081 place count 960 transition count 1604
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 38 rules applied. Total rules applied 3119 place count 941 transition count 1585
Discarding 12 places :
Symmetric choice reduction at 11 with 12 rule applications. Total rules 3131 place count 929 transition count 1573
Iterating global reduction 11 with 12 rules applied. Total rules applied 3143 place count 929 transition count 1573
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 3149 place count 923 transition count 1567
Iterating global reduction 11 with 6 rules applied. Total rules applied 3155 place count 923 transition count 1567
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3161 place count 923 transition count 1561
Applied a total of 3161 rules in 945 ms. Remains 923 /2561 variables (removed 1638) and now considering 1561/3127 (removed 1566) transitions.
// Phase 1: matrix 1561 rows 923 cols
[2024-05-23 01:28:49] [INFO ] Computed 156 invariants in 20 ms
[2024-05-23 01:28:50] [INFO ] Implicit Places using invariants in 1078 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 238, 259, 260, 272, 273, 275, 292, 310, 330, 381, 382, 394, 395, 397, 414, 432, 454, 505, 506, 518, 519, 521, 538, 556, 576, 627, 628, 640, 641, 643, 660, 678, 698, 749, 750, 753, 765, 766, 767, 785, 787, 791, 809, 810, 811, 812, 827, 833, 839, 845, 851, 857, 863, 869, 875, 881, 887]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 71 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 852/2561 places, 1561/3127 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 852 transition count 1440
Reduce places removed 121 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 123 rules applied. Total rules applied 244 place count 731 transition count 1438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 729 transition count 1438
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 246 place count 729 transition count 1407
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 309 place count 697 transition count 1407
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 321 place count 693 transition count 1399
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 329 place count 685 transition count 1399
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 344 place count 670 transition count 1384
Iterating global reduction 5 with 15 rules applied. Total rules applied 359 place count 670 transition count 1384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 362 place count 670 transition count 1381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 362 place count 670 transition count 1380
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 669 transition count 1380
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 367 place count 666 transition count 1374
Iterating global reduction 6 with 3 rules applied. Total rules applied 370 place count 666 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 371 place count 665 transition count 1373
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 665 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 664 transition count 1371
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 664 transition count 1371
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 474 place count 614 transition count 1321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 478 place count 612 transition count 1322
Applied a total of 478 rules in 179 ms. Remains 612 /852 variables (removed 240) and now considering 1322/1561 (removed 239) transitions.
// Phase 1: matrix 1322 rows 612 cols
[2024-05-23 01:28:50] [INFO ] Computed 80 invariants in 13 ms
[2024-05-23 01:28:51] [INFO ] Implicit Places using invariants in 816 ms returned [88, 94, 99, 182, 187, 264, 270, 275, 354, 360, 365, 442, 448, 453, 530, 536, 541, 609]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 825 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 594/2561 places, 1322/3127 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 594 transition count 1321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 593 transition count 1321
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 582 transition count 1310
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 582 transition count 1310
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 35 place count 571 transition count 1299
Iterating global reduction 2 with 11 rules applied. Total rules applied 46 place count 571 transition count 1299
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 566 transition count 1294
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 566 transition count 1294
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 560 transition count 1288
Applied a total of 68 rules in 144 ms. Remains 560 /594 variables (removed 34) and now considering 1288/1322 (removed 34) transitions.
// Phase 1: matrix 1288 rows 560 cols
[2024-05-23 01:28:51] [INFO ] Computed 62 invariants in 17 ms
[2024-05-23 01:28:52] [INFO ] Implicit Places using invariants in 794 ms returned []
[2024-05-23 01:28:52] [INFO ] Invariant cache hit.
[2024-05-23 01:28:53] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 2247 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 560/2561 places, 1288/3127 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5422 ms. Remains : 560/2561 places, 1288/3127 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s167 0) (EQ s546 1)), p1:(OR (EQ s314 0) (EQ s496 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1214 reset in 260 ms.
Product exploration explored 100000 steps with 1248 reset in 295 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253099 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253099 steps, saw 87774 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:28:57] [INFO ] Invariant cache hit.
[2024-05-23 01:28:57] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:28:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 01:28:57] [INFO ] [Nat]Absence check using 13 positive and 49 generalized place invariants in 28 ms returned sat
[2024-05-23 01:28:58] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:28:58] [INFO ] After 937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-23 01:28:58] [INFO ] After 1118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 560 transition count 1285
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 557 transition count 1285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 557 transition count 1284
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 556 transition count 1284
Free-agglomeration rule applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 37 place count 556 transition count 1255
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 71 place count 527 transition count 1250
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 88 place count 527 transition count 1233
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 105 place count 510 transition count 1233
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 510 transition count 1233
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 510 transition count 1232
Applied a total of 108 rules in 122 ms. Remains 510 /560 variables (removed 50) and now considering 1232/1288 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 510/560 places, 1232/1288 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 144329 steps, run visited all 1 properties in 1396 ms. (steps per millisecond=103 )
Probabilistic random walk after 144329 steps, saw 54216 distinct states, run finished after 1397 ms. (steps per millisecond=103 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Support contains 2 out of 560 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Applied a total of 0 rules in 24 ms. Remains 560 /560 variables (removed 0) and now considering 1288/1288 (removed 0) transitions.
[2024-05-23 01:29:00] [INFO ] Invariant cache hit.
[2024-05-23 01:29:01] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-23 01:29:01] [INFO ] Invariant cache hit.
[2024-05-23 01:29:02] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2024-05-23 01:29:02] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-23 01:29:02] [INFO ] Invariant cache hit.
[2024-05-23 01:29:03] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3560 ms. Remains : 560/560 places, 1288/1288 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 238930 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238930 steps, saw 84355 distinct states, run finished after 3003 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:29:07] [INFO ] Invariant cache hit.
[2024-05-23 01:29:07] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:29:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 01:29:07] [INFO ] [Nat]Absence check using 13 positive and 49 generalized place invariants in 29 ms returned sat
[2024-05-23 01:29:08] [INFO ] After 865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:29:08] [INFO ] After 934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-23 01:29:08] [INFO ] After 1116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 560 transition count 1285
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 557 transition count 1285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 557 transition count 1284
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 556 transition count 1284
Free-agglomeration rule applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 37 place count 556 transition count 1255
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 71 place count 527 transition count 1250
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 88 place count 527 transition count 1233
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 105 place count 510 transition count 1233
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 510 transition count 1233
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 510 transition count 1232
Applied a total of 108 rules in 118 ms. Remains 510 /560 variables (removed 50) and now considering 1232/1288 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 510/560 places, 1232/1288 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 144329 steps, run visited all 1 properties in 1402 ms. (steps per millisecond=102 )
Probabilistic random walk after 144329 steps, saw 54216 distinct states, run finished after 1402 ms. (steps per millisecond=102 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1182 reset in 259 ms.
Product exploration explored 100000 steps with 1226 reset in 292 ms.
Built C files in :
/tmp/ltsmin12635382118796931379
[2024-05-23 01:29:10] [INFO ] Computing symmetric may disable matrix : 1288 transitions.
[2024-05-23 01:29:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:29:10] [INFO ] Computing symmetric may enable matrix : 1288 transitions.
[2024-05-23 01:29:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:29:11] [INFO ] Computing Do-Not-Accords matrix : 1288 transitions.
[2024-05-23 01:29:11] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:29:11] [INFO ] Built C files in 306ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12635382118796931379
Running compilation step : cd /tmp/ltsmin12635382118796931379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12635382118796931379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12635382118796931379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 560 transition count 1285
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 557 transition count 1285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 557 transition count 1284
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 556 transition count 1284
Applied a total of 8 rules in 33 ms. Remains 556 /560 variables (removed 4) and now considering 1284/1288 (removed 4) transitions.
// Phase 1: matrix 1284 rows 556 cols
[2024-05-23 01:29:14] [INFO ] Computed 62 invariants in 12 ms
[2024-05-23 01:29:14] [INFO ] Implicit Places using invariants in 698 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 700 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 555/560 places, 1284/1288 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 554 transition count 1283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 553 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 553 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 552 transition count 1281
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 552 transition count 1281
Applied a total of 6 rules in 72 ms. Remains 552 /555 variables (removed 3) and now considering 1281/1284 (removed 3) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-05-23 01:29:14] [INFO ] Computed 61 invariants in 12 ms
[2024-05-23 01:29:15] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-23 01:29:15] [INFO ] Invariant cache hit.
[2024-05-23 01:29:17] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/560 places, 1281/1288 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3185 ms. Remains : 552/560 places, 1281/1288 transitions.
Built C files in :
/tmp/ltsmin15017571920625913850
[2024-05-23 01:29:17] [INFO ] Computing symmetric may disable matrix : 1281 transitions.
[2024-05-23 01:29:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:29:17] [INFO ] Computing symmetric may enable matrix : 1281 transitions.
[2024-05-23 01:29:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:29:17] [INFO ] Computing Do-Not-Accords matrix : 1281 transitions.
[2024-05-23 01:29:17] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:29:17] [INFO ] Built C files in 303ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15017571920625913850
Running compilation step : cd /tmp/ltsmin15017571920625913850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15017571920625913850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15017571920625913850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 01:29:20] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:29:20] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:29:20] [INFO ] Time to serialize gal into /tmp/LTL17720785054097773232.gal : 7 ms
[2024-05-23 01:29:20] [INFO ] Time to serialize properties into /tmp/LTL6705515291570506216.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17720785054097773232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7633696862203803580.hoa' '-atoms' '/tmp/LTL6705515291570506216.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6705515291570506216.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7633696862203803580.hoa
Detected timeout of ITS tools.
[2024-05-23 01:29:35] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:29:35] [INFO ] Flatten gal took : 41 ms
[2024-05-23 01:29:35] [INFO ] Time to serialize gal into /tmp/LTL14000724966603764742.gal : 7 ms
[2024-05-23 01:29:35] [INFO ] Time to serialize properties into /tmp/LTL8959289043521976678.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14000724966603764742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8959289043521976678.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((p703==0)||(p2603==1))"))&&(F(G("((p1399==0)||(p2406==1))")))))
Formula 0 simplified : G!"((p703==0)||(p2603==1))" | GF!"((p1399==0)||(p2406==1))"
Detected timeout of ITS tools.
[2024-05-23 01:29:50] [INFO ] Flatten gal took : 38 ms
[2024-05-23 01:29:50] [INFO ] Applying decomposition
[2024-05-23 01:29:50] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4223042910109920303.txt' '-o' '/tmp/graph4223042910109920303.bin' '-w' '/tmp/graph4223042910109920303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4223042910109920303.bin' '-l' '-1' '-v' '-w' '/tmp/graph4223042910109920303.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:29:51] [INFO ] Decomposing Gal with order
[2024-05-23 01:29:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:29:51] [INFO ] Removed a total of 2520 redundant transitions.
[2024-05-23 01:29:51] [INFO ] Flatten gal took : 72 ms
[2024-05-23 01:29:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 20 ms.
[2024-05-23 01:29:51] [INFO ] Time to serialize gal into /tmp/LTL10123221056584473489.gal : 9 ms
[2024-05-23 01:29:51] [INFO ] Time to serialize properties into /tmp/LTL6851710929497003510.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10123221056584473489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6851710929497003510.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((i3.u46.p703==0)||(i12.i1.u140.p2603==1))"))&&(F(G("((i4.u74.p1399==0)||(i12.i0.u120.p2406==1))")))))
Formula 0 simplified : G!"((i3.u46.p703==0)||(i12.i1.u140.p2603==1))" | GF!"((i4.u74.p1399==0)||(i12.i0.u120.p2406==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4280743789985077238
[2024-05-23 01:30:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4280743789985077238
Running compilation step : cd /tmp/ltsmin4280743789985077238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4280743789985077238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4280743789985077238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06b-LTLCardinality-12 finished in 81208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2560 transition count 2651
Reduce places removed 475 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 482 rules applied. Total rules applied 957 place count 2085 transition count 2644
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 962 place count 2081 transition count 2643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 963 place count 2080 transition count 2643
Performed 687 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 687 Pre rules applied. Total rules applied 963 place count 2080 transition count 1956
Deduced a syphon composed of 687 places in 6 ms
Ensure Unique test removed 64 places
Reduce places removed 751 places and 0 transitions.
Iterating global reduction 4 with 1438 rules applied. Total rules applied 2401 place count 1329 transition count 1956
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2447 place count 1323 transition count 1916
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2487 place count 1283 transition count 1916
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 2487 place count 1283 transition count 1891
Deduced a syphon composed of 25 places in 8 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 75 rules applied. Total rules applied 2562 place count 1233 transition count 1891
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2562 place count 1233 transition count 1867
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2610 place count 1209 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2611 place count 1208 transition count 1859
Iterating global reduction 6 with 1 rules applied. Total rules applied 2612 place count 1208 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2613 place count 1207 transition count 1851
Iterating global reduction 6 with 1 rules applied. Total rules applied 2614 place count 1207 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2615 place count 1206 transition count 1843
Iterating global reduction 6 with 1 rules applied. Total rules applied 2616 place count 1206 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2617 place count 1205 transition count 1835
Iterating global reduction 6 with 1 rules applied. Total rules applied 2618 place count 1205 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2619 place count 1204 transition count 1827
Iterating global reduction 6 with 1 rules applied. Total rules applied 2620 place count 1204 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2621 place count 1203 transition count 1819
Iterating global reduction 6 with 1 rules applied. Total rules applied 2622 place count 1203 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2623 place count 1202 transition count 1811
Iterating global reduction 6 with 1 rules applied. Total rules applied 2624 place count 1202 transition count 1811
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 6 with 380 rules applied. Total rules applied 3004 place count 1012 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3005 place count 1011 transition count 1620
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 3007 place count 1010 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3008 place count 1009 transition count 1619
Iterating global reduction 6 with 1 rules applied. Total rules applied 3009 place count 1009 transition count 1619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 3011 place count 1009 transition count 1617
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3012 place count 1008 transition count 1617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3014 place count 1007 transition count 1626
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3016 place count 1005 transition count 1624
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 18 rules applied. Total rules applied 3034 place count 993 transition count 1618
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3040 place count 987 transition count 1618
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 18 Pre rules applied. Total rules applied 3040 place count 987 transition count 1600
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 37 rules applied. Total rules applied 3077 place count 968 transition count 1600
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 10 with 13 rules applied. Total rules applied 3090 place count 955 transition count 1600
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 3090 place count 955 transition count 1599
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3092 place count 954 transition count 1599
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 38 rules applied. Total rules applied 3130 place count 935 transition count 1580
Discarding 12 places :
Symmetric choice reduction at 11 with 12 rule applications. Total rules 3142 place count 923 transition count 1568
Iterating global reduction 11 with 12 rules applied. Total rules applied 3154 place count 923 transition count 1568
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 3160 place count 917 transition count 1562
Iterating global reduction 11 with 6 rules applied. Total rules applied 3166 place count 917 transition count 1562
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3172 place count 917 transition count 1556
Applied a total of 3172 rules in 908 ms. Remains 917 /2561 variables (removed 1644) and now considering 1556/3127 (removed 1571) transitions.
// Phase 1: matrix 1556 rows 917 cols
[2024-05-23 01:30:10] [INFO ] Computed 155 invariants in 19 ms
[2024-05-23 01:30:11] [INFO ] Implicit Places using invariants in 1563 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 745, 746, 749, 760, 761, 762, 780, 782, 786, 804, 805, 806, 807, 821, 827, 833, 839, 845, 851, 857, 863, 869, 875, 881]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1565 ms to find 70 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 847/2561 places, 1556/3127 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 847 transition count 1434
Reduce places removed 122 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 123 rules applied. Total rules applied 245 place count 725 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 724 transition count 1433
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 246 place count 724 transition count 1402
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 309 place count 692 transition count 1402
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 321 place count 688 transition count 1394
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 329 place count 680 transition count 1394
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 344 place count 665 transition count 1379
Iterating global reduction 5 with 15 rules applied. Total rules applied 359 place count 665 transition count 1379
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 362 place count 665 transition count 1376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 362 place count 665 transition count 1375
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 664 transition count 1375
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 367 place count 661 transition count 1369
Iterating global reduction 6 with 3 rules applied. Total rules applied 370 place count 661 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 371 place count 660 transition count 1368
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 660 transition count 1368
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 474 place count 609 transition count 1317
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 476 place count 608 transition count 1318
Applied a total of 476 rules in 157 ms. Remains 608 /847 variables (removed 239) and now considering 1318/1556 (removed 238) transitions.
// Phase 1: matrix 1318 rows 608 cols
[2024-05-23 01:30:11] [INFO ] Computed 80 invariants in 12 ms
[2024-05-23 01:30:12] [INFO ] Implicit Places using invariants in 847 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 533, 538, 605]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 849 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 589/2561 places, 1318/3127 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 589 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 588 transition count 1317
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 576 transition count 1305
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 576 transition count 1305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 564 transition count 1293
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 564 transition count 1293
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 558 transition count 1287
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 558 transition count 1287
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 552 transition count 1281
Applied a total of 74 rules in 143 ms. Remains 552 /589 variables (removed 37) and now considering 1281/1318 (removed 37) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-05-23 01:30:12] [INFO ] Computed 61 invariants in 17 ms
[2024-05-23 01:30:13] [INFO ] Implicit Places using invariants in 742 ms returned []
[2024-05-23 01:30:13] [INFO ] Invariant cache hit.
[2024-05-23 01:30:15] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 552/2561 places, 1281/3127 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5956 ms. Remains : 552/2561 places, 1281/3127 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s547 0) (EQ s481 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1300 reset in 257 ms.
Stack based approach found an accepted trace after 26550 steps with 338 reset with depth 304 and stack size 304 in 78 ms.
FORMULA ASLink-PT-06b-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-06b-LTLCardinality-15 finished in 6367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(X(p1)||G(p0))))))'
Found a Shortening insensitive property : ASLink-PT-06b-LTLCardinality-00
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2561 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2561/2561 places, 3127/3127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 474 transitions
Trivial Post-agglo rules discarded 474 transitions
Performed 474 trivial Post agglomeration. Transition count delta: 474
Iterating post reduction 0 with 474 rules applied. Total rules applied 474 place count 2560 transition count 2652
Reduce places removed 474 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 479 rules applied. Total rules applied 953 place count 2086 transition count 2647
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 957 place count 2083 transition count 2646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 958 place count 2082 transition count 2646
Performed 685 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 685 Pre rules applied. Total rules applied 958 place count 2082 transition count 1961
Deduced a syphon composed of 685 places in 6 ms
Ensure Unique test removed 62 places
Reduce places removed 747 places and 0 transitions.
Iterating global reduction 4 with 1432 rules applied. Total rules applied 2390 place count 1335 transition count 1961
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 4 with 45 rules applied. Total rules applied 2435 place count 1329 transition count 1922
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 2474 place count 1290 transition count 1922
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2474 place count 1290 transition count 1898
Deduced a syphon composed of 24 places in 5 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2546 place count 1242 transition count 1898
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2546 place count 1242 transition count 1875
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2592 place count 1219 transition count 1875
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2593 place count 1218 transition count 1867
Iterating global reduction 6 with 1 rules applied. Total rules applied 2594 place count 1218 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2595 place count 1217 transition count 1859
Iterating global reduction 6 with 1 rules applied. Total rules applied 2596 place count 1217 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2597 place count 1216 transition count 1851
Iterating global reduction 6 with 1 rules applied. Total rules applied 2598 place count 1216 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2599 place count 1215 transition count 1843
Iterating global reduction 6 with 1 rules applied. Total rules applied 2600 place count 1215 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2601 place count 1214 transition count 1835
Iterating global reduction 6 with 1 rules applied. Total rules applied 2602 place count 1214 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2603 place count 1213 transition count 1827
Iterating global reduction 6 with 1 rules applied. Total rules applied 2604 place count 1213 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2605 place count 1212 transition count 1819
Iterating global reduction 6 with 1 rules applied. Total rules applied 2606 place count 1212 transition count 1819
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 3 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 6 with 386 rules applied. Total rules applied 2992 place count 1019 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2993 place count 1018 transition count 1625
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 2995 place count 1017 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2996 place count 1016 transition count 1624
Iterating global reduction 6 with 1 rules applied. Total rules applied 2997 place count 1016 transition count 1624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 2999 place count 1016 transition count 1622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3000 place count 1015 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3002 place count 1014 transition count 1631
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3004 place count 1012 transition count 1629
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 16 rules applied. Total rules applied 3020 place count 1001 transition count 1624
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3025 place count 996 transition count 1624
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 17 Pre rules applied. Total rules applied 3025 place count 996 transition count 1607
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 35 rules applied. Total rules applied 3060 place count 978 transition count 1607
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 10 with 12 rules applied. Total rules applied 3072 place count 966 transition count 1607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 3072 place count 966 transition count 1606
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3074 place count 965 transition count 1606
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 3110 place count 947 transition count 1588
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 3121 place count 936 transition count 1577
Iterating global reduction 11 with 11 rules applied. Total rules applied 3132 place count 936 transition count 1577
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 3138 place count 930 transition count 1571
Iterating global reduction 11 with 6 rules applied. Total rules applied 3144 place count 930 transition count 1571
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3150 place count 930 transition count 1565
Applied a total of 3150 rules in 947 ms. Remains 930 /2561 variables (removed 1631) and now considering 1565/3127 (removed 1562) transitions.
// Phase 1: matrix 1565 rows 930 cols
[2024-05-23 01:30:16] [INFO ] Computed 160 invariants in 20 ms
[2024-05-23 01:30:18] [INFO ] Implicit Places using invariants in 1485 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 206, 264, 265, 277, 278, 279, 280, 282, 299, 317, 337, 368, 371, 392, 393, 405, 406, 408, 425, 443, 463, 514, 515, 527, 528, 530, 547, 565, 585, 636, 637, 649, 650, 652, 669, 687, 707, 758, 759, 762, 773, 774, 775, 793, 795, 799, 817, 818, 819, 820, 833, 840, 846, 852, 858, 864, 870, 876, 882, 888, 894]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 1487 ms to find 74 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 856/2561 places, 1565/3127 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 856 transition count 1443
Reduce places removed 122 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 124 rules applied. Total rules applied 246 place count 734 transition count 1441
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 248 place count 732 transition count 1441
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 248 place count 732 transition count 1409
Deduced a syphon composed of 32 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 65 rules applied. Total rules applied 313 place count 699 transition count 1409
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 325 place count 695 transition count 1401
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 333 place count 687 transition count 1401
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 347 place count 673 transition count 1387
Iterating global reduction 5 with 14 rules applied. Total rules applied 361 place count 673 transition count 1387
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 364 place count 673 transition count 1384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 364 place count 673 transition count 1383
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 366 place count 672 transition count 1383
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 368 place count 670 transition count 1379
Iterating global reduction 6 with 2 rules applied. Total rules applied 370 place count 670 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 371 place count 669 transition count 1378
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 669 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 668 transition count 1376
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 668 transition count 1376
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 480 place count 615 transition count 1323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 484 place count 613 transition count 1323
Applied a total of 484 rules in 241 ms. Remains 613 /856 variables (removed 243) and now considering 1323/1565 (removed 242) transitions.
// Phase 1: matrix 1323 rows 613 cols
[2024-05-23 01:30:18] [INFO ] Computed 81 invariants in 13 ms
[2024-05-23 01:30:19] [INFO ] Implicit Places using invariants in 793 ms returned [88, 94, 99, 174, 180, 185, 274, 279, 356, 362, 367, 444, 450, 455, 532, 538, 543, 610]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 794 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 595/2561 places, 1323/3127 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 595 transition count 1322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 594 transition count 1322
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 583 transition count 1311
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 583 transition count 1311
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 35 place count 572 transition count 1300
Iterating global reduction 2 with 11 rules applied. Total rules applied 46 place count 572 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 567 transition count 1295
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 567 transition count 1295
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 561 transition count 1289
Applied a total of 68 rules in 95 ms. Remains 561 /595 variables (removed 34) and now considering 1289/1323 (removed 34) transitions.
// Phase 1: matrix 1289 rows 561 cols
[2024-05-23 01:30:19] [INFO ] Computed 63 invariants in 12 ms
[2024-05-23 01:30:20] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-23 01:30:20] [INFO ] Invariant cache hit.
[2024-05-23 01:30:22] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 561/2561 places, 1289/3127 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 6126 ms. Remains : 561/2561 places, 1289/3127 transitions.
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s250 0), p1:(AND (EQ s168 0) (EQ s549 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1521 reset in 287 ms.
Product exploration explored 100000 steps with 1503 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 269 steps, including 7 resets, run visited all 3 properties in 7 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 278 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1289/1289 transitions.
Applied a total of 0 rules in 15 ms. Remains 561 /561 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2024-05-23 01:30:23] [INFO ] Invariant cache hit.
[2024-05-23 01:30:24] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-23 01:30:24] [INFO ] Invariant cache hit.
[2024-05-23 01:30:25] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
[2024-05-23 01:30:25] [INFO ] Invariant cache hit.
[2024-05-23 01:30:27] [INFO ] Dead Transitions using invariants and state equation in 1300 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3601 ms. Remains : 561/561 places, 1289/1289 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 981 steps, including 6 resets, run visited all 3 properties in 25 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 229 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1580 reset in 287 ms.
Product exploration explored 100000 steps with 1582 reset in 315 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 1289/1289 transitions.
Applied a total of 0 rules in 21 ms. Remains 561 /561 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2024-05-23 01:30:29] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-23 01:30:29] [INFO ] Invariant cache hit.
[2024-05-23 01:30:30] [INFO ] Dead Transitions using invariants and state equation in 1307 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1366 ms. Remains : 561/561 places, 1289/1289 transitions.
Built C files in :
/tmp/ltsmin13945856655944819337
[2024-05-23 01:30:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13945856655944819337
Running compilation step : cd /tmp/ltsmin13945856655944819337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13945856655944819337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13945856655944819337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1289/1289 transitions.
Applied a total of 0 rules in 15 ms. Remains 561 /561 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2024-05-23 01:30:33] [INFO ] Invariant cache hit.
[2024-05-23 01:30:34] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-23 01:30:34] [INFO ] Invariant cache hit.
[2024-05-23 01:30:36] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
[2024-05-23 01:30:36] [INFO ] Invariant cache hit.
[2024-05-23 01:30:37] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3543 ms. Remains : 561/561 places, 1289/1289 transitions.
Built C files in :
/tmp/ltsmin9085183384211265960
[2024-05-23 01:30:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9085183384211265960
Running compilation step : cd /tmp/ltsmin9085183384211265960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9085183384211265960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9085183384211265960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 01:30:40] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:30:40] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:30:40] [INFO ] Time to serialize gal into /tmp/LTL14638984478845404363.gal : 6 ms
[2024-05-23 01:30:40] [INFO ] Time to serialize properties into /tmp/LTL9095358141896099810.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14638984478845404363.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7942794447880615990.hoa' '-atoms' '/tmp/LTL9095358141896099810.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9095358141896099810.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7942794447880615990.hoa
Detected timeout of ITS tools.
[2024-05-23 01:30:55] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:30:55] [INFO ] Flatten gal took : 40 ms
[2024-05-23 01:30:55] [INFO ] Time to serialize gal into /tmp/LTL9191098967788098163.gal : 6 ms
[2024-05-23 01:30:55] [INFO ] Time to serialize properties into /tmp/LTL9309085834977073837.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9191098967788098163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9309085834977073837.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(p1097==0)"))&&((X("((p784==0)&&(p2660==1))"))||(G("(p1097==0)")))))))
Formula 0 simplified : XG(G!"(p1097==0)" | (X!"((p784==0)&&(p2660==1))" & F!"(p1097==0)"))
Detected timeout of ITS tools.
[2024-05-23 01:31:10] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:31:10] [INFO ] Applying decomposition
[2024-05-23 01:31:10] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2731654058079527284.txt' '-o' '/tmp/graph2731654058079527284.bin' '-w' '/tmp/graph2731654058079527284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2731654058079527284.bin' '-l' '-1' '-v' '-w' '/tmp/graph2731654058079527284.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:31:10] [INFO ] Decomposing Gal with order
[2024-05-23 01:31:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:31:10] [INFO ] Removed a total of 2556 redundant transitions.
[2024-05-23 01:31:10] [INFO ] Flatten gal took : 66 ms
[2024-05-23 01:31:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 25 ms.
[2024-05-23 01:31:10] [INFO ] Time to serialize gal into /tmp/LTL16192886082202525238.gal : 9 ms
[2024-05-23 01:31:10] [INFO ] Time to serialize properties into /tmp/LTL13669095233455719700.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16192886082202525238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13669095233455719700.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(i5.u67.p1097==0)"))&&((X("((i3.u46.p784==0)&&(i12.i1.u143.p2660==1))"))||(G("(i5.u67.p1097==0)")))))))
Formula 0 simplified : XG(G!"(i5.u67.p1097==0)" | (X!"((i3.u46.p784==0)&&(i12.i1.u143.p2660==1))" & F!"(i5.u67.p1097==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8810426096384579928
[2024-05-23 01:31:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8810426096384579928
Running compilation step : cd /tmp/ltsmin8810426096384579928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8810426096384579928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8810426096384579928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06b-LTLCardinality-00 finished in 73197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
[2024-05-23 01:31:29] [INFO ] Flatten gal took : 78 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8367612187843560090
[2024-05-23 01:31:29] [INFO ] Too many transitions (3127) to apply POR reductions. Disabling POR matrices.
[2024-05-23 01:31:29] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8367612187843560090
Running compilation step : cd /tmp/ltsmin8367612187843560090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 01:31:29] [INFO ] Applying decomposition
[2024-05-23 01:31:29] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7373683676812099436.txt' '-o' '/tmp/graph7373683676812099436.bin' '-w' '/tmp/graph7373683676812099436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7373683676812099436.bin' '-l' '-1' '-v' '-w' '/tmp/graph7373683676812099436.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:31:29] [INFO ] Decomposing Gal with order
[2024-05-23 01:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:31:30] [INFO ] Removed a total of 2362 redundant transitions.
[2024-05-23 01:31:30] [INFO ] Flatten gal took : 156 ms
[2024-05-23 01:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 23 ms.
[2024-05-23 01:31:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality9167727641764191851.gal : 28 ms
[2024-05-23 01:31:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality9897033470671991159.ltl : 18 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9167727641764191851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9897033470671991159.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((X(F((F("(i12.i1.i1.u380.p1097==0)"))&&((X("((i9.i0.i3.u275.p784==0)&&(i28.u929.p2660==1))"))||(G("(i12.i1.i1.u380.p1097==0)")))))))
Formula 0 simplified : XG(G!"(i12.i1.i1.u380.p1097==0)" | (X!"((i9.i0.i3.u275.p784==0)&&(i28.u929.p2660==1))" & F!"(i12.i1.i1.u380.p1097==0)"))
Compilation finished in 13797 ms.
Running link step : cd /tmp/ltsmin8367612187843560090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin8367612187843560090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((<>((LTLAPp0==true))&&(X((LTLAPp1==true))||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8367612187843560090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((<>((LTLAPp0==true))&&(X((LTLAPp1==true))||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8367612187843560090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp2==true))||X(X(<>((LTLAPp3==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 01:54:54] [INFO ] Applying decomposition
[2024-05-23 01:54:55] [INFO ] Flatten gal took : 198 ms
[2024-05-23 01:54:55] [INFO ] Decomposing Gal with order
[2024-05-23 01:54:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:54:55] [INFO ] Removed a total of 2165 redundant transitions.
[2024-05-23 01:54:55] [INFO ] Flatten gal took : 326 ms
[2024-05-23 01:54:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 3455 labels/synchronizations in 252 ms.
[2024-05-23 01:54:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality510251353447153028.gal : 51 ms
[2024-05-23 01:54:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality10801032965125092995.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality510251353447153028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10801032965125092995.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((X(F((F("(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i3.i0.u128.p1097==0)"))&&((X("((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u95.p784==0)&&(i1.i1....241
Formula 0 simplified : XG(G!"(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i3.i0.u128.p1097==0)" | (X!"((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u95.p784==0)&&(i1.i1.u304....229
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8367612187843560090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp2==true))||X(X(<>((LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8367612187843560090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8367612187843560090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8367612187843560090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp5==true))&&<>([]((LTLAPp6==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 02:18:22] [INFO ] Flatten gal took : 235 ms
[2024-05-23 02:18:22] [INFO ] Input system was already deterministic with 3127 transitions.
[2024-05-23 02:18:22] [INFO ] Transformed 2561 places.
[2024-05-23 02:18:22] [INFO ] Transformed 3127 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-23 02:18:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality275244545179613204.gal : 11 ms
[2024-05-23 02:18:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality11503884338287897793.ltl : 5 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality275244545179613204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11503884338287897793.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((F("(p1097==0)"))&&((X("((p784==0)&&(p2660==1))"))||(G("(p1097==0)")))))))
Formula 0 simplified : XG(G!"(p1097==0)" | (X!"((p784==0)&&(p2660==1))" & F!"(p1097==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13760632 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16036368 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ASLink-PT-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ASLink-PT-06b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-smll-171620127800062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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