Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850800739.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FunctionPointer-PT-c016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850800739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679575405899

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 12:43:27] [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]
[2023-03-23 12:43:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:43:27] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2023-03-23 12:43:27] [INFO ] Transformed 2826 places.
[2023-03-23 12:43:27] [INFO ] Transformed 8960 transitions.
[2023-03-23 12:43:27] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 552 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 315 place count 1313 transition count 3674
Iterating global reduction 1 with 298 rules applied. Total rules applied 613 place count 1313 transition count 3674
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 961 place count 1313 transition count 3326
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1116 place count 1158 transition count 3016
Iterating global reduction 2 with 155 rules applied. Total rules applied 1271 place count 1158 transition count 3016
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1335 place count 1158 transition count 2952
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1348 place count 1145 transition count 2926
Iterating global reduction 3 with 13 rules applied. Total rules applied 1361 place count 1145 transition count 2926
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1373 place count 1133 transition count 2902
Iterating global reduction 3 with 12 rules applied. Total rules applied 1385 place count 1133 transition count 2902
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1397 place count 1121 transition count 2878
Iterating global reduction 3 with 12 rules applied. Total rules applied 1409 place count 1121 transition count 2878
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1421 place count 1109 transition count 2854
Iterating global reduction 3 with 12 rules applied. Total rules applied 1433 place count 1109 transition count 2854
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1445 place count 1097 transition count 2830
Iterating global reduction 3 with 12 rules applied. Total rules applied 1457 place count 1097 transition count 2830
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1468 place count 1086 transition count 2808
Iterating global reduction 3 with 11 rules applied. Total rules applied 1479 place count 1086 transition count 2808
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1488 place count 1077 transition count 2790
Iterating global reduction 3 with 9 rules applied. Total rules applied 1497 place count 1077 transition count 2790
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1539 place count 1035 transition count 2630
Iterating global reduction 3 with 42 rules applied. Total rules applied 1581 place count 1035 transition count 2630
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1630 place count 986 transition count 2434
Iterating global reduction 3 with 49 rules applied. Total rules applied 1679 place count 986 transition count 2434
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1728 place count 937 transition count 2314
Iterating global reduction 3 with 49 rules applied. Total rules applied 1777 place count 937 transition count 2314
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1826 place count 888 transition count 2216
Iterating global reduction 3 with 49 rules applied. Total rules applied 1875 place count 888 transition count 2216
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 1923 place count 840 transition count 2120
Iterating global reduction 3 with 48 rules applied. Total rules applied 1971 place count 840 transition count 2120
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2019 place count 792 transition count 2024
Iterating global reduction 3 with 48 rules applied. Total rules applied 2067 place count 792 transition count 2024
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 2114 place count 745 transition count 1930
Iterating global reduction 3 with 47 rules applied. Total rules applied 2161 place count 745 transition count 1930
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2172 place count 734 transition count 1908
Iterating global reduction 3 with 11 rules applied. Total rules applied 2183 place count 734 transition count 1908
Applied a total of 2183 rules in 1164 ms. Remains 734 /1628 variables (removed 894) and now considering 1908/5962 (removed 4054) transitions.
[2023-03-23 12:43:29] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
// Phase 1: matrix 1283 rows 734 cols
[2023-03-23 12:43:29] [INFO ] Computed 2 place invariants in 40 ms
[2023-03-23 12:43:30] [INFO ] Implicit Places using invariants in 886 ms returned []
[2023-03-23 12:43:30] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-23 12:43:30] [INFO ] Invariant cache hit.
[2023-03-23 12:43:30] [INFO ] State equation strengthened by 311 read => feed constraints.
[2023-03-23 12:43:32] [INFO ] Implicit Places using invariants and state equation in 2591 ms returned []
Implicit Place search using SMT with State Equation took 3503 ms to find 0 implicit places.
[2023-03-23 12:43:32] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-23 12:43:32] [INFO ] Invariant cache hit.
[2023-03-23 12:43:33] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 734/1628 places, 1908/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5322 ms. Remains : 734/1628 places, 1908/5962 transitions.
Support contains 14 out of 734 places after structural reductions.
[2023-03-23 12:43:33] [INFO ] Flatten gal took : 138 ms
[2023-03-23 12:43:33] [INFO ] Flatten gal took : 96 ms
[2023-03-23 12:43:34] [INFO ] Input system was already deterministic with 1908 transitions.
Incomplete random walk after 10015 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) 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 6) seen :1
Running SMT prover for 5 properties.
[2023-03-23 12:43:34] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-23 12:43:34] [INFO ] Invariant cache hit.
[2023-03-23 12:43:34] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 12:43:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:43:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:43:35] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-23 12:43:35] [INFO ] State equation strengthened by 311 read => feed constraints.
[2023-03-23 12:43:35] [INFO ] After 203ms SMT Verify possible using 311 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-23 12:43:35] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-23 12:43:36] [INFO ] After 1318ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 7 out of 734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Graph (complete) has 3130 edges and 734 vertex of which 542 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.5 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 542 transition count 1524
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 391 place count 536 transition count 1510
Iterating global reduction 1 with 6 rules applied. Total rules applied 397 place count 536 transition count 1510
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 403 place count 536 transition count 1504
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 409 place count 530 transition count 1490
Iterating global reduction 2 with 6 rules applied. Total rules applied 415 place count 530 transition count 1490
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 420 place count 525 transition count 1480
Iterating global reduction 2 with 5 rules applied. Total rules applied 425 place count 525 transition count 1480
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 433 place count 517 transition count 1452
Iterating global reduction 2 with 8 rules applied. Total rules applied 441 place count 517 transition count 1452
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 449 place count 509 transition count 1424
Iterating global reduction 2 with 8 rules applied. Total rules applied 457 place count 509 transition count 1424
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 465 place count 501 transition count 1408
Iterating global reduction 2 with 8 rules applied. Total rules applied 473 place count 501 transition count 1408
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 481 place count 493 transition count 1392
Iterating global reduction 2 with 8 rules applied. Total rules applied 489 place count 493 transition count 1392
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 496 place count 486 transition count 1378
Iterating global reduction 2 with 7 rules applied. Total rules applied 503 place count 486 transition count 1378
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 512 place count 477 transition count 1354
Iterating global reduction 2 with 9 rules applied. Total rules applied 521 place count 477 transition count 1354
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 530 place count 468 transition count 1330
Iterating global reduction 2 with 9 rules applied. Total rules applied 539 place count 468 transition count 1330
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 542 place count 465 transition count 1324
Iterating global reduction 2 with 3 rules applied. Total rules applied 545 place count 465 transition count 1324
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 548 place count 462 transition count 1318
Iterating global reduction 2 with 3 rules applied. Total rules applied 551 place count 462 transition count 1318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 554 place count 459 transition count 1312
Iterating global reduction 2 with 3 rules applied. Total rules applied 557 place count 459 transition count 1312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 560 place count 456 transition count 1306
Iterating global reduction 2 with 3 rules applied. Total rules applied 563 place count 456 transition count 1306
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 566 place count 453 transition count 1300
Iterating global reduction 2 with 3 rules applied. Total rules applied 569 place count 453 transition count 1300
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 579 place count 453 transition count 1290
Applied a total of 579 rules in 386 ms. Remains 453 /734 variables (removed 281) and now considering 1290/1908 (removed 618) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 453/734 places, 1290/1908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-23 12:43:36] [INFO ] Flow matrix only has 737 transitions (discarded 553 similar events)
// Phase 1: matrix 737 rows 453 cols
[2023-03-23 12:43:36] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-23 12:43:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:43:36] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 12:43:36] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-23 12:43:36] [INFO ] After 44ms SMT Verify possible using 85 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:43:36] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:43:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:43:37] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:43:37] [INFO ] After 95ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:43:37] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-23 12:43:37] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 1290/1290 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 450 transition count 1284
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 450 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 447 transition count 1274
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 447 transition count 1274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 444 transition count 1268
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 444 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 441 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 441 transition count 1262
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 438 transition count 1256
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 438 transition count 1256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 435 transition count 1250
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 435 transition count 1250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 432 transition count 1244
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 432 transition count 1244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 429 transition count 1236
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 428 transition count 1234
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 427 transition count 1232
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 427 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 426 transition count 1230
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 426 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 425 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 425 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 424 transition count 1226
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 423 transition count 1224
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 423 transition count 1224
Applied a total of 60 rules in 175 ms. Remains 423 /453 variables (removed 30) and now considering 1224/1290 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 423/453 places, 1224/1290 transitions.
Finished random walk after 700 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=233 )
FORMULA FunctionPointer-PT-c016-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA FunctionPointer-PT-c016-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 221 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-23 12:43:37] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-23 12:43:37] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-23 12:43:38] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-23 12:43:38] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:43:38] [INFO ] Invariant cache hit.
[2023-03-23 12:43:38] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:43:39] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-23 12:43:39] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:43:39] [INFO ] Invariant cache hit.
[2023-03-23 12:43:40] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2789 ms. Remains : 613/734 places, 1606/1908 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-01 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s540 0)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 717 ms.
Product exploration explored 100000 steps with 33333 reset in 621 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-01 finished in 4519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G(p1))))'
Support contains 2 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 725 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 716 transition count 1858
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 707 transition count 1836
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 707 transition count 1836
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 694 transition count 1794
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 694 transition count 1794
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 99 place count 681 transition count 1752
Iterating global reduction 1 with 13 rules applied. Total rules applied 112 place count 681 transition count 1752
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 125 place count 668 transition count 1726
Iterating global reduction 1 with 13 rules applied. Total rules applied 138 place count 668 transition count 1726
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 151 place count 655 transition count 1700
Iterating global reduction 1 with 13 rules applied. Total rules applied 164 place count 655 transition count 1700
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 177 place count 642 transition count 1670
Iterating global reduction 1 with 13 rules applied. Total rules applied 190 place count 642 transition count 1670
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 201 place count 631 transition count 1642
Iterating global reduction 1 with 11 rules applied. Total rules applied 212 place count 631 transition count 1642
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 223 place count 620 transition count 1618
Iterating global reduction 1 with 11 rules applied. Total rules applied 234 place count 620 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 237 place count 617 transition count 1612
Iterating global reduction 1 with 3 rules applied. Total rules applied 240 place count 617 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 243 place count 614 transition count 1606
Iterating global reduction 1 with 3 rules applied. Total rules applied 246 place count 614 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 249 place count 611 transition count 1600
Iterating global reduction 1 with 3 rules applied. Total rules applied 252 place count 611 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 255 place count 608 transition count 1594
Iterating global reduction 1 with 3 rules applied. Total rules applied 258 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 607 transition count 1592
Applied a total of 260 rules in 225 ms. Remains 607 /734 variables (removed 127) and now considering 1592/1908 (removed 316) transitions.
[2023-03-23 12:43:42] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2023-03-23 12:43:42] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-23 12:43:42] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-23 12:43:42] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-23 12:43:42] [INFO ] Invariant cache hit.
[2023-03-23 12:43:43] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-23 12:43:45] [INFO ] Implicit Places using invariants and state equation in 2640 ms returned []
Implicit Place search using SMT with State Equation took 3086 ms to find 0 implicit places.
[2023-03-23 12:43:45] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-23 12:43:45] [INFO ] Invariant cache hit.
[2023-03-23 12:43:45] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/734 places, 1592/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3840 ms. Remains : 607/734 places, 1592/1908 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s76 0), p0:(LEQ s521 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33175 reset in 609 ms.
Product exploration explored 100000 steps with 33385 reset in 590 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/607 stabilizing places and 512/1592 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 667 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:43:48] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-23 12:43:48] [INFO ] Invariant cache hit.
[2023-03-23 12:43:48] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:43:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:43:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:43:48] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:43:48] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-23 12:43:48] [INFO ] After 62ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:43:49] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-23 12:43:49] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Graph (complete) has 2656 edges and 607 vertex of which 415 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 415 transition count 1208
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 415 transition count 1206
Applied a total of 387 rules in 100 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1592 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 415/607 places, 1206/1592 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 7412 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1058 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 14 factoid took 211 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-06 finished in 7264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 206 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-23 12:43:49] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-23 12:43:49] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-23 12:43:50] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-23 12:43:50] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:43:50] [INFO ] Invariant cache hit.
[2023-03-23 12:43:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:43:51] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
[2023-03-23 12:43:51] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:43:51] [INFO ] Invariant cache hit.
[2023-03-23 12:43:52] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2671 ms. Remains : 613/734 places, 1606/1908 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ s533 s474) (LEQ s70 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 441 ms.
Product exploration explored 100000 steps with 4 reset in 601 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 499299 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499299 steps, saw 324077 distinct states, run finished after 3006 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:43:56] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:43:56] [INFO ] Invariant cache hit.
[2023-03-23 12:43:56] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:43:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:43:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:43:56] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:43:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:43:56] [INFO ] After 69ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:43:57] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-23 12:43:57] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 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 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 102 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608987 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608987 steps, saw 373419 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:44:00] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-23 12:44:00] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-23 12:44:00] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:44:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:44:00] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:44:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:44:00] [INFO ] After 60ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:44:00] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-23 12:44:00] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-23 12:44:00] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:44:00] [INFO ] Invariant cache hit.
[2023-03-23 12:44:01] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-23 12:44:01] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:44:01] [INFO ] Invariant cache hit.
[2023-03-23 12:44:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:44:02] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2023-03-23 12:44:02] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-23 12:44:02] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:44:02] [INFO ] Invariant cache hit.
[2023-03-23 12:44:02] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1725 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 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 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
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 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
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 1381 place count 26 transition count 46
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 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 57 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-23 12:44:02] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 12:44:02] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:44:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 12:44:02] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:44:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:44:02] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:44:02] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 12:44:02] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 15 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-23 12:44:03] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-23 12:44:03] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 12:44:03] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-23 12:44:03] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:44:03] [INFO ] Invariant cache hit.
[2023-03-23 12:44:03] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:44:04] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2023-03-23 12:44:04] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:44:04] [INFO ] Invariant cache hit.
[2023-03-23 12:44:05] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2448 ms. Remains : 613/613 places, 1606/1606 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 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 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 509600 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 509600 steps, saw 330762 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:44:08] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:44:08] [INFO ] Invariant cache hit.
[2023-03-23 12:44:08] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:44:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:44:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:44:09] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:44:09] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:44:09] [INFO ] After 73ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:44:09] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-23 12:44:09] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 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 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 95 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 421/613 places, 1218/1606 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
Finished Best-First random walk after 8409 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1401 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 434 ms.
Product exploration explored 100000 steps with 0 reset in 545 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 287 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2023-03-23 12:44:11] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-23 12:44:11] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-23 12:44:11] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 12:44:12] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 872 ms. Remains : 613/613 places, 1602/1606 transitions.
Built C files in :
/tmp/ltsmin16892126586941498535
[2023-03-23 12:44:12] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16892126586941498535
Running compilation step : cd /tmp/ltsmin16892126586941498535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2820 ms.
Running link step : cd /tmp/ltsmin16892126586941498535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16892126586941498535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4320379685921273573.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 16 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-23 12:44:27] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-23 12:44:27] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 12:44:27] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-23 12:44:27] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:44:27] [INFO ] Invariant cache hit.
[2023-03-23 12:44:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:44:29] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
[2023-03-23 12:44:29] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:44:29] [INFO ] Invariant cache hit.
[2023-03-23 12:44:29] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2443 ms. Remains : 613/613 places, 1606/1606 transitions.
Built C files in :
/tmp/ltsmin4175886974933663205
[2023-03-23 12:44:29] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4175886974933663205
Running compilation step : cd /tmp/ltsmin4175886974933663205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2831 ms.
Running link step : cd /tmp/ltsmin4175886974933663205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4175886974933663205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11633776802450726243.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 12:44:45] [INFO ] Flatten gal took : 125 ms
[2023-03-23 12:44:45] [INFO ] Flatten gal took : 105 ms
[2023-03-23 12:44:45] [INFO ] Time to serialize gal into /tmp/LTL6979348227808750798.gal : 27 ms
[2023-03-23 12:44:45] [INFO ] Time to serialize properties into /tmp/LTL18065048488451132822.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6979348227808750798.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1837244338846852951.hoa' '-atoms' '/tmp/LTL18065048488451132822.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18065048488451132822.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1837244338846852951.hoa
Detected timeout of ITS tools.
[2023-03-23 12:45:00] [INFO ] Flatten gal took : 71 ms
[2023-03-23 12:45:00] [INFO ] Flatten gal took : 50 ms
[2023-03-23 12:45:00] [INFO ] Time to serialize gal into /tmp/LTL7627460321928611698.gal : 22 ms
[2023-03-23 12:45:00] [INFO ] Time to serialize properties into /tmp/LTL2523109283002283495.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7627460321928611698.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2523109283002283495.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((l1572<=l980)||(l448<=0))")))))
Formula 0 simplified : XXF!"((l1572<=l980)||(l448<=0))"
Detected timeout of ITS tools.
[2023-03-23 12:45:15] [INFO ] Flatten gal took : 59 ms
[2023-03-23 12:45:15] [INFO ] Applying decomposition
[2023-03-23 12:45:15] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5097789140172994752.txt' '-o' '/tmp/graph5097789140172994752.bin' '-w' '/tmp/graph5097789140172994752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5097789140172994752.bin' '-l' '-1' '-v' '-w' '/tmp/graph5097789140172994752.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:45:16] [INFO ] Decomposing Gal with order
[2023-03-23 12:45:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:45:16] [INFO ] Removed a total of 535 redundant transitions.
[2023-03-23 12:45:17] [INFO ] Flatten gal took : 754 ms
[2023-03-23 12:45:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 54 ms.
[2023-03-23 12:45:17] [INFO ] Time to serialize gal into /tmp/LTL11259858739979388037.gal : 44 ms
[2023-03-23 12:45:17] [INFO ] Time to serialize properties into /tmp/LTL4639976985455203583.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11259858739979388037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4639976985455203583.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((gu60.l1572<=gu60.l980)||(gi0.gu0.l448<=0))")))))
Formula 0 simplified : XXF!"((gu60.l1572<=gu60.l980)||(gi0.gu0.l448<=0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6383857762860509758
[2023-03-23 12:45:32] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6383857762860509758
Running compilation step : cd /tmp/ltsmin6383857762860509758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2944 ms.
Running link step : cd /tmp/ltsmin6383857762860509758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6383857762860509758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 118161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0)) U p1))))'
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 726 transition count 1890
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 726 transition count 1890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 726 transition count 1884
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 718 transition count 1862
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 718 transition count 1862
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 711 transition count 1844
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 711 transition count 1844
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 701 transition count 1812
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 701 transition count 1812
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 691 transition count 1780
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 691 transition count 1780
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 681 transition count 1760
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 681 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 671 transition count 1740
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 671 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 141 place count 662 transition count 1722
Iterating global reduction 1 with 9 rules applied. Total rules applied 150 place count 662 transition count 1722
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 159 place count 653 transition count 1698
Iterating global reduction 1 with 9 rules applied. Total rules applied 168 place count 653 transition count 1698
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 177 place count 644 transition count 1674
Iterating global reduction 1 with 9 rules applied. Total rules applied 186 place count 644 transition count 1674
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 641 transition count 1668
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 641 transition count 1668
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 638 transition count 1662
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 638 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 201 place count 635 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 204 place count 635 transition count 1656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 207 place count 632 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 210 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 213 place count 629 transition count 1644
Iterating global reduction 1 with 3 rules applied. Total rules applied 216 place count 629 transition count 1644
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 222 place count 629 transition count 1638
Applied a total of 222 rules in 481 ms. Remains 629 /734 variables (removed 105) and now considering 1638/1908 (removed 270) transitions.
[2023-03-23 12:45:48] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2023-03-23 12:45:48] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-23 12:45:48] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-23 12:45:48] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-23 12:45:48] [INFO ] Invariant cache hit.
[2023-03-23 12:45:48] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 12:45:50] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2472 ms to find 0 implicit places.
[2023-03-23 12:45:50] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 12:45:50] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-23 12:45:50] [INFO ] Invariant cache hit.
[2023-03-23 12:45:51] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 629/734 places, 1638/1908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3541 ms. Remains : 629/734 places, 1638/1908 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s547), p0:(LEQ s554 s615)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 25 reset in 572 ms.
Product exploration explored 100000 steps with 8 reset in 676 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 p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 559 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 178932 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178932 steps, saw 116156 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:45:56] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-23 12:45:56] [INFO ] Invariant cache hit.
[2023-03-23 12:45:56] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:45:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:45:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:45:57] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:45:57] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 12:45:57] [INFO ] After 140ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:45:57] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-23 12:45:57] [INFO ] After 900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1638/1638 transitions.
Graph (complete) has 2732 edges and 629 vertex of which 437 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 437 transition count 1254
Applied a total of 385 rules in 49 ms. Remains 437 /629 variables (removed 192) and now considering 1254/1638 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 437/629 places, 1254/1638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 12:45:57] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
// Phase 1: matrix 711 rows 437 cols
[2023-03-23 12:45:57] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-23 12:45:57] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:45:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:45:58] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 12:45:58] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 12:45:58] [INFO ] After 66ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 12:45:58] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-23 12:45:58] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1254/1254 transitions.
Applied a total of 0 rules in 44 ms. Remains 437 /437 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 437/437 places, 1254/1254 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) 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.
[2023-03-23 12:45:58] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
[2023-03-23 12:45:58] [INFO ] Invariant cache hit.
[2023-03-23 12:45:58] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:45:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:45:58] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:45:58] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 12:45:58] [INFO ] After 46ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:45:58] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-23 12:45:58] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1254/1254 transitions.
Applied a total of 0 rules in 44 ms. Remains 437 /437 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 437/437 places, 1254/1254 transitions.
Incomplete random walk after 10001 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 577770 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 577770 steps, saw 354280 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:46:01] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
[2023-03-23 12:46:01] [INFO ] Invariant cache hit.
[2023-03-23 12:46:01] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:46:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:02] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:02] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 12:46:02] [INFO ] After 50ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:02] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-23 12:46:02] [INFO ] After 404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1254/1254 transitions.
Applied a total of 0 rules in 45 ms. Remains 437 /437 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 437/437 places, 1254/1254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1254/1254 transitions.
Applied a total of 0 rules in 52 ms. Remains 437 /437 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-23 12:46:02] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
[2023-03-23 12:46:02] [INFO ] Invariant cache hit.
[2023-03-23 12:46:02] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-23 12:46:02] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
[2023-03-23 12:46:02] [INFO ] Invariant cache hit.
[2023-03-23 12:46:02] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-23 12:46:03] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2023-03-23 12:46:03] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-23 12:46:03] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
[2023-03-23 12:46:03] [INFO ] Invariant cache hit.
[2023-03-23 12:46:04] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1780 ms. Remains : 437/437 places, 1254/1254 transitions.
Ensure Unique test removed 543 transitions
Reduce isomorphic transitions removed 543 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 437 transition count 695
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 575 place count 421 transition count 695
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 575 place count 421 transition count 619
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 727 place count 345 transition count 619
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 981 place count 218 transition count 492
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1044 place count 155 transition count 366
Iterating global reduction 2 with 63 rules applied. Total rules applied 1107 place count 155 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1108 place count 155 transition count 365
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1170 place count 93 transition count 241
Iterating global reduction 3 with 62 rules applied. Total rules applied 1232 place count 93 transition count 241
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1294 place count 31 transition count 117
Iterating global reduction 3 with 62 rules applied. Total rules applied 1356 place count 31 transition count 117
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1418 place count 31 transition count 55
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 1420 place count 30 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1426 place count 27 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1429 place count 27 transition count 52
Applied a total of 1429 rules in 26 ms. Remains 27 /437 variables (removed 410) and now considering 52/1254 (removed 1202) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 27 cols
[2023-03-23 12:46:04] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 12:46:04] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:46:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 12:46:04] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:46:04] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:04] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 12:46:04] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 8 factoid took 429 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-23 12:46:05] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2023-03-23 12:46:05] [INFO ] Computed 2 place invariants in 4 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-12 finished in 18622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 734 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 725 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 708 transition count 1838
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 708 transition count 1838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 697 transition count 1804
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 697 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 686 transition count 1770
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 686 transition count 1770
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 113 place count 675 transition count 1748
Iterating global reduction 1 with 11 rules applied. Total rules applied 124 place count 675 transition count 1748
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 135 place count 664 transition count 1726
Iterating global reduction 1 with 11 rules applied. Total rules applied 146 place count 664 transition count 1726
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 158 place count 652 transition count 1696
Iterating global reduction 1 with 12 rules applied. Total rules applied 170 place count 652 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 180 place count 642 transition count 1668
Iterating global reduction 1 with 10 rules applied. Total rules applied 190 place count 642 transition count 1668
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 200 place count 632 transition count 1646
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 632 transition count 1646
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 214 place count 628 transition count 1638
Iterating global reduction 1 with 4 rules applied. Total rules applied 218 place count 628 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 222 place count 624 transition count 1630
Iterating global reduction 1 with 4 rules applied. Total rules applied 226 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 230 place count 620 transition count 1622
Iterating global reduction 1 with 4 rules applied. Total rules applied 234 place count 620 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 238 place count 616 transition count 1614
Iterating global reduction 1 with 4 rules applied. Total rules applied 242 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 615 transition count 1612
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 248 place count 615 transition count 1608
Applied a total of 248 rules in 415 ms. Remains 615 /734 variables (removed 119) and now considering 1608/1908 (removed 300) transitions.
[2023-03-23 12:46:06] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-23 12:46:06] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 12:46:07] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-23 12:46:07] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:07] [INFO ] Invariant cache hit.
[2023-03-23 12:46:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:08] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2023-03-23 12:46:09] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-23 12:46:09] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:09] [INFO ] Invariant cache hit.
[2023-03-23 12:46:09] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/734 places, 1608/1908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3405 ms. Remains : 615/734 places, 1608/1908 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s544)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 435 ms.
Stack based approach found an accepted trace after 1157 steps with 1 reset with depth 790 and stack size 790 in 6 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-14 finished in 3894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLCardinality-07
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 249 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-23 12:46:10] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-23 12:46:10] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-23 12:46:11] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-23 12:46:11] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:46:11] [INFO ] Invariant cache hit.
[2023-03-23 12:46:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:12] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
[2023-03-23 12:46:12] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:46:12] [INFO ] Invariant cache hit.
[2023-03-23 12:46:13] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2798 ms. Remains : 613/734 places, 1606/1908 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ s533 s474) (LEQ s70 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 432 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 510515 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 510515 steps, saw 331357 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:46:17] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:46:17] [INFO ] Invariant cache hit.
[2023-03-23 12:46:17] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:46:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:46:17] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:17] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:17] [INFO ] After 74ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:17] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-23 12:46:17] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 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 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 88 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625877 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625877 steps, saw 383776 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:46:21] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-23 12:46:21] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-23 12:46:21] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:46:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:21] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:46:21] [INFO ] After 56ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:21] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-23 12:46:21] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 51 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 50 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-23 12:46:21] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:46:21] [INFO ] Invariant cache hit.
[2023-03-23 12:46:21] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-23 12:46:21] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:46:21] [INFO ] Invariant cache hit.
[2023-03-23 12:46:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:46:22] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2023-03-23 12:46:23] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-23 12:46:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:46:23] [INFO ] Invariant cache hit.
[2023-03-23 12:46:23] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1859 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 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 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
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 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1381 place count 26 transition count 46
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 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 39 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-23 12:46:23] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 12:46:23] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:46:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 12:46:23] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:46:23] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:23] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 12:46:23] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 14 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-23 12:46:24] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-23 12:46:24] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 12:46:24] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-23 12:46:24] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:46:24] [INFO ] Invariant cache hit.
[2023-03-23 12:46:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:25] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1970 ms to find 0 implicit places.
[2023-03-23 12:46:25] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:46:25] [INFO ] Invariant cache hit.
[2023-03-23 12:46:26] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2569 ms. Remains : 613/613 places, 1606/1606 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 521860 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 521860 steps, saw 338720 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:46:29] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:46:29] [INFO ] Invariant cache hit.
[2023-03-23 12:46:29] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:46:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:46:30] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:30] [INFO ] After 74ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:46:30] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-23 12:46:30] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 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 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 86 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 421/613 places, 1218/1606 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
Finished Best-First random walk after 3211 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1605 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 419 ms.
Product exploration explored 100000 steps with 1 reset in 531 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 143 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2023-03-23 12:46:32] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-23 12:46:32] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-23 12:46:32] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-23 12:46:33] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 752 ms. Remains : 613/613 places, 1602/1606 transitions.
Built C files in :
/tmp/ltsmin9423318525326579484
[2023-03-23 12:46:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9423318525326579484
Running compilation step : cd /tmp/ltsmin9423318525326579484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2915 ms.
Running link step : cd /tmp/ltsmin9423318525326579484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9423318525326579484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11237045150338250705.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 11 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-23 12:46:48] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-23 12:46:48] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 12:46:48] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-23 12:46:48] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:46:48] [INFO ] Invariant cache hit.
[2023-03-23 12:46:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:50] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
[2023-03-23 12:46:50] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-23 12:46:50] [INFO ] Invariant cache hit.
[2023-03-23 12:46:50] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2531 ms. Remains : 613/613 places, 1606/1606 transitions.
Built C files in :
/tmp/ltsmin756052011208064131
[2023-03-23 12:46:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin756052011208064131
Running compilation step : cd /tmp/ltsmin756052011208064131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2846 ms.
Running link step : cd /tmp/ltsmin756052011208064131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin756052011208064131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4054882207983539357.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 12:47:05] [INFO ] Flatten gal took : 128 ms
[2023-03-23 12:47:06] [INFO ] Flatten gal took : 91 ms
[2023-03-23 12:47:06] [INFO ] Time to serialize gal into /tmp/LTL7580717553145577961.gal : 20 ms
[2023-03-23 12:47:06] [INFO ] Time to serialize properties into /tmp/LTL15777845609087210847.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7580717553145577961.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15075121157219884885.hoa' '-atoms' '/tmp/LTL15777845609087210847.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15777845609087210847.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15075121157219884885.hoa
Detected timeout of ITS tools.
[2023-03-23 12:47:21] [INFO ] Flatten gal took : 40 ms
[2023-03-23 12:47:21] [INFO ] Flatten gal took : 91 ms
[2023-03-23 12:47:21] [INFO ] Time to serialize gal into /tmp/LTL897543731061023110.gal : 25 ms
[2023-03-23 12:47:21] [INFO ] Time to serialize properties into /tmp/LTL12573785350771800080.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL897543731061023110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12573785350771800080.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((l1572<=l980)||(l448<=0))")))))
Formula 0 simplified : XXF!"((l1572<=l980)||(l448<=0))"
Detected timeout of ITS tools.
[2023-03-23 12:47:36] [INFO ] Flatten gal took : 50 ms
[2023-03-23 12:47:36] [INFO ] Applying decomposition
[2023-03-23 12:47:36] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6022524771619784506.txt' '-o' '/tmp/graph6022524771619784506.bin' '-w' '/tmp/graph6022524771619784506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6022524771619784506.bin' '-l' '-1' '-v' '-w' '/tmp/graph6022524771619784506.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:47:36] [INFO ] Decomposing Gal with order
[2023-03-23 12:47:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:47:36] [INFO ] Removed a total of 517 redundant transitions.
[2023-03-23 12:47:36] [INFO ] Flatten gal took : 137 ms
[2023-03-23 12:47:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 18 ms.
[2023-03-23 12:47:37] [INFO ] Time to serialize gal into /tmp/LTL4944535260117495693.gal : 22 ms
[2023-03-23 12:47:37] [INFO ] Time to serialize properties into /tmp/LTL10012189566028121637.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4944535260117495693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10012189566028121637.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((gu58.l1572<=gu58.l980)||(gi0.gu0.l448<=0))")))))
Formula 0 simplified : XXF!"((gu58.l1572<=gu58.l980)||(gi0.gu0.l448<=0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9572698996153995634
[2023-03-23 12:47:52] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9572698996153995634
Running compilation step : cd /tmp/ltsmin9572698996153995634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2713 ms.
Running link step : cd /tmp/ltsmin9572698996153995634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9572698996153995634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 117121 ms.
[2023-03-23 12:48:07] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5120334353174840562
[2023-03-23 12:48:07] [INFO ] Too many transitions (1908) to apply POR reductions. Disabling POR matrices.
[2023-03-23 12:48:07] [INFO ] Applying decomposition
[2023-03-23 12:48:07] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5120334353174840562
Running compilation step : cd /tmp/ltsmin5120334353174840562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 12:48:07] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph17422714761222829774.txt' '-o' '/tmp/graph17422714761222829774.bin' '-w' '/tmp/graph17422714761222829774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17422714761222829774.bin' '-l' '-1' '-v' '-w' '/tmp/graph17422714761222829774.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:48:07] [INFO ] Decomposing Gal with order
[2023-03-23 12:48:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:48:07] [INFO ] Removed a total of 567 redundant transitions.
[2023-03-23 12:48:07] [INFO ] Flatten gal took : 85 ms
[2023-03-23 12:48:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 288 labels/synchronizations in 12 ms.
[2023-03-23 12:48:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality11116995069581990881.gal : 8 ms
[2023-03-23 12:48:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality16185105000564638995.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11116995069581990881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16185105000564638995.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((gu51.l1572<=gu51.l980)||(gi0.gu2.l448<=0))")))))
Formula 0 simplified : XXF!"((gu51.l1572<=gu51.l980)||(gi0.gu2.l448<=0))"
Compilation finished in 3542 ms.
Running link step : cd /tmp/ltsmin5120334353174840562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5120334353174840562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-23 13:09:41] [INFO ] Flatten gal took : 155 ms
[2023-03-23 13:09:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality18175604438442526766.gal : 8 ms
[2023-03-23 13:09:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality1075295880185422083.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18175604438442526766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1075295880185422083.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((l1572<=l980)||(l448<=0))")))))
Formula 0 simplified : XXF!"((l1572<=l980)||(l448<=0))"
Detected timeout of ITS tools.
[2023-03-23 13:31:16] [INFO ] Flatten gal took : 149 ms
[2023-03-23 13:31:16] [INFO ] Input system was already deterministic with 1908 transitions.
[2023-03-23 13:31:16] [INFO ] Transformed 734 places.
[2023-03-23 13:31:16] [INFO ] Transformed 1908 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 13:31:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality9329307102880456712.gal : 6 ms
[2023-03-23 13:31:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality3724512068763515195.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9329307102880456712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3724512068763515195.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G("((l1572<=l980)||(l448<=0))")))))
Formula 0 simplified : XXF!"((l1572<=l980)||(l448<=0))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7083984 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16026984 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-c016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c016, 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 r165-tall-167838850800739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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