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-171620128200238.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 Anderson-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128200238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M 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 Anderson-PT-12-LTLFireability-00
FORMULA_NAME Anderson-PT-12-LTLFireability-01
FORMULA_NAME Anderson-PT-12-LTLFireability-02
FORMULA_NAME Anderson-PT-12-LTLFireability-03
FORMULA_NAME Anderson-PT-12-LTLFireability-04
FORMULA_NAME Anderson-PT-12-LTLFireability-05
FORMULA_NAME Anderson-PT-12-LTLFireability-06
FORMULA_NAME Anderson-PT-12-LTLFireability-07
FORMULA_NAME Anderson-PT-12-LTLFireability-08
FORMULA_NAME Anderson-PT-12-LTLFireability-09
FORMULA_NAME Anderson-PT-12-LTLFireability-10
FORMULA_NAME Anderson-PT-12-LTLFireability-11
FORMULA_NAME Anderson-PT-12-LTLFireability-12
FORMULA_NAME Anderson-PT-12-LTLFireability-13
FORMULA_NAME Anderson-PT-12-LTLFireability-14
FORMULA_NAME Anderson-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716535836378

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 07:30:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 07:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:30:39] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2024-05-24 07:30:39] [INFO ] Transformed 889 places.
[2024-05-24 07:30:39] [INFO ] Transformed 4152 transitions.
[2024-05-24 07:30:39] [INFO ] Found NUPN structural information;
[2024-05-24 07:30:39] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 238 place count 651 transition count 1516
Iterating global reduction 0 with 238 rules applied. Total rules applied 476 place count 651 transition count 1516
Applied a total of 476 rules in 224 ms. Remains 651 /889 variables (removed 238) and now considering 1516/4152 (removed 2636) transitions.
// Phase 1: matrix 1516 rows 651 cols
[2024-05-24 07:30:40] [INFO ] Computed 27 invariants in 112 ms
[2024-05-24 07:30:41] [INFO ] Implicit Places using invariants in 1615 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1664 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/889 places, 1516/4152 transitions.
Applied a total of 0 rules in 33 ms. Remains 650 /650 variables (removed 0) and now considering 1516/1516 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1924 ms. Remains : 650/889 places, 1516/4152 transitions.
Support contains 47 out of 650 places after structural reductions.
[2024-05-24 07:30:42] [INFO ] Flatten gal took : 213 ms
[2024-05-24 07:30:42] [INFO ] Flatten gal took : 131 ms
[2024-05-24 07:30:42] [INFO ] Input system was already deterministic with 1516 transitions.
Support contains 46 out of 650 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 29) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 1516 rows 650 cols
[2024-05-24 07:30:43] [INFO ] Computed 26 invariants in 52 ms
[2024-05-24 07:30:44] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-24 07:30:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2024-05-24 07:30:45] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 39 ms returned sat
[2024-05-24 07:30:52] [INFO ] After 6571ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2024-05-24 07:30:52] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:30:56] [INFO ] After 4262ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :1 sat :23
[2024-05-24 07:31:03] [INFO ] After 10890ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :23
Attempting to minimize the solution found.
Minimization took 4104 ms.
[2024-05-24 07:31:07] [INFO ] After 22655ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :23
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 2 properties in 285 ms.
Support contains 31 out of 650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 650 transition count 1389
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 1 with 127 rules applied. Total rules applied 254 place count 523 transition count 1389
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 254 place count 523 transition count 1259
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 514 place count 393 transition count 1259
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 521 place count 386 transition count 1120
Iterating global reduction 2 with 7 rules applied. Total rules applied 528 place count 386 transition count 1120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 532 place count 384 transition count 1118
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 549 place count 384 transition count 1101
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 566 place count 367 transition count 1101
Applied a total of 566 rules in 332 ms. Remains 367 /650 variables (removed 283) and now considering 1101/1516 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 367/650 places, 1101/1516 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1101 rows 367 cols
[2024-05-24 07:31:08] [INFO ] Computed 26 invariants in 36 ms
[2024-05-24 07:31:08] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-24 07:31:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-24 07:31:08] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 16 ms returned sat
[2024-05-24 07:31:10] [INFO ] After 1564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-24 07:31:10] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:31:12] [INFO ] After 1565ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-24 07:31:13] [INFO ] After 3108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1401 ms.
[2024-05-24 07:31:15] [INFO ] After 6444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 1 properties in 108 ms.
Support contains 21 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 1101/1101 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 362 transition count 986
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 362 transition count 986
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 360 transition count 984
Applied a total of 14 rules in 62 ms. Remains 360 /367 variables (removed 7) and now considering 984/1101 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 360/367 places, 984/1101 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) 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 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 984 rows 360 cols
[2024-05-24 07:31:16] [INFO ] Computed 26 invariants in 7 ms
[2024-05-24 07:31:16] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-24 07:31:16] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 14 ms returned sat
[2024-05-24 07:31:17] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 07:31:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-24 07:31:17] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 11 ms returned sat
[2024-05-24 07:31:17] [INFO ] After 746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 07:31:17] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:31:18] [INFO ] After 502ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 07:31:18] [INFO ] After 998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 427 ms.
[2024-05-24 07:31:19] [INFO ] After 2351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 48 ms.
Support contains 8 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 984/984 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 353 transition count 823
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 353 transition count 823
Applied a total of 14 rules in 40 ms. Remains 353 /360 variables (removed 7) and now considering 823/984 (removed 161) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 353/360 places, 823/984 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 823 rows 353 cols
[2024-05-24 07:31:20] [INFO ] Computed 26 invariants in 6 ms
[2024-05-24 07:31:20] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-24 07:31:20] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 17 ms returned sat
[2024-05-24 07:31:20] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:31:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-24 07:31:20] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 17 ms returned sat
[2024-05-24 07:31:21] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 07:31:21] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:31:21] [INFO ] After 319ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:31:21] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-24 07:31:21] [INFO ] After 1232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 823/823 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 351 transition count 777
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 351 transition count 777
Applied a total of 4 rules in 28 ms. Remains 351 /353 variables (removed 2) and now considering 777/823 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 351/353 places, 777/823 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Finished probabilistic random walk after 720902 steps, run visited all 2 properties in 2958 ms. (steps per millisecond=243 )
Probabilistic random walk after 720902 steps, saw 553385 distinct states, run finished after 2958 ms. (steps per millisecond=243 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 650 transition count 1374
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 508 transition count 1374
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 284 place count 508 transition count 1242
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 548 place count 376 transition count 1242
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 572 place count 352 transition count 756
Iterating global reduction 2 with 24 rules applied. Total rules applied 596 place count 352 transition count 756
Applied a total of 596 rules in 67 ms. Remains 352 /650 variables (removed 298) and now considering 756/1516 (removed 760) transitions.
// Phase 1: matrix 756 rows 352 cols
[2024-05-24 07:31:25] [INFO ] Computed 26 invariants in 15 ms
[2024-05-24 07:31:26] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-24 07:31:26] [INFO ] Invariant cache hit.
[2024-05-24 07:31:26] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:31:27] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
[2024-05-24 07:31:27] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-24 07:31:27] [INFO ] Invariant cache hit.
[2024-05-24 07:31:28] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/650 places, 756/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3392 ms. Remains : 352/650 places, 756/1516 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 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s41 0)), p1:(OR (NEQ s32 1) (NEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 459 ms.
Product exploration explored 100000 steps with 0 reset in 483 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 (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 707578 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{1=1}
Probabilistic random walk after 707578 steps, saw 542839 distinct states, run finished after 3009 ms. (steps per millisecond=235 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-24 07:31:33] [INFO ] Invariant cache hit.
[2024-05-24 07:31:33] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:31:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-24 07:31:33] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 23 ms returned sat
[2024-05-24 07:31:33] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-00 finished in 8352 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((p0&&F(p1)))||X(X(G(p2)))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 626 transition count 1030
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 626 transition count 1030
Applied a total of 48 rules in 41 ms. Remains 626 /650 variables (removed 24) and now considering 1030/1516 (removed 486) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-24 07:31:33] [INFO ] Computed 26 invariants in 18 ms
[2024-05-24 07:31:34] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-24 07:31:34] [INFO ] Invariant cache hit.
[2024-05-24 07:31:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:31:38] [INFO ] Implicit Places using invariants and state equation in 4220 ms returned []
Implicit Place search using SMT with State Equation took 4905 ms to find 0 implicit places.
[2024-05-24 07:31:38] [INFO ] Invariant cache hit.
[2024-05-24 07:31:40] [INFO ] Dead Transitions using invariants and state equation in 1645 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 626/650 places, 1030/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6594 ms. Remains : 626/650 places, 1030/1516 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s47 0)), p2:(AND (EQ s22 1) (EQ s42 1)), p1:(AND (EQ s30 1) (EQ s47 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 243 ms.
Stack based approach found an accepted trace after 220 steps with 0 reset with depth 221 and stack size 221 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-02 finished in 7202 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(G(p0))))'
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 625 transition count 1007
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 625 transition count 1007
Applied a total of 50 rules in 47 ms. Remains 625 /650 variables (removed 25) and now considering 1007/1516 (removed 509) transitions.
// Phase 1: matrix 1007 rows 625 cols
[2024-05-24 07:31:41] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:31:42] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-05-24 07:31:42] [INFO ] Invariant cache hit.
[2024-05-24 07:31:42] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:31:45] [INFO ] Implicit Places using invariants and state equation in 3058 ms returned []
Implicit Place search using SMT with State Equation took 3981 ms to find 0 implicit places.
[2024-05-24 07:31:45] [INFO ] Invariant cache hit.
[2024-05-24 07:31:46] [INFO ] Dead Transitions using invariants and state equation in 1389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/650 places, 1007/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5433 ms. Remains : 625/650 places, 1007/1516 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s13 0) (EQ s43 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1592 steps with 0 reset in 4 ms.
FORMULA Anderson-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-03 finished in 5585 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(p1)&&p0))||X(F(p2))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 626 transition count 1030
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 626 transition count 1030
Applied a total of 48 rules in 37 ms. Remains 626 /650 variables (removed 24) and now considering 1030/1516 (removed 486) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-24 07:31:46] [INFO ] Computed 26 invariants in 9 ms
[2024-05-24 07:31:47] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-05-24 07:31:47] [INFO ] Invariant cache hit.
[2024-05-24 07:31:47] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:31:51] [INFO ] Implicit Places using invariants and state equation in 3797 ms returned []
Implicit Place search using SMT with State Equation took 4495 ms to find 0 implicit places.
[2024-05-24 07:31:51] [INFO ] Invariant cache hit.
[2024-05-24 07:31:52] [INFO ] Dead Transitions using invariants and state equation in 1749 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 626/650 places, 1030/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6283 ms. Remains : 626/650 places, 1030/1516 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s40 1)), p1:(AND (EQ s30 1) (EQ s38 1)), p2:(OR (EQ s30 0) (EQ s38 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 912 ms.
Product exploration explored 100000 steps with 50000 reset in 819 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 32 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-07 finished in 8258 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' '!(((p0 U (p1||G(!p2)))&&F(G(p2))))'
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 650 transition count 1375
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 509 transition count 1375
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 282 place count 509 transition count 1243
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 546 place count 377 transition count 1243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 569 place count 354 transition count 780
Iterating global reduction 2 with 23 rules applied. Total rules applied 592 place count 354 transition count 780
Applied a total of 592 rules in 49 ms. Remains 354 /650 variables (removed 296) and now considering 780/1516 (removed 736) transitions.
// Phase 1: matrix 780 rows 354 cols
[2024-05-24 07:31:54] [INFO ] Computed 26 invariants in 6 ms
[2024-05-24 07:31:55] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-24 07:31:55] [INFO ] Invariant cache hit.
[2024-05-24 07:31:55] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:31:57] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2685 ms to find 0 implicit places.
[2024-05-24 07:31:57] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 07:31:57] [INFO ] Invariant cache hit.
[2024-05-24 07:31:58] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 354/650 places, 780/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3716 ms. Remains : 354/650 places, 780/1516 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p1)), true, p2, (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p1 (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s42 1)), p2:(AND (EQ s26 1) (EQ s50 1)), p0:(AND (EQ s23 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Product exploration explored 100000 steps with 0 reset in 321 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 p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 265 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[true, true, p2, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 741382 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 741382 steps, saw 578787 distinct states, run finished after 3003 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:32:02] [INFO ] Invariant cache hit.
[2024-05-24 07:32:02] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-24 07:32:02] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 25 ms returned sat
[2024-05-24 07:32:03] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:32:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-24 07:32:03] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 18 ms returned sat
[2024-05-24 07:32:04] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:32:04] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:04] [INFO ] After 359ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:32:04] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-24 07:32:04] [INFO ] After 1173ms 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 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 780/780 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 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 778
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 352 transition count 778
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 350 transition count 732
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 350 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 349 transition count 731
Applied a total of 10 rules in 66 ms. Remains 349 /354 variables (removed 5) and now considering 731/780 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 349/354 places, 731/780 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 743313 steps, run visited all 1 properties in 2961 ms. (steps per millisecond=251 )
Probabilistic random walk after 743313 steps, saw 579275 distinct states, run finished after 2961 ms. (steps per millisecond=251 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F p2)]
Property proved to be false thanks to negative knowledge :(F p2)
Knowledge based reduction with 12 factoid took 202 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-08 finished in 12976 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(F(p0))||G(p1))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 650 transition count 1373
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 507 transition count 1373
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 507 transition count 1241
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 375 transition count 1241
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 575 place count 350 transition count 732
Iterating global reduction 2 with 25 rules applied. Total rules applied 600 place count 350 transition count 732
Applied a total of 600 rules in 50 ms. Remains 350 /650 variables (removed 300) and now considering 732/1516 (removed 784) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-24 07:32:07] [INFO ] Computed 26 invariants in 6 ms
[2024-05-24 07:32:08] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-24 07:32:08] [INFO ] Invariant cache hit.
[2024-05-24 07:32:08] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:10] [INFO ] Implicit Places using invariants and state equation in 1884 ms returned []
Implicit Place search using SMT with State Equation took 2467 ms to find 0 implicit places.
[2024-05-24 07:32:10] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 07:32:10] [INFO ] Invariant cache hit.
[2024-05-24 07:32:11] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/650 places, 732/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3402 ms. Remains : 350/650 places, 732/1516 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s30 1) (EQ s156 1)), p0:(AND (EQ s16 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 42 reset in 232 ms.
Stack based approach found an accepted trace after 112 steps with 1 reset with depth 84 and stack size 84 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-09 finished in 3736 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((X(p0)||(p1 U (G(!p2) U (p3 U p0))))))'
Support contains 2 out of 650 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 : 650/650 places, 1516/1516 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 650 transition count 1422
Reduce places removed 94 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 118 rules applied. Total rules applied 212 place count 556 transition count 1398
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 236 place count 532 transition count 1398
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 236 place count 532 transition count 1267
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 498 place count 401 transition count 1267
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 522 place count 377 transition count 781
Iterating global reduction 3 with 24 rules applied. Total rules applied 546 place count 377 transition count 781
Applied a total of 546 rules in 56 ms. Remains 377 /650 variables (removed 273) and now considering 781/1516 (removed 735) transitions.
// Phase 1: matrix 781 rows 377 cols
[2024-05-24 07:32:11] [INFO ] Computed 26 invariants in 6 ms
[2024-05-24 07:32:12] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-24 07:32:12] [INFO ] Invariant cache hit.
[2024-05-24 07:32:12] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:14] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
[2024-05-24 07:32:14] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 07:32:14] [INFO ] Invariant cache hit.
[2024-05-24 07:32:15] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 377/650 places, 781/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3498 ms. Remains : 377/650 places, 781/1516 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 30 reset in 221 ms.
Stack based approach found an accepted trace after 149 steps with 1 reset with depth 92 and stack size 92 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-10 finished in 3784 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))'
Support contains 3 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 650 transition count 1396
Reduce places removed 120 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 132 rules applied. Total rules applied 252 place count 530 transition count 1384
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 264 place count 518 transition count 1384
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 264 place count 518 transition count 1253
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 526 place count 387 transition count 1253
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 551 place count 362 transition count 722
Iterating global reduction 3 with 25 rules applied. Total rules applied 576 place count 362 transition count 722
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 3 with 2 rules applied. Total rules applied 578 place count 361 transition count 721
Applied a total of 578 rules in 59 ms. Remains 361 /650 variables (removed 289) and now considering 721/1516 (removed 795) transitions.
// Phase 1: matrix 721 rows 361 cols
[2024-05-24 07:32:15] [INFO ] Computed 26 invariants in 5 ms
[2024-05-24 07:32:15] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-24 07:32:15] [INFO ] Invariant cache hit.
[2024-05-24 07:32:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:17] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2200 ms to find 0 implicit places.
[2024-05-24 07:32:17] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 07:32:17] [INFO ] Invariant cache hit.
[2024-05-24 07:32:18] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 361/650 places, 721/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3201 ms. Remains : 361/650 places, 721/1516 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s101 1) (AND (EQ s0 1) (EQ s198 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 86 reset in 212 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-11 finished in 3468 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(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
Support contains 7 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 628 transition count 1076
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 628 transition count 1076
Applied a total of 44 rules in 36 ms. Remains 628 /650 variables (removed 22) and now considering 1076/1516 (removed 440) transitions.
// Phase 1: matrix 1076 rows 628 cols
[2024-05-24 07:32:18] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:32:19] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-24 07:32:19] [INFO ] Invariant cache hit.
[2024-05-24 07:32:20] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:22] [INFO ] Implicit Places using invariants and state equation in 2974 ms returned []
Implicit Place search using SMT with State Equation took 3630 ms to find 0 implicit places.
[2024-05-24 07:32:22] [INFO ] Invariant cache hit.
[2024-05-24 07:32:24] [INFO ] Dead Transitions using invariants and state equation in 1538 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 628/650 places, 1076/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5207 ms. Remains : 628/650 places, 1076/1516 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : Anderson-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p2 p1), acceptance={0} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s41 0)), p2:(AND (EQ s13 1) (EQ s37 1)), p1:(AND (EQ s24 1) (EQ s46 1) (EQ s24 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 291 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 p2) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 07:32:25] [INFO ] Invariant cache hit.
[2024-05-24 07:32:25] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 07:32:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-05-24 07:32:25] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 29 ms returned sat
[2024-05-24 07:32:26] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-24 07:32:26] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:26] [INFO ] After 269ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-24 07:32:27] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2024-05-24 07:32:27] [INFO ] After 1795ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 628 transition count 935
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 487 transition count 935
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 282 place count 487 transition count 803
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 546 place count 355 transition count 803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 547 place count 354 transition count 780
Iterating global reduction 2 with 1 rules applied. Total rules applied 548 place count 354 transition count 780
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 551 place count 354 transition count 777
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 554 place count 351 transition count 777
Applied a total of 554 rules in 52 ms. Remains 351 /628 variables (removed 277) and now considering 777/1076 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 351/628 places, 777/1076 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31593 steps, run visited all 1 properties in 108 ms. (steps per millisecond=292 )
Probabilistic random walk after 31593 steps, saw 26375 distinct states, run finished after 109 ms. (steps per millisecond=289 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), true, (G (NOT (AND p1 p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Applied a total of 0 rules in 24 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
[2024-05-24 07:32:28] [INFO ] Invariant cache hit.
[2024-05-24 07:32:29] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-05-24 07:32:29] [INFO ] Invariant cache hit.
[2024-05-24 07:32:29] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:33] [INFO ] Implicit Places using invariants and state equation in 3802 ms returned []
Implicit Place search using SMT with State Equation took 4511 ms to find 0 implicit places.
[2024-05-24 07:32:33] [INFO ] Invariant cache hit.
[2024-05-24 07:32:34] [INFO ] Dead Transitions using invariants and state equation in 1371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5919 ms. Remains : 628/628 places, 1076/1076 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 p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-24 07:32:34] [INFO ] Invariant cache hit.
[2024-05-24 07:32:35] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:32:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-24 07:32:35] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 29 ms returned sat
[2024-05-24 07:32:36] [INFO ] After 884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:32:36] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:36] [INFO ] After 601ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:32:36] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 284 ms.
[2024-05-24 07:32:37] [INFO ] After 2098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p2)), true]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p0 p2))]
Knowledge based reduction with 2 factoid took 295 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Product exploration explored 100000 steps with 0 reset in 279 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 628 transition count 1076
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 132 Pre rules applied. Total rules applied 142 place count 628 transition count 1076
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 274 place count 628 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 276 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 278 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 1 ms
Applied a total of 278 rules in 121 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
[2024-05-24 07:32:39] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1030 rows 626 cols
[2024-05-24 07:32:39] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:32:40] [INFO ] Dead Transitions using invariants and state equation in 1542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 626/628 places, 1030/1076 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1693 ms. Remains : 626/628 places, 1030/1076 transitions.
Built C files in :
/tmp/ltsmin1640392380830078582
[2024-05-24 07:32:40] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1640392380830078582
Running compilation step : cd /tmp/ltsmin1640392380830078582;'/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/ltsmin1640392380830078582;'/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/ltsmin1640392380830078582;'/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 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 626 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 626 transition count 1030
Applied a total of 4 rules in 32 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-24 07:32:44] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:32:44] [INFO ] Implicit Places using invariants in 719 ms returned []
[2024-05-24 07:32:44] [INFO ] Invariant cache hit.
[2024-05-24 07:32:45] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:32:47] [INFO ] Implicit Places using invariants and state equation in 3194 ms returned []
Implicit Place search using SMT with State Equation took 3918 ms to find 0 implicit places.
[2024-05-24 07:32:47] [INFO ] Invariant cache hit.
[2024-05-24 07:32:49] [INFO ] Dead Transitions using invariants and state equation in 1652 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 626/628 places, 1030/1076 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5616 ms. Remains : 626/628 places, 1030/1076 transitions.
Built C files in :
/tmp/ltsmin6037479214916562777
[2024-05-24 07:32:49] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6037479214916562777
Running compilation step : cd /tmp/ltsmin6037479214916562777;'/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'
Compilation finished in 2987 ms.
Running link step : cd /tmp/ltsmin6037479214916562777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6037479214916562777;'/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' '--hoa' '/tmp/stateBased2378767176706682565.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 07:33:04] [INFO ] Flatten gal took : 56 ms
[2024-05-24 07:33:04] [INFO ] Flatten gal took : 51 ms
[2024-05-24 07:33:04] [INFO ] Time to serialize gal into /tmp/LTL13725926388948641023.gal : 14 ms
[2024-05-24 07:33:05] [INFO ] Time to serialize properties into /tmp/LTL9691384909688745642.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/LTL13725926388948641023.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11834353571309378199.hoa' '-atoms' '/tmp/LTL9691384909688745642.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/LTL9691384909688745642.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11834353571309378199.hoa
Detected timeout of ITS tools.
[2024-05-24 07:33:20] [INFO ] Flatten gal took : 49 ms
[2024-05-24 07:33:20] [INFO ] Flatten gal took : 46 ms
[2024-05-24 07:33:20] [INFO ] Time to serialize gal into /tmp/LTL2360343874834987400.gal : 9 ms
[2024-05-24 07:33:20] [INFO ] Time to serialize properties into /tmp/LTL10796191196371592896.ltl : 6 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/LTL2360343874834987400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10796191196371592896.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 : !((X(X(X(G((F((G("((next_1!=1)||(ncs_0_9!=1))"))||(("(((next_12!=1)||(ncs_6_11!=1))||((next_12!=1)||(ncs_3_8!=1)))")&&(X("((next_1!=1)...216
Formula 0 simplified : XXXF(!"((next_15==0)||(ncs_3_2==0))" | G(F!"((next_1!=1)||(ncs_0_9!=1))" & (!"(((next_12!=1)||(ncs_6_11!=1))||((next_12!=1)||(ncs_3_...200
Detected timeout of ITS tools.
[2024-05-24 07:33:35] [INFO ] Flatten gal took : 42 ms
[2024-05-24 07:33:35] [INFO ] Applying decomposition
[2024-05-24 07:33:35] [INFO ] Flatten gal took : 41 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/graph15115044389186352292.txt' '-o' '/tmp/graph15115044389186352292.bin' '-w' '/tmp/graph15115044389186352292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15115044389186352292.bin' '-l' '-1' '-v' '-w' '/tmp/graph15115044389186352292.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:33:35] [INFO ] Decomposing Gal with order
[2024-05-24 07:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:33:35] [INFO ] Removed a total of 1915 redundant transitions.
[2024-05-24 07:33:35] [INFO ] Flatten gal took : 186 ms
[2024-05-24 07:33:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 51 ms.
[2024-05-24 07:33:36] [INFO ] Time to serialize gal into /tmp/LTL15666057038647218136.gal : 20 ms
[2024-05-24 07:33:36] [INFO ] Time to serialize properties into /tmp/LTL16913158582299145938.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/LTL15666057038647218136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16913158582299145938.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(X(X(G((F((G("((i0.i0.u0.next_1!=1)||(i0.i1.u89.ncs_0_9!=1))"))||(("(((i0.i0.u5.next_12!=1)||(i2.i0.u210.ncs_6_11!=1))||((i0.i0.u5...308
Formula 0 simplified : XXXF(!"((i0.i1.u6.next_15==0)||(i1.u109.ncs_3_2==0))" | G(F!"((i0.i0.u0.next_1!=1)||(i0.i1.u89.ncs_0_9!=1))" & (!"(((i0.i0.u5.next_1...292
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin374469901695052005
[2024-05-24 07:33:51] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin374469901695052005
Running compilation step : cd /tmp/ltsmin374469901695052005;'/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/ltsmin374469901695052005;'/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/ltsmin374469901695052005;'/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 Anderson-PT-12-LTLFireability-12 finished in 95363 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&&G(F(((p2 U p3)&&p1))))))'
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 650 transition count 1374
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 508 transition count 1374
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 131 Pre rules applied. Total rules applied 284 place count 508 transition count 1243
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 546 place count 377 transition count 1243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 569 place count 354 transition count 758
Iterating global reduction 2 with 23 rules applied. Total rules applied 592 place count 354 transition count 758
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 353 transition count 757
Applied a total of 594 rules in 62 ms. Remains 353 /650 variables (removed 297) and now considering 757/1516 (removed 759) transitions.
// Phase 1: matrix 757 rows 353 cols
[2024-05-24 07:33:54] [INFO ] Computed 26 invariants in 9 ms
[2024-05-24 07:33:54] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-24 07:33:54] [INFO ] Invariant cache hit.
[2024-05-24 07:33:55] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:33:56] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2024-05-24 07:33:56] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 07:33:56] [INFO ] Invariant cache hit.
[2024-05-24 07:33:57] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/650 places, 757/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3296 ms. Remains : 353/650 places, 757/1516 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0), (NOT p3)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=1 dest: 4}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s24 1) (EQ s39 1)), p3:(AND (EQ s21 1) (EQ s49 1)), p2:(EQ s121 1), p0:(OR (EQ s21 0) (EQ s49 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 303 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-13 finished in 3860 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 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 650 transition count 1373
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 507 transition count 1373
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 507 transition count 1241
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 375 transition count 1241
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 575 place count 350 transition count 732
Iterating global reduction 2 with 25 rules applied. Total rules applied 600 place count 350 transition count 732
Applied a total of 600 rules in 48 ms. Remains 350 /650 variables (removed 300) and now considering 732/1516 (removed 784) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-24 07:33:58] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:33:58] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-05-24 07:33:58] [INFO ] Invariant cache hit.
[2024-05-24 07:33:59] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:00] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2487 ms to find 0 implicit places.
[2024-05-24 07:34:00] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 07:34:00] [INFO ] Invariant cache hit.
[2024-05-24 07:34:01] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/650 places, 732/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3547 ms. Remains : 350/650 places, 732/1516 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-14 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 s30 0) (EQ s46 0))], 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 0 reset in 252 ms.
Product exploration explored 100000 steps with 0 reset in 235 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 79 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 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 762622 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 762622 steps, saw 589773 distinct states, run finished after 3002 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:34:05] [INFO ] Invariant cache hit.
[2024-05-24 07:34:05] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:34:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-24 07:34:05] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 16 ms returned sat
[2024-05-24 07:34:05] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:05] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:05] [INFO ] After 126ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:06] [INFO ] After 186ms 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-24 07:34:06] [INFO ] After 649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 731
Applied a total of 2 rules in 25 ms. Remains 349 /350 variables (removed 1) and now considering 731/732 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 349/350 places, 731/732 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 751325 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 751325 steps, saw 580288 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 731 rows 349 cols
[2024-05-24 07:34:09] [INFO ] Computed 26 invariants in 5 ms
[2024-05-24 07:34:09] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:34:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-24 07:34:09] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 17 ms returned sat
[2024-05-24 07:34:09] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:09] [INFO ] After 97ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:09] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-24 07:34:09] [INFO ] After 698ms 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 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 12 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 12 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2024-05-24 07:34:09] [INFO ] Invariant cache hit.
[2024-05-24 07:34:10] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-05-24 07:34:10] [INFO ] Invariant cache hit.
[2024-05-24 07:34:10] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:12] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2338 ms to find 0 implicit places.
[2024-05-24 07:34:12] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 07:34:12] [INFO ] Invariant cache hit.
[2024-05-24 07:34:13] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3121 ms. Remains : 349/349 places, 731/731 transitions.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 14 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2024-05-24 07:34:13] [INFO ] Computed 26 invariants in 4 ms
[2024-05-24 07:34:13] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:34:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 07:34:13] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 16 ms returned sat
[2024-05-24 07:34:13] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:13] [INFO ] After 276ms 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-24 07:34:13] [INFO ] After 404ms 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 87 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 12 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-24 07:34:13] [INFO ] Computed 26 invariants in 5 ms
[2024-05-24 07:34:14] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-05-24 07:34:14] [INFO ] Invariant cache hit.
[2024-05-24 07:34:14] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:16] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
[2024-05-24 07:34:16] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 07:34:16] [INFO ] Invariant cache hit.
[2024-05-24 07:34:17] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3467 ms. Remains : 350/350 places, 732/732 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 77 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 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 746463 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :{}
Probabilistic random walk after 746463 steps, saw 577249 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:34:20] [INFO ] Invariant cache hit.
[2024-05-24 07:34:20] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:34:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-24 07:34:20] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 16 ms returned sat
[2024-05-24 07:34:20] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:20] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:21] [INFO ] After 132ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:21] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-24 07:34:21] [INFO ] After 671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 731
Applied a total of 2 rules in 23 ms. Remains 349 /350 variables (removed 1) and now considering 731/732 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 349/350 places, 731/732 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 768624 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 768624 steps, saw 593329 distinct states, run finished after 3002 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 731 rows 349 cols
[2024-05-24 07:34:24] [INFO ] Computed 26 invariants in 5 ms
[2024-05-24 07:34:24] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:34:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-24 07:34:24] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 16 ms returned sat
[2024-05-24 07:34:24] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:24] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:24] [INFO ] After 99ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:24] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-24 07:34:24] [INFO ] After 693ms 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 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 11 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 10 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2024-05-24 07:34:24] [INFO ] Invariant cache hit.
[2024-05-24 07:34:25] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-05-24 07:34:25] [INFO ] Invariant cache hit.
[2024-05-24 07:34:25] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:27] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2024-05-24 07:34:27] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 07:34:27] [INFO ] Invariant cache hit.
[2024-05-24 07:34:28] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3316 ms. Remains : 349/349 places, 731/731 transitions.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 13 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2024-05-24 07:34:28] [INFO ] Computed 26 invariants in 5 ms
[2024-05-24 07:34:28] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:34:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-24 07:34:28] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 19 ms returned sat
[2024-05-24 07:34:28] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:34:28] [INFO ] After 317ms 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-24 07:34:28] [INFO ] After 450ms 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 80 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 204 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Built C files in :
/tmp/ltsmin2762162318563176492
[2024-05-24 07:34:29] [INFO ] Computing symmetric may disable matrix : 732 transitions.
[2024-05-24 07:34:29] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:34:29] [INFO ] Computing symmetric may enable matrix : 732 transitions.
[2024-05-24 07:34:29] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:34:29] [INFO ] Computing Do-Not-Accords matrix : 732 transitions.
[2024-05-24 07:34:29] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:34:29] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2762162318563176492
Running compilation step : cd /tmp/ltsmin2762162318563176492;'/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/ltsmin2762162318563176492;'/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/ltsmin2762162318563176492;'/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 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 16 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-24 07:34:32] [INFO ] Computed 26 invariants in 5 ms
[2024-05-24 07:34:33] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-05-24 07:34:33] [INFO ] Invariant cache hit.
[2024-05-24 07:34:33] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:34:35] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2384 ms to find 0 implicit places.
[2024-05-24 07:34:35] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 07:34:35] [INFO ] Invariant cache hit.
[2024-05-24 07:34:36] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3314 ms. Remains : 350/350 places, 732/732 transitions.
Built C files in :
/tmp/ltsmin5657687964964237188
[2024-05-24 07:34:36] [INFO ] Computing symmetric may disable matrix : 732 transitions.
[2024-05-24 07:34:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:34:36] [INFO ] Computing symmetric may enable matrix : 732 transitions.
[2024-05-24 07:34:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:34:36] [INFO ] Computing Do-Not-Accords matrix : 732 transitions.
[2024-05-24 07:34:36] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:34:36] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5657687964964237188
Running compilation step : cd /tmp/ltsmin5657687964964237188;'/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/ltsmin5657687964964237188;'/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/ltsmin5657687964964237188;'/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-24 07:34:39] [INFO ] Flatten gal took : 30 ms
[2024-05-24 07:34:39] [INFO ] Flatten gal took : 33 ms
[2024-05-24 07:34:39] [INFO ] Time to serialize gal into /tmp/LTL9016105975517328637.gal : 5 ms
[2024-05-24 07:34:39] [INFO ] Time to serialize properties into /tmp/LTL15318114816459066543.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/LTL9016105975517328637.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16058026603100150894.hoa' '-atoms' '/tmp/LTL15318114816459066543.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/LTL15318114816459066543.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16058026603100150894.hoa
Detected timeout of ITS tools.
[2024-05-24 07:34:54] [INFO ] Flatten gal took : 33 ms
[2024-05-24 07:34:54] [INFO ] Flatten gal took : 36 ms
[2024-05-24 07:34:54] [INFO ] Time to serialize gal into /tmp/LTL9468368907073994695.gal : 6 ms
[2024-05-24 07:34:54] [INFO ] Time to serialize properties into /tmp/LTL14910963273006328379.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/LTL9468368907073994695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14910963273006328379.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(G("((next_18==0)||(ncs_9_2==0))"))))
Formula 0 simplified : GF!"((next_18==0)||(ncs_9_2==0))"
Detected timeout of ITS tools.
[2024-05-24 07:35:09] [INFO ] Flatten gal took : 32 ms
[2024-05-24 07:35:09] [INFO ] Applying decomposition
[2024-05-24 07:35:09] [INFO ] Flatten gal took : 31 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/graph1790016572423262678.txt' '-o' '/tmp/graph1790016572423262678.bin' '-w' '/tmp/graph1790016572423262678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1790016572423262678.bin' '-l' '-1' '-v' '-w' '/tmp/graph1790016572423262678.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:35:09] [INFO ] Decomposing Gal with order
[2024-05-24 07:35:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:35:09] [INFO ] Removed a total of 1368 redundant transitions.
[2024-05-24 07:35:09] [INFO ] Flatten gal took : 66 ms
[2024-05-24 07:35:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 32 ms.
[2024-05-24 07:35:09] [INFO ] Time to serialize gal into /tmp/LTL2438472895725614093.gal : 10 ms
[2024-05-24 07:35:09] [INFO ] Time to serialize properties into /tmp/LTL11098046142682662644.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/LTL2438472895725614093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11098046142682662644.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(G("((i3.i0.u12.next_18==0)||(i12.u81.ncs_9_2==0))"))))
Formula 0 simplified : GF!"((i3.i0.u12.next_18==0)||(i12.u81.ncs_9_2==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin578521709828108649
[2024-05-24 07:35:24] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin578521709828108649
Running compilation step : cd /tmp/ltsmin578521709828108649;'/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'
Compilation finished in 2011 ms.
Running link step : cd /tmp/ltsmin578521709828108649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin578521709828108649;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-12-LTLFireability-14 finished in 101919 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(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
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)))'
[2024-05-24 07:35:40] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16668031100201909470
[2024-05-24 07:35:40] [INFO ] Too many transitions (1516) to apply POR reductions. Disabling POR matrices.
[2024-05-24 07:35:40] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16668031100201909470
Running compilation step : cd /tmp/ltsmin16668031100201909470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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-24 07:35:40] [INFO ] Applying decomposition
[2024-05-24 07:35:40] [INFO ] Flatten gal took : 50 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/graph1598021367282691438.txt' '-o' '/tmp/graph1598021367282691438.bin' '-w' '/tmp/graph1598021367282691438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1598021367282691438.bin' '-l' '-1' '-v' '-w' '/tmp/graph1598021367282691438.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:35:40] [INFO ] Decomposing Gal with order
[2024-05-24 07:35:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:35:40] [INFO ] Removed a total of 3327 redundant transitions.
[2024-05-24 07:35:40] [INFO ] Flatten gal took : 115 ms
[2024-05-24 07:35:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 35 ms.
[2024-05-24 07:35:40] [INFO ] Time to serialize gal into /tmp/LTLFireability5373140297757967312.gal : 14 ms
[2024-05-24 07:35:40] [INFO ] Time to serialize properties into /tmp/LTLFireability5291713370809174809.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/LTLFireability5373140297757967312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5291713370809174809.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 2 LTL properties
Checking formula 0 : !((X(X(X(G(("((i1.i0.u7.next_15==0)||(i4.u115.ncs_3_2==0))")&&(F(((!("(((i1.i1.u5.next_12==1)&&(i2.u248.ncs_6_11==1))&&((i1.i1.u5.next...308
Formula 0 simplified : XXXF(!"((i1.i0.u7.next_15==0)||(i4.u115.ncs_3_2==0))" | G(F"((i1.i1.u0.next_1==1)&&(i5.u15.ncs_0_9==1))" & ("(((i1.i1.u5.next_12==1)...280
Compilation finished in 5077 ms.
Running link step : cd /tmp/ltsmin16668031100201909470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16668031100201909470;'/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(X(X([](((LTLAPp0==true)&&<>(((!(LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
LTSmin run took 142824 ms.
FORMULA Anderson-PT-12-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin16668031100201909470;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 07:57:21] [INFO ] Applying decomposition
[2024-05-24 07:57:21] [INFO ] Flatten gal took : 122 ms
[2024-05-24 07:57:21] [INFO ] Decomposing Gal with order
[2024-05-24 07:57:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:57:22] [INFO ] Removed a total of 1816 redundant transitions.
[2024-05-24 07:57:22] [INFO ] Flatten gal took : 600 ms
[2024-05-24 07:57:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 437 labels/synchronizations in 141 ms.
[2024-05-24 07:57:22] [INFO ] Time to serialize gal into /tmp/LTLFireability3430693201659542968.gal : 23 ms
[2024-05-24 07:57:22] [INFO ] Time to serialize properties into /tmp/LTLFireability8104248968714233495.ltl : 16 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/LTLFireability3430693201659542968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8104248968714233495.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 1 LTL properties
Checking formula 0 : !((F(G("((u13.next_18==0)||(u6.ncs_9_2==0))"))))
Formula 0 simplified : GF!"((u13.next_18==0)||(u6.ncs_9_2==0))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin16668031100201909470;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin16668031100201909470;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 08:19:03] [INFO ] Flatten gal took : 147 ms
[2024-05-24 08:19:03] [INFO ] Input system was already deterministic with 1516 transitions.
[2024-05-24 08:19:03] [INFO ] Transformed 650 places.
[2024-05-24 08:19:03] [INFO ] Transformed 1516 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-24 08:19:33] [INFO ] Time to serialize gal into /tmp/LTLFireability2439705574454546104.gal : 8 ms
[2024-05-24 08:19:33] [INFO ] Time to serialize properties into /tmp/LTLFireability10151576292512131126.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/LTLFireability2439705574454546104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10151576292512131126.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((next_18==0)||(ncs_9_2==0))"))))
Formula 0 simplified : GF!"((next_18==0)||(ncs_9_2==0))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6548872 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16038116 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-12"
export BK_EXAMINATION="LTLFireability"
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 Anderson-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-smll-171620128200238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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