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.r197-tall-171640625000172.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 FunctionPointer-PT-c002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c002-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716525252981

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 04:34:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 04:34:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:34:14] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2024-05-24 04:34:14] [INFO ] Transformed 2826 places.
[2024-05-24 04:34:15] [INFO ] Transformed 8960 transitions.
[2024-05-24 04:34:15] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1198 places in 45 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c002-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 310 place count 1318 transition count 3720
Iterating global reduction 1 with 294 rules applied. Total rules applied 604 place count 1318 transition count 3720
Ensure Unique test removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 1 with 372 rules applied. Total rules applied 976 place count 1318 transition count 3348
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1129 place count 1165 transition count 3042
Iterating global reduction 2 with 153 rules applied. Total rules applied 1282 place count 1165 transition count 3042
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1358 place count 1165 transition count 2966
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1371 place count 1152 transition count 2940
Iterating global reduction 3 with 13 rules applied. Total rules applied 1384 place count 1152 transition count 2940
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1397 place count 1139 transition count 2914
Iterating global reduction 3 with 13 rules applied. Total rules applied 1410 place count 1139 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1423 place count 1126 transition count 2888
Iterating global reduction 3 with 13 rules applied. Total rules applied 1436 place count 1126 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1449 place count 1113 transition count 2862
Iterating global reduction 3 with 13 rules applied. Total rules applied 1462 place count 1113 transition count 2862
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1474 place count 1101 transition count 2838
Iterating global reduction 3 with 12 rules applied. Total rules applied 1486 place count 1101 transition count 2838
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1497 place count 1090 transition count 2816
Iterating global reduction 3 with 11 rules applied. Total rules applied 1508 place count 1090 transition count 2816
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1519 place count 1079 transition count 2794
Iterating global reduction 3 with 11 rules applied. Total rules applied 1530 place count 1079 transition count 2794
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1572 place count 1037 transition count 2638
Iterating global reduction 3 with 42 rules applied. Total rules applied 1614 place count 1037 transition count 2638
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1667 place count 984 transition count 2426
Iterating global reduction 3 with 53 rules applied. Total rules applied 1720 place count 984 transition count 2426
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1773 place count 931 transition count 2286
Iterating global reduction 3 with 53 rules applied. Total rules applied 1826 place count 931 transition count 2286
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1878 place count 879 transition count 2182
Iterating global reduction 3 with 52 rules applied. Total rules applied 1930 place count 879 transition count 2182
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 1981 place count 828 transition count 2080
Iterating global reduction 3 with 51 rules applied. Total rules applied 2032 place count 828 transition count 2080
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2083 place count 777 transition count 1978
Iterating global reduction 3 with 51 rules applied. Total rules applied 2134 place count 777 transition count 1978
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2185 place count 726 transition count 1876
Iterating global reduction 3 with 51 rules applied. Total rules applied 2236 place count 726 transition count 1876
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2252 place count 710 transition count 1844
Iterating global reduction 3 with 16 rules applied. Total rules applied 2268 place count 710 transition count 1844
Applied a total of 2268 rules in 1104 ms. Remains 710 /1628 variables (removed 918) and now considering 1844/5962 (removed 4118) transitions.
[2024-05-24 04:34:16] [INFO ] Flow matrix only has 1237 transitions (discarded 607 similar events)
// Phase 1: matrix 1237 rows 710 cols
[2024-05-24 04:34:16] [INFO ] Computed 2 invariants in 34 ms
[2024-05-24 04:34:17] [INFO ] Implicit Places using invariants in 808 ms returned []
[2024-05-24 04:34:17] [INFO ] Flow matrix only has 1237 transitions (discarded 607 similar events)
[2024-05-24 04:34:17] [INFO ] Invariant cache hit.
[2024-05-24 04:34:17] [INFO ] State equation strengthened by 299 read => feed constraints.
[2024-05-24 04:34:19] [INFO ] Implicit Places using invariants and state equation in 2125 ms returned []
Implicit Place search using SMT with State Equation took 2958 ms to find 0 implicit places.
[2024-05-24 04:34:19] [INFO ] Flow matrix only has 1237 transitions (discarded 607 similar events)
[2024-05-24 04:34:19] [INFO ] Invariant cache hit.
[2024-05-24 04:34:19] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 710/1628 places, 1844/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4663 ms. Remains : 710/1628 places, 1844/5962 transitions.
Support contains 21 out of 710 places after structural reductions.
[2024-05-24 04:34:20] [INFO ] Flatten gal took : 130 ms
[2024-05-24 04:34:20] [INFO ] Flatten gal took : 98 ms
[2024-05-24 04:34:20] [INFO ] Input system was already deterministic with 1844 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2024-05-24 04:34:20] [INFO ] Flow matrix only has 1237 transitions (discarded 607 similar events)
[2024-05-24 04:34:20] [INFO ] Invariant cache hit.
[2024-05-24 04:34:21] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:34:21] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-24 04:34:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 04:34:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:34:22] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2024-05-24 04:34:22] [INFO ] State equation strengthened by 299 read => feed constraints.
[2024-05-24 04:34:22] [INFO ] After 452ms SMT Verify possible using 299 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2024-05-24 04:34:23] [INFO ] After 1179ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 410 ms.
[2024-05-24 04:34:23] [INFO ] After 2581ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 13 out of 710 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Graph (complete) has 3039 edges and 710 vertex of which 521 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.6 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 521 transition count 1465
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 383 place count 518 transition count 1459
Iterating global reduction 1 with 3 rules applied. Total rules applied 386 place count 518 transition count 1459
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 388 place count 518 transition count 1457
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 391 place count 515 transition count 1451
Iterating global reduction 2 with 3 rules applied. Total rules applied 394 place count 515 transition count 1451
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 397 place count 512 transition count 1443
Iterating global reduction 2 with 3 rules applied. Total rules applied 400 place count 512 transition count 1443
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 403 place count 509 transition count 1435
Iterating global reduction 2 with 3 rules applied. Total rules applied 406 place count 509 transition count 1435
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 409 place count 506 transition count 1429
Iterating global reduction 2 with 3 rules applied. Total rules applied 412 place count 506 transition count 1429
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 416 place count 502 transition count 1415
Iterating global reduction 2 with 4 rules applied. Total rules applied 420 place count 502 transition count 1415
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 424 place count 498 transition count 1401
Iterating global reduction 2 with 4 rules applied. Total rules applied 428 place count 498 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 432 place count 494 transition count 1393
Iterating global reduction 2 with 4 rules applied. Total rules applied 436 place count 494 transition count 1393
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 440 place count 490 transition count 1385
Iterating global reduction 2 with 4 rules applied. Total rules applied 444 place count 490 transition count 1385
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 447 place count 487 transition count 1379
Iterating global reduction 2 with 3 rules applied. Total rules applied 450 place count 487 transition count 1379
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 453 place count 484 transition count 1373
Iterating global reduction 2 with 3 rules applied. Total rules applied 456 place count 484 transition count 1373
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 459 place count 481 transition count 1367
Iterating global reduction 2 with 3 rules applied. Total rules applied 462 place count 481 transition count 1367
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 476 place count 481 transition count 1353
Applied a total of 476 rules in 391 ms. Remains 481 /710 variables (removed 229) and now considering 1353/1844 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 481/710 places, 1353/1844 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
[2024-05-24 04:34:24] [INFO ] Flow matrix only has 784 transitions (discarded 569 similar events)
// Phase 1: matrix 784 rows 481 cols
[2024-05-24 04:34:24] [INFO ] Computed 3 invariants in 5 ms
[2024-05-24 04:34:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:24] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-24 04:34:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 04:34:25] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-24 04:34:25] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-24 04:34:25] [INFO ] After 267ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-24 04:34:25] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 1 ms to minimize.
[2024-05-24 04:34:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-24 04:34:26] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 212 ms.
[2024-05-24 04:34:26] [INFO ] After 1624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 10 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1353/1353 transitions.
Graph (complete) has 2316 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 478 transition count 1349
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 478 transition count 1349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 9 place count 478 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 477 transition count 1343
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 477 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 476 transition count 1341
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 476 transition count 1341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 475 transition count 1339
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 475 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 474 transition count 1337
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 474 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 473 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 473 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 472 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 472 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 471 transition count 1331
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 471 transition count 1331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 470 transition count 1329
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 470 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 469 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 469 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 468 transition count 1323
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 468 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 467 transition count 1321
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 467 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 466 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 466 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 465 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 465 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 464 transition count 1315
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 464 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 463 transition count 1313
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 463 transition count 1313
Applied a total of 39 rules in 228 ms. Remains 463 /481 variables (removed 18) and now considering 1313/1353 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 463/481 places, 1313/1353 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-24 04:34:27] [INFO ] Flow matrix only has 757 transitions (discarded 556 similar events)
// Phase 1: matrix 757 rows 463 cols
[2024-05-24 04:34:27] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 04:34:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 04:34:27] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 04:34:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:27] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-24 04:34:27] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-24 04:34:27] [INFO ] After 206ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-24 04:34:28] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 2 ms to minimize.
[2024-05-24 04:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-05-24 04:34:28] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-24 04:34:28] [INFO ] After 1392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 34 ms.
Support contains 8 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1313/1313 transitions.
Graph (complete) has 2251 edges and 463 vertex of which 460 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 460 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 459 transition count 1304
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 459 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 458 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 458 transition count 1302
Applied a total of 10 rules in 83 ms. Remains 458 /463 variables (removed 5) and now considering 1302/1313 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 458/463 places, 1302/1313 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 04:34:29] [INFO ] Flow matrix only has 749 transitions (discarded 553 similar events)
// Phase 1: matrix 749 rows 458 cols
[2024-05-24 04:34:29] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 04:34:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:29] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:34:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:29] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:34:29] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-24 04:34:29] [INFO ] After 156ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:34:29] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 1 ms to minimize.
[2024-05-24 04:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-05-24 04:34:30] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 149 ms.
[2024-05-24 04:34:30] [INFO ] After 1116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1302/1302 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 456 transition count 1298
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 1298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 456 transition count 1296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 454 transition count 1292
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 454 transition count 1292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 452 transition count 1288
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 452 transition count 1288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 450 transition count 1282
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 450 transition count 1282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 448 transition count 1278
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 448 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 447 transition count 1276
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 447 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 446 transition count 1274
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 446 transition count 1274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 445 transition count 1272
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 445 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 444 transition count 1270
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 444 transition count 1270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 443 transition count 1268
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 443 transition count 1268
Applied a total of 32 rules in 154 ms. Remains 443 /458 variables (removed 15) and now considering 1268/1302 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 443/458 places, 1268/1302 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 04:34:30] [INFO ] Flow matrix only has 724 transitions (discarded 544 similar events)
// Phase 1: matrix 724 rows 443 cols
[2024-05-24 04:34:30] [INFO ] Computed 3 invariants in 16 ms
[2024-05-24 04:34:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 04:34:30] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 04:34:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 04:34:31] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 04:34:31] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-24 04:34:31] [INFO ] After 144ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 04:34:31] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2024-05-24 04:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-24 04:34:31] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 123 ms.
[2024-05-24 04:34:31] [INFO ] After 1064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 1268/1268 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 442 transition count 1266
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 441 transition count 1264
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 441 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 440 transition count 1260
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 440 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 439 transition count 1258
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 439 transition count 1258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 438 transition count 1256
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 438 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 437 transition count 1254
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 437 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 436 transition count 1252
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 436 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 435 transition count 1250
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 435 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 434 transition count 1248
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 434 transition count 1248
Applied a total of 18 rules in 141 ms. Remains 434 /443 variables (removed 9) and now considering 1248/1268 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 434/443 places, 1248/1268 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 04:34:32] [INFO ] Flow matrix only has 710 transitions (discarded 538 similar events)
// Phase 1: matrix 710 rows 434 cols
[2024-05-24 04:34:32] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 04:34:32] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 04:34:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:32] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 04:34:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-24 04:34:32] [INFO ] After 105ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 04:34:33] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 0 ms to minimize.
[2024-05-24 04:34:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-05-24 04:34:33] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-24 04:34:33] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1248/1248 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 1246
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 432 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 432 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 431 transition count 1242
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 431 transition count 1242
Applied a total of 6 rules in 73 ms. Remains 431 /434 variables (removed 3) and now considering 1242/1248 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 431/434 places, 1242/1248 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2024-05-24 04:34:33] [INFO ] Flow matrix only has 704 transitions (discarded 538 similar events)
// Phase 1: matrix 704 rows 431 cols
[2024-05-24 04:34:33] [INFO ] Computed 3 invariants in 8 ms
[2024-05-24 04:34:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:33] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 04:34:33] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 04:34:34] [INFO ] After 65ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:34:34] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:34:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:34] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:34:34] [INFO ] After 62ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:34:34] [INFO ] Deduced a trap composed of 135 places in 152 ms of which 1 ms to minimize.
[2024-05-24 04:34:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-05-24 04:34:34] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-24 04:34:34] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1242/1242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 429 transition count 1238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 429 transition count 1238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 428 transition count 1234
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 421 transition count 1218
Applied a total of 22 rules in 122 ms. Remains 421 /431 variables (removed 10) and now considering 1218/1242 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 421/431 places, 1218/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:34:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-24 04:34:34] [INFO ] Computed 3 invariants in 13 ms
[2024-05-24 04:34:34] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-24 04:34:35] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 04:34:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 04:34:35] [INFO ] After 49ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:34:35] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:34:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:35] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:35] [INFO ] After 36ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:35] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-24 04:34:35] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 420 transition count 1216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 419 transition count 1212
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 419 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 418 transition count 1210
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 417 transition count 1208
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 416 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 415 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 414 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 413 transition count 1200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 413 transition count 1200
Applied a total of 16 rules in 111 ms. Remains 413 /421 variables (removed 8) and now considering 1200/1218 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 413/421 places, 1200/1218 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 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 628670 steps, run timeout after 3015 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 628670 steps, saw 385486 distinct states, run finished after 3018 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:34:38] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-24 04:34:38] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 04:34:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:38] [INFO ] After 142ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 04:34:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 04:34:38] [INFO ] After 44ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:34:38] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:34:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:39] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:39] [INFO ] After 34ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:39] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 04:34:39] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 42 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-24 04:34:39] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-24 04:34:39] [INFO ] Invariant cache hit.
[2024-05-24 04:34:39] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-24 04:34:39] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-24 04:34:39] [INFO ] Invariant cache hit.
[2024-05-24 04:34:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 04:34:40] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2024-05-24 04:34:40] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-24 04:34:40] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-24 04:34:40] [INFO ] Invariant cache hit.
[2024-05-24 04:34:40] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1565 ms. Remains : 413/413 places, 1200/1200 transitions.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 413 transition count 664
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 402 transition count 664
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 547 place count 402 transition count 597
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 681 place count 335 transition count 597
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 933 place count 209 transition count 471
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 996 place count 146 transition count 345
Iterating global reduction 2 with 63 rules applied. Total rules applied 1059 place count 146 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1060 place count 146 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1060 place count 146 transition count 343
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 1062 place count 145 transition count 343
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1124 place count 83 transition count 219
Iterating global reduction 3 with 62 rules applied. Total rules applied 1186 place count 83 transition count 219
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1248 place count 21 transition count 95
Iterating global reduction 3 with 62 rules applied. Total rules applied 1310 place count 21 transition count 95
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1372 place count 21 transition count 33
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 4 with 2 rules applied. Total rules applied 1374 place count 20 transition count 34
Applied a total of 1374 rules in 59 ms. Remains 20 /413 variables (removed 393) and now considering 34/1200 (removed 1166) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-24 04:34:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 04:34:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 04:34:40] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 04:34:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:34:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:34:40] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:34:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 04:34:40] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:40] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-24 04:34:40] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA FunctionPointer-PT-c002-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA FunctionPointer-PT-c002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 4063 edges and 710 vertex of which 709 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 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||F(p1)))))'
Support contains 4 out of 710 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Graph (complete) has 4063 edges and 710 vertex of which 709 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 699 transition count 1822
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 699 transition count 1822
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 29 place count 699 transition count 1814
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 691 transition count 1796
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 691 transition count 1796
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 683 transition count 1772
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 683 transition count 1772
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 675 transition count 1746
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 675 transition count 1746
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 667 transition count 1726
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 667 transition count 1726
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 102 place count 658 transition count 1704
Iterating global reduction 1 with 9 rules applied. Total rules applied 111 place count 658 transition count 1704
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 120 place count 649 transition count 1682
Iterating global reduction 1 with 9 rules applied. Total rules applied 129 place count 649 transition count 1682
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 138 place count 640 transition count 1664
Iterating global reduction 1 with 9 rules applied. Total rules applied 147 place count 640 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 155 place count 632 transition count 1648
Iterating global reduction 1 with 8 rules applied. Total rules applied 163 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 168 place count 627 transition count 1636
Iterating global reduction 1 with 5 rules applied. Total rules applied 173 place count 627 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 176 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 179 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 182 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 185 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 186 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 187 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 188 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 189 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 190 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 191 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 192 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 193 place count 617 transition count 1614
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 195 place count 617 transition count 1612
Applied a total of 195 rules in 741 ms. Remains 617 /710 variables (removed 93) and now considering 1612/1844 (removed 232) transitions.
[2024-05-24 04:34:41] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2024-05-24 04:34:41] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 04:34:42] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-24 04:34:42] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 04:34:42] [INFO ] Invariant cache hit.
[2024-05-24 04:34:42] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:34:43] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
[2024-05-24 04:34:43] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-24 04:34:43] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 04:34:43] [INFO ] Invariant cache hit.
[2024-05-24 04:34:44] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 617/710 places, 1612/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3180 ms. Remains : 617/710 places, 1612/1844 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 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-02 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:(GT s225 s536), p1:(GT s149 s531)], 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 497 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-02 finished in 3930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 710 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 709 transition count 1844
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 698 transition count 1818
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 698 transition count 1818
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 31 place count 698 transition count 1810
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 40 place count 689 transition count 1788
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 689 transition count 1788
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 680 transition count 1762
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 680 transition count 1762
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 670 transition count 1732
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 670 transition count 1732
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 97 place count 660 transition count 1708
Iterating global reduction 2 with 10 rules applied. Total rules applied 107 place count 660 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 117 place count 650 transition count 1684
Iterating global reduction 2 with 10 rules applied. Total rules applied 127 place count 650 transition count 1684
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 137 place count 640 transition count 1660
Iterating global reduction 2 with 10 rules applied. Total rules applied 147 place count 640 transition count 1660
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 631 transition count 1642
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 173 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 181 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 618 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 618 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 194 place count 615 transition count 1606
Iterating global reduction 2 with 3 rules applied. Total rules applied 197 place count 615 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 612 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 203 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 204 place count 611 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 206 place count 610 transition count 1596
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 609 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 608 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 608 transition count 1592
Applied a total of 211 rules in 242 ms. Remains 608 /710 variables (removed 102) and now considering 1592/1844 (removed 252) transitions.
[2024-05-24 04:34:45] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2024-05-24 04:34:45] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 04:34:45] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-24 04:34:45] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2024-05-24 04:34:45] [INFO ] Invariant cache hit.
[2024-05-24 04:34:46] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-24 04:34:47] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
[2024-05-24 04:34:47] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2024-05-24 04:34:47] [INFO ] Invariant cache hit.
[2024-05-24 04:34:47] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/710 places, 1592/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2619 ms. Remains : 608/710 places, 1592/1844 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s523)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 391 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-04 finished in 3114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(p1&&F(p0)))))'
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 709 transition count 1844
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 699 transition count 1822
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 699 transition count 1822
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 31 place count 699 transition count 1812
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 39 place count 691 transition count 1794
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 691 transition count 1794
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 683 transition count 1774
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 683 transition count 1774
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 675 transition count 1750
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 675 transition count 1750
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 87 place count 667 transition count 1730
Iterating global reduction 2 with 8 rules applied. Total rules applied 95 place count 667 transition count 1730
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 103 place count 659 transition count 1710
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 659 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 119 place count 651 transition count 1690
Iterating global reduction 2 with 8 rules applied. Total rules applied 127 place count 651 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 134 place count 644 transition count 1676
Iterating global reduction 2 with 7 rules applied. Total rules applied 141 place count 644 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 637 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 637 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 632 transition count 1650
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 629 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 174 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 177 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 625 transition count 1634
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 180 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 622 transition count 1628
Applied a total of 185 rules in 246 ms. Remains 622 /710 variables (removed 88) and now considering 1628/1844 (removed 216) transitions.
[2024-05-24 04:34:48] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-24 04:34:48] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 04:34:48] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-24 04:34:48] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 04:34:48] [INFO ] Invariant cache hit.
[2024-05-24 04:34:49] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:34:50] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
[2024-05-24 04:34:50] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 04:34:50] [INFO ] Invariant cache hit.
[2024-05-24 04:34:51] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 622/710 places, 1628/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2913 ms. Remains : 622/710 places, 1628/1844 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s550 0), p1:(LEQ 2 s548)], 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 0 reset in 375 ms.
Product exploration explored 100000 steps with 0 reset in 495 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), true]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 497165 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 497165 steps, saw 322694 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:34:55] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 04:34:55] [INFO ] Invariant cache hit.
[2024-05-24 04:34:55] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:34:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:34:55] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:55] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:34:56] [INFO ] After 70ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:56] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-24 04:34:56] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 430 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 429 transition count 1242
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 429 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 428 transition count 1238
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 428 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 427 transition count 1234
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 427 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 426 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 426 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 425 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 425 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 424 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 424 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 398 place count 423 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 399 place count 423 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 400 place count 422 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 401 place count 422 transition count 1224
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 405 place count 422 transition count 1220
Applied a total of 405 rules in 162 ms. Remains 422 /622 variables (removed 200) and now considering 1220/1628 (removed 408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 422/622 places, 1220/1628 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 615805 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 615805 steps, saw 377599 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:34:59] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 04:34:59] [INFO ] Computed 3 invariants in 8 ms
[2024-05-24 04:34:59] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:34:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:34:59] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 04:34:59] [INFO ] After 43ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:34:59] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 04:34:59] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 04:34:59] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 04:34:59] [INFO ] Invariant cache hit.
[2024-05-24 04:35:00] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-24 04:35:00] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 04:35:00] [INFO ] Invariant cache hit.
[2024-05-24 04:35:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 04:35:00] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2024-05-24 04:35:00] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-24 04:35:00] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 04:35:00] [INFO ] Invariant cache hit.
[2024-05-24 04:35:01] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1505 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
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 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 25 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-24 04:35:01] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 04:35:01] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:35:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 04:35:01] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:35:01] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:01] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 04:35:01] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 622 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 : 622/622 places, 1628/1628 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 622 transition count 1622
Applied a total of 6 rules in 162 ms. Remains 622 /622 variables (removed 0) and now considering 1622/1628 (removed 6) transitions.
[2024-05-24 04:35:01] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 622 cols
[2024-05-24 04:35:01] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 04:35:02] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-24 04:35:02] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 04:35:02] [INFO ] Invariant cache hit.
[2024-05-24 04:35:02] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:35:03] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
[2024-05-24 04:35:03] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-24 04:35:03] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 04:35:03] [INFO ] Invariant cache hit.
[2024-05-24 04:35:04] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 622/622 places, 1622/1628 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2826 ms. Remains : 622/622 places, 1622/1628 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 517470 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517470 steps, saw 335870 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:35:07] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 04:35:07] [INFO ] Invariant cache hit.
[2024-05-24 04:35:07] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:35:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 04:35:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:35:08] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:35:08] [INFO ] After 80ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:08] [INFO ] After 147ms 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 04:35:08] [INFO ] After 512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1622/1622 transitions.
Graph (complete) has 2709 edges and 622 vertex of which 430 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 430 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 429 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 428 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 398 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 399 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 400 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 401 place count 422 transition count 1220
Applied a total of 401 rules in 117 ms. Remains 422 /622 variables (removed 200) and now considering 1220/1622 (removed 402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 422/622 places, 1220/1622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 598731 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598731 steps, saw 367131 distinct states, run finished after 3003 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:35:11] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 04:35:11] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 04:35:11] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:35:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 04:35:11] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 04:35:11] [INFO ] After 35ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:11] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 04:35:11] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 04:35:11] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 04:35:11] [INFO ] Invariant cache hit.
[2024-05-24 04:35:12] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-24 04:35:12] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 04:35:12] [INFO ] Invariant cache hit.
[2024-05-24 04:35:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 04:35:12] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2024-05-24 04:35:13] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 04:35:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 04:35:13] [INFO ] Invariant cache hit.
[2024-05-24 04:35:13] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1446 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
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 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 20 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-24 04:35:13] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 04:35:13] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:35:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 04:35:13] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:35:13] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:13] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-24 04:35:13] [INFO ] After 41ms 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 349 ms.
Product exploration explored 100000 steps with 0 reset in 413 ms.
Built C files in :
/tmp/ltsmin11479737268826889233
[2024-05-24 04:35:14] [INFO ] Too many transitions (1622) to apply POR reductions. Disabling POR matrices.
[2024-05-24 04:35:14] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11479737268826889233
Running compilation step : cd /tmp/ltsmin11479737268826889233;'/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 2943 ms.
Running link step : cd /tmp/ltsmin11479737268826889233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11479737268826889233;'/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' '--hoa' '/tmp/stateBased17968670845883976953.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1622/1622 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 621 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 620 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 620 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 619 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 619 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 618 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 618 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 617 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 617 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 616 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 616 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 615 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 615 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 614 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 614 transition count 1604
Applied a total of 16 rules in 187 ms. Remains 614 /622 variables (removed 8) and now considering 1604/1622 (removed 18) transitions.
[2024-05-24 04:35:29] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 04:35:29] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 04:35:30] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-24 04:35:30] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 04:35:30] [INFO ] Invariant cache hit.
[2024-05-24 04:35:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 04:35:31] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2235 ms to find 0 implicit places.
[2024-05-24 04:35:32] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 04:35:32] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 04:35:32] [INFO ] Invariant cache hit.
[2024-05-24 04:35:32] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/622 places, 1604/1622 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3041 ms. Remains : 614/622 places, 1604/1622 transitions.
Built C files in :
/tmp/ltsmin5213343161060237030
[2024-05-24 04:35:32] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-24 04:35:32] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5213343161060237030
Running compilation step : cd /tmp/ltsmin5213343161060237030;'/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 2866 ms.
Running link step : cd /tmp/ltsmin5213343161060237030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5213343161060237030;'/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' '--hoa' '/tmp/stateBased10666106557828870491.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 04:35:47] [INFO ] Flatten gal took : 56 ms
[2024-05-24 04:35:47] [INFO ] Flatten gal took : 55 ms
[2024-05-24 04:35:47] [INFO ] Time to serialize gal into /tmp/LTL8543819054086877915.gal : 15 ms
[2024-05-24 04:35:47] [INFO ] Time to serialize properties into /tmp/LTL5688350285086545454.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/LTL8543819054086877915.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1792851573856041497.hoa' '-atoms' '/tmp/LTL5688350285086545454.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...317
Loading property file /tmp/LTL5688350285086545454.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1792851573856041497.hoa
Detected timeout of ITS tools.
[2024-05-24 04:36:03] [INFO ] Flatten gal took : 51 ms
[2024-05-24 04:36:03] [INFO ] Flatten gal took : 49 ms
[2024-05-24 04:36:03] [INFO ] Time to serialize gal into /tmp/LTL13306915867695431107.gal : 7 ms
[2024-05-24 04:36:03] [INFO ] Time to serialize properties into /tmp/LTL3511102525660525446.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13306915867695431107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3511102525660525446.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((G(F("(l2064<=0)")))||(("(l2042>=2)")&&(F("(l2064<=0)"))))))
Formula 0 simplified : X(FG!"(l2064<=0)" & (!"(l2042>=2)" | G!"(l2064<=0)"))
Detected timeout of ITS tools.
[2024-05-24 04:36:18] [INFO ] Flatten gal took : 42 ms
[2024-05-24 04:36:18] [INFO ] Applying decomposition
[2024-05-24 04:36:18] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4260584606790542620.txt' '-o' '/tmp/graph4260584606790542620.bin' '-w' '/tmp/graph4260584606790542620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4260584606790542620.bin' '-l' '-1' '-v' '-w' '/tmp/graph4260584606790542620.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:36:18] [INFO ] Decomposing Gal with order
[2024-05-24 04:36:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:36:18] [INFO ] Removed a total of 2693 redundant transitions.
[2024-05-24 04:36:18] [INFO ] Flatten gal took : 143 ms
[2024-05-24 04:36:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1274 labels/synchronizations in 83 ms.
[2024-05-24 04:36:18] [INFO ] Time to serialize gal into /tmp/LTL14056552865962846686.gal : 13 ms
[2024-05-24 04:36:18] [INFO ] Time to serialize properties into /tmp/LTL1240992702093407747.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/LTL14056552865962846686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1240992702093407747.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 : !((X((G(F("(i26.i0.u149.l2064<=0)")))||(("(i26.i1.u144.l2042>=2)")&&(F("(i26.i0.u149.l2064<=0)"))))))
Formula 0 simplified : X(FG!"(i26.i0.u149.l2064<=0)" & (!"(i26.i1.u144.l2042>=2)" | G!"(i26.i0.u149.l2064<=0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10533246622809352127
[2024-05-24 04:36:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10533246622809352127
Running compilation step : cd /tmp/ltsmin10533246622809352127;'/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 2865 ms.
Running link step : cd /tmp/ltsmin10533246622809352127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10533246622809352127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c002-LTLCardinality-05 finished in 120698 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||X(F(p1)))))'
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Graph (complete) has 4063 edges and 710 vertex of which 709 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 698 transition count 1818
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 698 transition count 1818
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 29 place count 698 transition count 1812
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 689 transition count 1790
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 689 transition count 1790
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 681 transition count 1766
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 681 transition count 1766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 674 transition count 1746
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 674 transition count 1746
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 84 place count 667 transition count 1732
Iterating global reduction 1 with 7 rules applied. Total rules applied 91 place count 667 transition count 1732
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 99 place count 659 transition count 1710
Iterating global reduction 1 with 8 rules applied. Total rules applied 107 place count 659 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 115 place count 651 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 123 place count 651 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 131 place count 643 transition count 1672
Iterating global reduction 1 with 8 rules applied. Total rules applied 139 place count 643 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 636 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 636 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 157 place count 632 transition count 1648
Iterating global reduction 1 with 4 rules applied. Total rules applied 161 place count 632 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 165 place count 628 transition count 1638
Iterating global reduction 1 with 4 rules applied. Total rules applied 169 place count 628 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 173 place count 624 transition count 1630
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 624 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 178 place count 623 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 179 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 622 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 182 place count 621 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 621 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 184 place count 620 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 185 place count 620 transition count 1622
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 620 transition count 1618
Applied a total of 189 rules in 419 ms. Remains 620 /710 variables (removed 90) and now considering 1618/1844 (removed 226) transitions.
[2024-05-24 04:36:49] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2024-05-24 04:36:49] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 04:36:49] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-24 04:36:49] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-24 04:36:49] [INFO ] Invariant cache hit.
[2024-05-24 04:36:50] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:36:51] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2024-05-24 04:36:51] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 04:36:51] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-24 04:36:51] [INFO ] Invariant cache hit.
[2024-05-24 04:36:51] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 620/710 places, 1618/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2946 ms. Remains : 620/710 places, 1618/1844 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s532 0), p1:(OR (LEQ s549 0) (LEQ s532 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33343 reset in 680 ms.
Product exploration explored 100000 steps with 33348 reset in 640 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:36:53] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-24 04:36:53] [INFO ] Invariant cache hit.
[2024-05-24 04:36:53] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:36:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:36:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:36:54] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:36:54] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:36:54] [INFO ] After 68ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:36:54] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-24 04:36:54] [INFO ] After 509ms 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 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Graph (complete) has 2703 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1234
Applied a total of 385 rules in 44 ms. Remains 428 /620 variables (removed 192) and now considering 1234/1618 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 428/620 places, 1234/1618 transitions.
Incomplete random walk after 10001 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 629779 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 629779 steps, saw 386168 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:36:57] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
// Phase 1: matrix 700 rows 428 cols
[2024-05-24 04:36:57] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 04:36:57] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:36:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:36:57] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:36:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 04:36:57] [INFO ] After 40ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:36:57] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-24 04:36:57] [INFO ] After 343ms 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 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1234/1234 transitions.
Applied a total of 0 rules in 41 ms. Remains 428 /428 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 428/428 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1234/1234 transitions.
Applied a total of 0 rules in 43 ms. Remains 428 /428 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-24 04:36:57] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-24 04:36:57] [INFO ] Invariant cache hit.
[2024-05-24 04:36:58] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-24 04:36:58] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-24 04:36:58] [INFO ] Invariant cache hit.
[2024-05-24 04:36:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 04:36:59] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2024-05-24 04:36:59] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 04:36:59] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-24 04:36:59] [INFO ] Invariant cache hit.
[2024-05-24 04:36:59] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1633 ms. Remains : 428/428 places, 1234/1234 transitions.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 428 transition count 689
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 556 place count 417 transition count 689
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 556 place count 417 transition count 615
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 704 place count 343 transition count 615
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 960 place count 215 transition count 487
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1024 place count 151 transition count 359
Iterating global reduction 2 with 64 rules applied. Total rules applied 1088 place count 151 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1089 place count 151 transition count 358
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1152 place count 88 transition count 232
Iterating global reduction 3 with 63 rules applied. Total rules applied 1215 place count 88 transition count 232
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1278 place count 25 transition count 106
Iterating global reduction 3 with 63 rules applied. Total rules applied 1341 place count 25 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1404 place count 25 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1404 place count 25 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1406 place count 24 transition count 42
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 4 with 2 rules applied. Total rules applied 1408 place count 23 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 41
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1413 place count 22 transition count 38
Applied a total of 1413 rules in 28 ms. Remains 22 /428 variables (removed 406) and now considering 38/1234 (removed 1196) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 22 cols
[2024-05-24 04:36:59] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 04:36:59] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:36:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 04:36:59] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:36:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:36:59] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:36:59] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 04:36:59] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Applied a total of 0 rules in 75 ms. Remains 620 /620 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2024-05-24 04:36:59] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2024-05-24 04:36:59] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 04:37:00] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-24 04:37:00] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-24 04:37:00] [INFO ] Invariant cache hit.
[2024-05-24 04:37:00] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:37:02] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
[2024-05-24 04:37:02] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 04:37:02] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-24 04:37:02] [INFO ] Invariant cache hit.
[2024-05-24 04:37:02] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2992 ms. Remains : 620/620 places, 1618/1618 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 262424 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262424 steps, saw 170342 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 04:37:06] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-24 04:37:06] [INFO ] Invariant cache hit.
[2024-05-24 04:37:06] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:37:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 04:37:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:37:06] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:37:06] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:37:06] [INFO ] After 95ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:37:06] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-24 04:37:06] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Graph (complete) has 2703 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1234
Applied a total of 385 rules in 46 ms. Remains 428 /620 variables (removed 192) and now considering 1234/1618 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 428/620 places, 1234/1618 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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
Interrupted probabilistic random walk after 379052 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379052 steps, saw 232437 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 04:37:10] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
// Phase 1: matrix 700 rows 428 cols
[2024-05-24 04:37:10] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 04:37:10] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:37:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:37:10] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:37:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 04:37:10] [INFO ] After 69ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:37:10] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-24 04:37:10] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1234/1234 transitions.
Applied a total of 0 rules in 49 ms. Remains 428 /428 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 428/428 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1234/1234 transitions.
Applied a total of 0 rules in 47 ms. Remains 428 /428 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-24 04:37:10] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-24 04:37:10] [INFO ] Invariant cache hit.
[2024-05-24 04:37:11] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-24 04:37:11] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-24 04:37:11] [INFO ] Invariant cache hit.
[2024-05-24 04:37:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 04:37:11] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
[2024-05-24 04:37:11] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 04:37:11] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-24 04:37:11] [INFO ] Invariant cache hit.
[2024-05-24 04:37:12] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1705 ms. Remains : 428/428 places, 1234/1234 transitions.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 428 transition count 689
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 556 place count 417 transition count 689
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 556 place count 417 transition count 615
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 704 place count 343 transition count 615
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 960 place count 215 transition count 487
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1024 place count 151 transition count 359
Iterating global reduction 2 with 64 rules applied. Total rules applied 1088 place count 151 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1089 place count 151 transition count 358
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1152 place count 88 transition count 232
Iterating global reduction 3 with 63 rules applied. Total rules applied 1215 place count 88 transition count 232
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1278 place count 25 transition count 106
Iterating global reduction 3 with 63 rules applied. Total rules applied 1341 place count 25 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1404 place count 25 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1404 place count 25 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1406 place count 24 transition count 42
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 4 with 2 rules applied. Total rules applied 1408 place count 23 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 41
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1413 place count 22 transition count 38
Applied a total of 1413 rules in 20 ms. Remains 22 /428 variables (removed 406) and now considering 38/1234 (removed 1196) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 22 cols
[2024-05-24 04:37:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 04:37:12] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:37:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 04:37:12] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:37:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:37:12] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:37:12] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 04:37:12] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33360 reset in 634 ms.
Product exploration explored 100000 steps with 33316 reset in 640 ms.
Built C files in :
/tmp/ltsmin6786592508125236695
[2024-05-24 04:37:14] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2024-05-24 04:37:14] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6786592508125236695
Running compilation step : cd /tmp/ltsmin6786592508125236695;'/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 2770 ms.
Running link step : cd /tmp/ltsmin6786592508125236695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6786592508125236695;'/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' '--hoa' '/tmp/stateBased9794917102495241961.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Applied a total of 0 rules in 72 ms. Remains 620 /620 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2024-05-24 04:37:29] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2024-05-24 04:37:29] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 04:37:29] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-24 04:37:29] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-24 04:37:29] [INFO ] Invariant cache hit.
[2024-05-24 04:37:29] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 04:37:31] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2024-05-24 04:37:31] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 04:37:31] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-24 04:37:31] [INFO ] Invariant cache hit.
[2024-05-24 04:37:31] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2716 ms. Remains : 620/620 places, 1618/1618 transitions.
Built C files in :
/tmp/ltsmin7591844294728956941
[2024-05-24 04:37:31] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2024-05-24 04:37:31] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7591844294728956941
Running compilation step : cd /tmp/ltsmin7591844294728956941;'/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 2719 ms.
Running link step : cd /tmp/ltsmin7591844294728956941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7591844294728956941;'/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' '--hoa' '/tmp/stateBased1723546722621022136.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 04:37:46] [INFO ] Flatten gal took : 38 ms
[2024-05-24 04:37:46] [INFO ] Flatten gal took : 37 ms
[2024-05-24 04:37:46] [INFO ] Time to serialize gal into /tmp/LTL4610136712472119465.gal : 7 ms
[2024-05-24 04:37:46] [INFO ] Time to serialize properties into /tmp/LTL1603142708075782563.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4610136712472119465.gal' '-t' 'CGAL' '-hoa' '/tmp/aut938277519958621246.hoa' '-atoms' '/tmp/LTL1603142708075782563.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL1603142708075782563.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut938277519958621246.hoa
Detected timeout of ITS tools.
[2024-05-24 04:38:02] [INFO ] Flatten gal took : 35 ms
[2024-05-24 04:38:02] [INFO ] Flatten gal took : 36 ms
[2024-05-24 04:38:02] [INFO ] Time to serialize gal into /tmp/LTL12341617343626054144.gal : 7 ms
[2024-05-24 04:38:02] [INFO ] Time to serialize properties into /tmp/LTL4608275359751035853.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/LTL12341617343626054144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4608275359751035853.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(l1388>0)")||(X(F("((l2139<=0)||(l1388<=0))"))))))
Formula 0 simplified : F(!"(l1388>0)" & XG!"((l2139<=0)||(l1388<=0))")
Detected timeout of ITS tools.
[2024-05-24 04:38:17] [INFO ] Flatten gal took : 34 ms
[2024-05-24 04:38:17] [INFO ] Applying decomposition
[2024-05-24 04:38:17] [INFO ] Flatten gal took : 34 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/graph10236350757670479121.txt' '-o' '/tmp/graph10236350757670479121.bin' '-w' '/tmp/graph10236350757670479121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10236350757670479121.bin' '-l' '-1' '-v' '-w' '/tmp/graph10236350757670479121.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:38:17] [INFO ] Decomposing Gal with order
[2024-05-24 04:38:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:38:17] [INFO ] Removed a total of 2695 redundant transitions.
[2024-05-24 04:38:17] [INFO ] Flatten gal took : 74 ms
[2024-05-24 04:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1185 labels/synchronizations in 67 ms.
[2024-05-24 04:38:17] [INFO ] Time to serialize gal into /tmp/LTL1613108967187327260.gal : 8 ms
[2024-05-24 04:38:17] [INFO ] Time to serialize properties into /tmp/LTL11058401709075121905.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/LTL1613108967187327260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11058401709075121905.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 : !((G(("(i27.i0.u151.l1388>0)")||(X(F("((i27.i3.u161.l2139<=0)||(i27.i0.u151.l1388<=0))"))))))
Formula 0 simplified : F(!"(i27.i0.u151.l1388>0)" & XG!"((i27.i3.u161.l2139<=0)||(i27.i0.u151.l1388<=0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9675227333679742397
[2024-05-24 04:38:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9675227333679742397
Running compilation step : cd /tmp/ltsmin9675227333679742397;'/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 2834 ms.
Running link step : cd /tmp/ltsmin9675227333679742397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9675227333679742397;'/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)||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c002-LTLCardinality-06 finished in 118787 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((F(G(p0))&&(p1 U p2))))'
Support contains 3 out of 710 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 : 710/710 places, 1844/1844 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 703 transition count 1828
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 703 transition count 1828
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 703 transition count 1824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 697 transition count 1810
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 697 transition count 1810
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 691 transition count 1792
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 691 transition count 1792
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 685 transition count 1772
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 685 transition count 1772
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 679 transition count 1756
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 679 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 674 transition count 1746
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 674 transition count 1746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 669 transition count 1736
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 669 transition count 1736
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 664 transition count 1726
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 664 transition count 1726
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 661 transition count 1720
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 661 transition count 1720
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 659 transition count 1716
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 659 transition count 1716
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 659 transition count 1706
Applied a total of 116 rules in 340 ms. Remains 659 /710 variables (removed 51) and now considering 1706/1844 (removed 138) transitions.
[2024-05-24 04:38:48] [INFO ] Flow matrix only has 1143 transitions (discarded 563 similar events)
// Phase 1: matrix 1143 rows 659 cols
[2024-05-24 04:38:48] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 04:38:48] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-24 04:38:48] [INFO ] Flow matrix only has 1143 transitions (discarded 563 similar events)
[2024-05-24 04:38:48] [INFO ] Invariant cache hit.
[2024-05-24 04:38:48] [INFO ] State equation strengthened by 281 read => feed constraints.
[2024-05-24 04:38:50] [INFO ] Implicit Places using invariants and state equation in 2222 ms returned []
Implicit Place search using SMT with State Equation took 2630 ms to find 0 implicit places.
[2024-05-24 04:38:50] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-24 04:38:50] [INFO ] Flow matrix only has 1143 transitions (discarded 563 similar events)
[2024-05-24 04:38:50] [INFO ] Invariant cache hit.
[2024-05-24 04:38:51] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 659/710 places, 1706/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3513 ms. Remains : 659/710 places, 1706/1844 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 2 s531), p0:(LEQ s594 s560)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 371 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-07 finished in 4115 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(p0))'
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 709 transition count 1844
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 697 transition count 1816
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 697 transition count 1816
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 33 place count 697 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 43 place count 687 transition count 1784
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 687 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 677 transition count 1756
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 667 transition count 1726
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 667 transition count 1726
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 103 place count 657 transition count 1702
Iterating global reduction 2 with 10 rules applied. Total rules applied 113 place count 657 transition count 1702
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 123 place count 647 transition count 1678
Iterating global reduction 2 with 10 rules applied. Total rules applied 133 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 143 place count 637 transition count 1654
Iterating global reduction 2 with 10 rules applied. Total rules applied 153 place count 637 transition count 1654
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 162 place count 628 transition count 1636
Iterating global reduction 2 with 9 rules applied. Total rules applied 171 place count 628 transition count 1636
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 179 place count 620 transition count 1620
Iterating global reduction 2 with 8 rules applied. Total rules applied 187 place count 620 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 615 transition count 1608
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 612 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 203 place count 612 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 608 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 212 place count 607 transition count 1590
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 605 transition count 1586
Applied a total of 217 rules in 235 ms. Remains 605 /710 variables (removed 105) and now considering 1586/1844 (removed 258) transitions.
[2024-05-24 04:38:52] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-24 04:38:52] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 04:38:52] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-24 04:38:52] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 04:38:52] [INFO ] Invariant cache hit.
[2024-05-24 04:38:52] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 04:38:54] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2024-05-24 04:38:54] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 04:38:54] [INFO ] Invariant cache hit.
[2024-05-24 04:38:54] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/710 places, 1586/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2832 ms. Remains : 605/710 places, 1586/1844 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s163 s356)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 789 ms.
Product exploration explored 100000 steps with 50000 reset in 792 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c002-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLCardinality-13 finished in 4652 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))) U G(p1))))'
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 709 transition count 1844
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 697 transition count 1816
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 697 transition count 1816
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 33 place count 697 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 43 place count 687 transition count 1784
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 687 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 677 transition count 1756
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 667 transition count 1726
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 667 transition count 1726
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 103 place count 657 transition count 1702
Iterating global reduction 2 with 10 rules applied. Total rules applied 113 place count 657 transition count 1702
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 123 place count 647 transition count 1678
Iterating global reduction 2 with 10 rules applied. Total rules applied 133 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 143 place count 637 transition count 1654
Iterating global reduction 2 with 10 rules applied. Total rules applied 153 place count 637 transition count 1654
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 162 place count 628 transition count 1636
Iterating global reduction 2 with 9 rules applied. Total rules applied 171 place count 628 transition count 1636
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 179 place count 620 transition count 1620
Iterating global reduction 2 with 8 rules applied. Total rules applied 187 place count 620 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 615 transition count 1608
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 612 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 203 place count 612 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 608 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 212 place count 607 transition count 1590
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 605 transition count 1586
Applied a total of 217 rules in 235 ms. Remains 605 /710 variables (removed 105) and now considering 1586/1844 (removed 258) transitions.
[2024-05-24 04:38:56] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 04:38:56] [INFO ] Invariant cache hit.
[2024-05-24 04:38:57] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-24 04:38:57] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 04:38:57] [INFO ] Invariant cache hit.
[2024-05-24 04:38:57] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 04:38:58] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2024-05-24 04:38:58] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 04:38:58] [INFO ] Invariant cache hit.
[2024-05-24 04:38:59] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/710 places, 1586/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2553 ms. Remains : 605/710 places, 1586/1844 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(GT 2 s399), p0:(LEQ 1 s406)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16681 reset in 430 ms.
Product exploration explored 100000 steps with 16677 reset in 441 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 209410 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209410 steps, saw 135938 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 04:39:03] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 04:39:03] [INFO ] Invariant cache hit.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-24 04:39:04] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 04:39:05] [INFO ] After 222ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2024-05-24 04:39:05] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 1 ms to minimize.
[2024-05-24 04:39:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-05-24 04:39:05] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-24 04:39:05] [INFO ] After 1348ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Graph (complete) has 2649 edges and 605 vertex of which 413 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 413 transition count 1202
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 413 transition count 1200
Applied a total of 387 rules in 82 ms. Remains 413 /605 variables (removed 192) and now considering 1200/1586 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 413/605 places, 1200/1586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 04:39:05] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-24 04:39:05] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 04:39:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:39:06] [INFO ] After 176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 04:39:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 04:39:06] [INFO ] After 36ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:39:06] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:39:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 04:39:06] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:39:06] [INFO ] After 55ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:39:06] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 1 ms to minimize.
[2024-05-24 04:39:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-24 04:39:06] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-24 04:39:06] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 44 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 413/413 places, 1200/1200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 408482 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 408482 steps, saw 250481 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 04:39:10] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-24 04:39:10] [INFO ] Invariant cache hit.
[2024-05-24 04:39:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 04:39:10] [INFO ] After 177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 04:39:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 04:39:10] [INFO ] After 40ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:39:10] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:39:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 04:39:10] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:39:10] [INFO ] After 65ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:39:10] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 1 ms to minimize.
[2024-05-24 04:39:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-05-24 04:39:10] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-24 04:39:10] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 39 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-24 04:39:11] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-24 04:39:11] [INFO ] Invariant cache hit.
[2024-05-24 04:39:11] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-24 04:39:11] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-24 04:39:11] [INFO ] Invariant cache hit.
[2024-05-24 04:39:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 04:39:12] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
[2024-05-24 04:39:12] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 04:39:12] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-24 04:39:12] [INFO ] Invariant cache hit.
[2024-05-24 04:39:12] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1484 ms. Remains : 413/413 places, 1200/1200 transitions.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 413 transition count 664
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 402 transition count 664
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 547 place count 402 transition count 598
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 679 place count 336 transition count 598
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 929 place count 211 transition count 473
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 991 place count 149 transition count 349
Iterating global reduction 2 with 62 rules applied. Total rules applied 1053 place count 149 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1054 place count 149 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1054 place count 149 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1056 place count 148 transition count 347
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1117 place count 87 transition count 225
Iterating global reduction 3 with 61 rules applied. Total rules applied 1178 place count 87 transition count 225
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1239 place count 26 transition count 103
Iterating global reduction 3 with 61 rules applied. Total rules applied 1300 place count 26 transition count 103
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1361 place count 26 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1363 place count 25 transition count 45
Applied a total of 1363 rules in 24 ms. Remains 25 /413 variables (removed 388) and now considering 45/1200 (removed 1155) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 25 cols
[2024-05-24 04:39:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 04:39:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:12] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:39:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:12] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:39:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 04:39:12] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:39:12] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 04:39:12] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p1)]
Support contains 1 out of 605 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 : 605/605 places, 1586/1586 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 605 transition count 1584
Applied a total of 2 rules in 151 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1586 (removed 2) transitions.
[2024-05-24 04:39:13] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-24 04:39:13] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 04:39:13] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-24 04:39:13] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 04:39:13] [INFO ] Invariant cache hit.
[2024-05-24 04:39:13] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 04:39:14] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
[2024-05-24 04:39:14] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 04:39:14] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 04:39:14] [INFO ] Invariant cache hit.
[2024-05-24 04:39:15] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/605 places, 1584/1586 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2533 ms. Remains : 605/605 places, 1584/1586 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p1)]
Finished random walk after 3368 steps, including 1 resets, run visited all 1 properties in 14 ms. (steps per millisecond=240 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c002-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLCardinality-14 finished in 19311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(p1&&F(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
[2024-05-24 04:39:16] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8873399488794947911
[2024-05-24 04:39:16] [INFO ] Too many transitions (1844) to apply POR reductions. Disabling POR matrices.
[2024-05-24 04:39:16] [INFO ] Applying decomposition
[2024-05-24 04:39:16] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8873399488794947911
Running compilation step : cd /tmp/ltsmin8873399488794947911;'/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 04:39:16] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15800986012431538982.txt' '-o' '/tmp/graph15800986012431538982.bin' '-w' '/tmp/graph15800986012431538982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15800986012431538982.bin' '-l' '-1' '-v' '-w' '/tmp/graph15800986012431538982.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:39:16] [INFO ] Decomposing Gal with order
[2024-05-24 04:39:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:39:16] [INFO ] Removed a total of 3121 redundant transitions.
[2024-05-24 04:39:16] [INFO ] Flatten gal took : 72 ms
[2024-05-24 04:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1383 labels/synchronizations in 86 ms.
[2024-05-24 04:39:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality639471010292550846.gal : 12 ms
[2024-05-24 04:39:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality518121207531006695.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/LTLCardinality639471010292550846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality518121207531006695.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...274
Read 2 LTL properties
Checking formula 0 : !((X((G(F("(i28.u185.l2064<=0)")))||(("(i24.u187.l2042>=2)")&&(F("(i28.u185.l2064<=0)"))))))
Formula 0 simplified : X(FG!"(i28.u185.l2064<=0)" & (!"(i24.u187.l2042>=2)" | G!"(i28.u185.l2064<=0)"))
Compilation finished in 3336 ms.
Running link step : cd /tmp/ltsmin8873399488794947911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8873399488794947911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 24545 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8873399488794947911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 05:00:56] [INFO ] Flatten gal took : 125 ms
[2024-05-24 05:00:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality8583603964013358414.gal : 7 ms
[2024-05-24 05:00:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality10767949044055858053.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/LTLCardinality8583603964013358414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10767949044055858053.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...298
Read 1 LTL properties
Checking formula 0 : !((G(("(l1388>0)")||(X(F("((l2139<=0)||(l1388<=0))"))))))
Formula 0 simplified : F(!"(l1388>0)" & XG!"((l2139<=0)||(l1388<=0))")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin8873399488794947911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin8873399488794947911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 05:22:38] [INFO ] Flatten gal took : 128 ms
[2024-05-24 05:22:38] [INFO ] Input system was already deterministic with 1844 transitions.
[2024-05-24 05:22:38] [INFO ] Transformed 710 places.
[2024-05-24 05:22:38] [INFO ] Transformed 1844 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 05:22:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality9487777834387486417.gal : 15 ms
[2024-05-24 05:22:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality16019105973775314374.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/LTLCardinality9487777834387486417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16019105973775314374.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 : !((G(("(l1388>0)")||(X(F("((l2139<=0)||(l1388<=0))"))))))
Formula 0 simplified : F(!"(l1388>0)" & XG!"((l2139<=0)||(l1388<=0))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6143360 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16035884 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-c002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625000172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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