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.r169-tall-167838856400764.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 ltsminxred
Input is FunctionPointer-PT-c128, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856400764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 12:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 12:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:03 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-c128-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678642813028

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:40:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:40:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:40:14] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2023-03-12 17:40:14] [INFO ] Transformed 2826 places.
[2023-03-12 17:40:15] [INFO ] Transformed 8960 transitions.
[2023-03-12 17:40:15] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 42 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c128-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-11 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 3698
Iterating global reduction 1 with 298 rules applied. Total rules applied 613 place count 1313 transition count 3698
Ensure Unique test removed 368 transitions
Reduce isomorphic transitions removed 368 transitions.
Iterating post reduction 1 with 368 rules applied. Total rules applied 981 place count 1313 transition count 3330
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1137 place count 1157 transition count 3018
Iterating global reduction 2 with 156 rules applied. Total rules applied 1293 place count 1157 transition count 3018
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1365 place count 1157 transition count 2946
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1379 place count 1143 transition count 2918
Iterating global reduction 3 with 14 rules applied. Total rules applied 1393 place count 1143 transition count 2918
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1407 place count 1129 transition count 2890
Iterating global reduction 3 with 14 rules applied. Total rules applied 1421 place count 1129 transition count 2890
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1435 place count 1115 transition count 2862
Iterating global reduction 3 with 14 rules applied. Total rules applied 1449 place count 1115 transition count 2862
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1463 place count 1101 transition count 2834
Iterating global reduction 3 with 14 rules applied. Total rules applied 1477 place count 1101 transition count 2834
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1491 place count 1087 transition count 2806
Iterating global reduction 3 with 14 rules applied. Total rules applied 1505 place count 1087 transition count 2806
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1519 place count 1073 transition count 2778
Iterating global reduction 3 with 14 rules applied. Total rules applied 1533 place count 1073 transition count 2778
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1546 place count 1060 transition count 2752
Iterating global reduction 3 with 13 rules applied. Total rules applied 1559 place count 1060 transition count 2752
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 1619 place count 1000 transition count 2524
Iterating global reduction 3 with 60 rules applied. Total rules applied 1679 place count 1000 transition count 2524
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1738 place count 941 transition count 2288
Iterating global reduction 3 with 59 rules applied. Total rules applied 1797 place count 941 transition count 2288
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1856 place count 882 transition count 2158
Iterating global reduction 3 with 59 rules applied. Total rules applied 1915 place count 882 transition count 2158
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1973 place count 824 transition count 2042
Iterating global reduction 3 with 58 rules applied. Total rules applied 2031 place count 824 transition count 2042
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2088 place count 767 transition count 1928
Iterating global reduction 3 with 57 rules applied. Total rules applied 2145 place count 767 transition count 1928
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2202 place count 710 transition count 1814
Iterating global reduction 3 with 57 rules applied. Total rules applied 2259 place count 710 transition count 1814
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2315 place count 654 transition count 1702
Iterating global reduction 3 with 56 rules applied. Total rules applied 2371 place count 654 transition count 1702
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2377 place count 648 transition count 1690
Iterating global reduction 3 with 6 rules applied. Total rules applied 2383 place count 648 transition count 1690
Applied a total of 2383 rules in 1309 ms. Remains 648 /1628 variables (removed 980) and now considering 1690/5962 (removed 4272) transitions.
[2023-03-12 17:40:16] [INFO ] Flow matrix only has 1134 transitions (discarded 556 similar events)
// Phase 1: matrix 1134 rows 648 cols
[2023-03-12 17:40:16] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-12 17:40:17] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-12 17:40:17] [INFO ] Flow matrix only has 1134 transitions (discarded 556 similar events)
[2023-03-12 17:40:17] [INFO ] Invariant cache hit.
[2023-03-12 17:40:17] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-12 17:40:18] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2397 ms to find 0 implicit places.
[2023-03-12 17:40:18] [INFO ] Flow matrix only has 1134 transitions (discarded 556 similar events)
[2023-03-12 17:40:18] [INFO ] Invariant cache hit.
[2023-03-12 17:40:19] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 648/1628 places, 1690/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4319 ms. Remains : 648/1628 places, 1690/5962 transitions.
Support contains 14 out of 648 places after structural reductions.
[2023-03-12 17:40:19] [INFO ] Flatten gal took : 191 ms
[2023-03-12 17:40:20] [INFO ] Flatten gal took : 88 ms
[2023-03-12 17:40:20] [INFO ] Input system was already deterministic with 1690 transitions.
Incomplete random walk after 10051 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=36 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 197692 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{5=1, 6=1}
Probabilistic random walk after 197692 steps, saw 128560 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :2
Running SMT prover for 8 properties.
[2023-03-12 17:40:23] [INFO ] Flow matrix only has 1134 transitions (discarded 556 similar events)
[2023-03-12 17:40:23] [INFO ] Invariant cache hit.
[2023-03-12 17:40:24] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 17:40:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 17:40:24] [INFO ] After 784ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:6
[2023-03-12 17:40:24] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-12 17:40:25] [INFO ] After 125ms SMT Verify possible using 281 Read/Feed constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-12 17:40:25] [INFO ] After 1267ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-12 17:40:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 17:40:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 17:40:26] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-12 17:40:26] [INFO ] After 451ms SMT Verify possible using 281 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-12 17:40:26] [INFO ] After 976ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 516 ms.
[2023-03-12 17:40:27] [INFO ] After 2396ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 408 ms.
Support contains 11 out of 648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 648/648 places, 1690/1690 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 646 transition count 1684
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 646 transition count 1684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 640 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 640 transition count 1668
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 638 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 638 transition count 1662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 636 transition count 1658
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 636 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 635 transition count 1656
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 635 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 634 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 634 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 633 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 633 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 632 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 632 transition count 1650
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 632 transition count 1644
Applied a total of 40 rules in 494 ms. Remains 632 /648 variables (removed 16) and now considering 1644/1690 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 632/648 places, 1644/1690 transitions.
Incomplete random walk after 10027 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=271 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 17:40:28] [INFO ] Flow matrix only has 1103 transitions (discarded 541 similar events)
// Phase 1: matrix 1103 rows 632 cols
[2023-03-12 17:40:28] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 17:40:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 17:40:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:40:29] [INFO ] After 471ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-12 17:40:29] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-12 17:40:29] [INFO ] After 135ms SMT Verify possible using 275 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:40:29] [INFO ] After 851ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:40:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 17:40:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:40:30] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:40:30] [INFO ] After 277ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:40:30] [INFO ] Deduced a trap composed of 131 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-12 17:40:30] [INFO ] After 765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-12 17:40:31] [INFO ] After 1696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 252 ms.
Support contains 7 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 631 transition count 1642
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 631 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 630 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 630 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 629 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 629 transition count 1638
Applied a total of 6 rules in 138 ms. Remains 629 /632 variables (removed 3) and now considering 1638/1644 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 629/632 places, 1638/1644 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=271 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 239990 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239990 steps, saw 155786 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 17:40:34] [INFO ] Flow matrix only has 1097 transitions (discarded 541 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-12 17:40:34] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 17:40:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 17:40:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 17:40:35] [INFO ] After 476ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-12 17:40:35] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-12 17:40:35] [INFO ] After 111ms SMT Verify possible using 273 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:40:35] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:40:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 17:40:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 17:40:36] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:40:36] [INFO ] After 272ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:40:36] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-12 17:40:36] [INFO ] After 1467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 239 ms.
Support contains 7 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1638/1638 transitions.
Applied a total of 0 rules in 80 ms. Remains 629 /629 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 629/629 places, 1638/1638 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1638/1638 transitions.
Applied a total of 0 rules in 79 ms. Remains 629 /629 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
[2023-03-12 17:40:37] [INFO ] Flow matrix only has 1097 transitions (discarded 541 similar events)
[2023-03-12 17:40:37] [INFO ] Invariant cache hit.
[2023-03-12 17:40:37] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-12 17:40:37] [INFO ] Flow matrix only has 1097 transitions (discarded 541 similar events)
[2023-03-12 17:40:37] [INFO ] Invariant cache hit.
[2023-03-12 17:40:38] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-12 17:40:39] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
[2023-03-12 17:40:39] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-12 17:40:39] [INFO ] Flow matrix only has 1097 transitions (discarded 541 similar events)
[2023-03-12 17:40:39] [INFO ] Invariant cache hit.
[2023-03-12 17:40:40] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2906 ms. Remains : 629/629 places, 1638/1638 transitions.
Graph (trivial) has 960 edges and 629 vertex of which 192 / 629 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 413 transitions
Reduce isomorphic transitions removed 733 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 501 transition count 894
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 490 transition count 894
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 23 place count 490 transition count 820
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 171 place count 416 transition count 820
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 234 place count 353 transition count 757
Iterating global reduction 2 with 63 rules applied. Total rules applied 297 place count 353 transition count 757
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 423 place count 353 transition count 631
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 683 place count 223 transition count 501
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 746 place count 160 transition count 375
Iterating global reduction 3 with 63 rules applied. Total rules applied 809 place count 160 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 160 transition count 374
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 872 place count 98 transition count 250
Iterating global reduction 4 with 62 rules applied. Total rules applied 934 place count 98 transition count 250
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 996 place count 36 transition count 126
Iterating global reduction 4 with 62 rules applied. Total rules applied 1058 place count 36 transition count 126
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1120 place count 36 transition count 64
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 5 with 2 rules applied. Total rules applied 1122 place count 35 transition count 63
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 5 with 6 rules applied. Total rules applied 1128 place count 32 transition count 64
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1131 place count 32 transition count 61
Applied a total of 1131 rules in 60 ms. Remains 32 /629 variables (removed 597) and now considering 61/1638 (removed 1577) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 61 rows 32 cols
[2023-03-12 17:40:40] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 17:40:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:40:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:40:40] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-12 17:40:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:40:40] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:40:40] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:40:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:40:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:40:40] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:40:40] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:40:40] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 17:40:40] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA FunctionPointer-PT-c128-LTLFireability-04 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(F(p0))))'
Support contains 2 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1690/1690 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 642 transition count 1676
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 642 transition count 1676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 642 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 636 transition count 1660
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 636 transition count 1660
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 631 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 631 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 627 transition count 1636
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 627 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 621 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 619 transition count 1618
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 617 transition count 1614
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 615 transition count 1610
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 614 transition count 1608
Applied a total of 72 rules in 154 ms. Remains 614 /648 variables (removed 34) and now considering 1608/1690 (removed 82) transitions.
[2023-03-12 17:40:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-12 17:40:40] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 17:40:41] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-12 17:40:41] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 17:40:41] [INFO ] Invariant cache hit.
[2023-03-12 17:40:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 17:40:44] [INFO ] Implicit Places using invariants and state equation in 2982 ms returned []
Implicit Place search using SMT with State Equation took 3424 ms to find 0 implicit places.
[2023-03-12 17:40:44] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 17:40:44] [INFO ] Invariant cache hit.
[2023-03-12 17:40:44] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/648 places, 1608/1690 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4083 ms. Remains : 614/648 places, 1608/1690 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 12 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-00 finished in 4382 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(p0)))'
Support contains 2 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 1690/1690 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 642 transition count 1676
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 642 transition count 1676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 642 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 636 transition count 1660
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 636 transition count 1660
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 631 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 631 transition count 1646
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 627 transition count 1632
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 627 transition count 1632
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 623 transition count 1622
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 623 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 619 transition count 1614
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 619 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 616 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 616 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 613 transition count 1602
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 613 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 610 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 609 transition count 1594
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 609 transition count 1592
Applied a total of 84 rules in 499 ms. Remains 609 /648 variables (removed 39) and now considering 1592/1690 (removed 98) transitions.
[2023-03-12 17:40:45] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 609 cols
[2023-03-12 17:40:45] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 17:40:45] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-12 17:40:45] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2023-03-12 17:40:45] [INFO ] Invariant cache hit.
[2023-03-12 17:40:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 17:40:53] [INFO ] Implicit Places using invariants and state equation in 7719 ms returned []
Implicit Place search using SMT with State Equation took 8171 ms to find 0 implicit places.
[2023-03-12 17:40:53] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-12 17:40:53] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2023-03-12 17:40:53] [INFO ] Invariant cache hit.
[2023-03-12 17:40:54] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 609/648 places, 1592/1690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9257 ms. Remains : 609/648 places, 1592/1690 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s525 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-07 finished in 9414 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)&&G((p1||X(p1)))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1690/1690 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 642 transition count 1676
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 642 transition count 1676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 642 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 636 transition count 1660
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 636 transition count 1660
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 631 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 631 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 626 transition count 1630
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 626 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 622 transition count 1620
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 622 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 618 transition count 1612
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 618 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 615 transition count 1606
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 615 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 612 transition count 1600
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 612 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 609 transition count 1594
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 608 transition count 1592
Applied a total of 84 rules in 176 ms. Remains 608 /648 variables (removed 40) and now considering 1592/1690 (removed 98) transitions.
[2023-03-12 17:40:54] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2023-03-12 17:40:54] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 17:40:54] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-12 17:40:54] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2023-03-12 17:40:54] [INFO ] Invariant cache hit.
[2023-03-12 17:40:55] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-12 17:40:57] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 2782 ms to find 0 implicit places.
[2023-03-12 17:40:57] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2023-03-12 17:40:57] [INFO ] Invariant cache hit.
[2023-03-12 17:40:57] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/648 places, 1592/1690 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3452 ms. Remains : 608/648 places, 1592/1690 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(AND (GEQ s1 1) (GEQ s523 1)), p0:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-09 finished in 3643 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(F((X((G(p2)||p1))||p0))))'
Support contains 4 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1690/1690 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 642 transition count 1676
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 642 transition count 1676
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 642 transition count 1674
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 636 transition count 1662
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 636 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 631 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 631 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 627 transition count 1636
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 627 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 624 transition count 1630
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 624 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 621 transition count 1624
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 615 transition count 1612
Applied a total of 68 rules in 136 ms. Remains 615 /648 variables (removed 33) and now considering 1612/1690 (removed 78) transitions.
[2023-03-12 17:40:58] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-12 17:40:58] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 17:40:58] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-12 17:40:58] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 17:40:58] [INFO ] Invariant cache hit.
[2023-03-12 17:40:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 17:41:02] [INFO ] Implicit Places using invariants and state equation in 3953 ms returned []
Implicit Place search using SMT with State Equation took 4281 ms to find 0 implicit places.
[2023-03-12 17:41:02] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 17:41:02] [INFO ] Invariant cache hit.
[2023-03-12 17:41:02] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/648 places, 1612/1690 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4929 ms. Remains : 615/648 places, 1612/1690 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s537 1)), p1:(OR (LT s1 1) (LT s537 1)), p2:(AND (GEQ s3 1) (GEQ s489 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 964 ms.
Product exploration explored 100000 steps with 50000 reset in 841 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c128-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c128-LTLFireability-10 finished in 7049 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&&X(X(F(p1))))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1690/1690 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 643 transition count 1678
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 643 transition count 1678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 643 transition count 1676
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 638 transition count 1666
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 638 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 633 transition count 1654
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 633 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 629 transition count 1642
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 626 transition count 1634
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 626 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 623 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 617 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 616 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 616 transition count 1614
Applied a total of 66 rules in 160 ms. Remains 616 /648 variables (removed 32) and now considering 1614/1690 (removed 76) transitions.
[2023-03-12 17:41:05] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2023-03-12 17:41:05] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 17:41:05] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-12 17:41:05] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-12 17:41:05] [INFO ] Invariant cache hit.
[2023-03-12 17:41:05] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-12 17:41:07] [INFO ] Implicit Places using invariants and state equation in 2093 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
[2023-03-12 17:41:07] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2023-03-12 17:41:07] [INFO ] Invariant cache hit.
[2023-03-12 17:41:08] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 616/648 places, 1614/1690 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3098 ms. Remains : 616/648 places, 1614/1690 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s0 1) (GEQ s537 1)), p0:(OR (LT s0 1) (LT s523 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-14 finished in 3231 ms.
All properties solved by simple procedures.
Total runtime 53812 ms.
ITS solved all properties within timeout

BK_STOP 1678642869312

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-c128"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-c128, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856400764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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