About the Execution of LTSMin+red for FunctionPointer-PT-c128
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
13646.096 | 790418.00 | 1345306.00 | 1727.70 | FFFFF?FFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603100324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool 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 r496-tall-171640603100324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-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 1717195136143
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
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:38:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:38:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:38:57] [INFO ] Load time of PNML (sax parser for PT used): 368 ms
[2024-05-31 22:38:57] [INFO ] Transformed 2826 places.
[2024-05-31 22:38:57] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:38:57] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 528 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 36 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c128-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 311 place count 1317 transition count 3776
Iterating global reduction 1 with 294 rules applied. Total rules applied 605 place count 1317 transition count 3776
Ensure Unique test removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 1025 place count 1317 transition count 3356
Discarding 151 places :
Symmetric choice reduction at 2 with 151 rule applications. Total rules 1176 place count 1166 transition count 3054
Iterating global reduction 2 with 151 rules applied. Total rules applied 1327 place count 1166 transition count 3054
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 1419 place count 1166 transition count 2962
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1433 place count 1152 transition count 2934
Iterating global reduction 3 with 14 rules applied. Total rules applied 1447 place count 1152 transition count 2934
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1461 place count 1138 transition count 2906
Iterating global reduction 3 with 14 rules applied. Total rules applied 1475 place count 1138 transition count 2906
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1489 place count 1124 transition count 2878
Iterating global reduction 3 with 14 rules applied. Total rules applied 1503 place count 1124 transition count 2878
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1517 place count 1110 transition count 2850
Iterating global reduction 3 with 14 rules applied. Total rules applied 1531 place count 1110 transition count 2850
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1544 place count 1097 transition count 2824
Iterating global reduction 3 with 13 rules applied. Total rules applied 1557 place count 1097 transition count 2824
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1570 place count 1084 transition count 2798
Iterating global reduction 3 with 13 rules applied. Total rules applied 1583 place count 1084 transition count 2798
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1596 place count 1071 transition count 2772
Iterating global reduction 3 with 13 rules applied. Total rules applied 1609 place count 1071 transition count 2772
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1664 place count 1016 transition count 2564
Iterating global reduction 3 with 55 rules applied. Total rules applied 1719 place count 1016 transition count 2564
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1774 place count 961 transition count 2344
Iterating global reduction 3 with 55 rules applied. Total rules applied 1829 place count 961 transition count 2344
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1884 place count 906 transition count 2222
Iterating global reduction 3 with 55 rules applied. Total rules applied 1939 place count 906 transition count 2222
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1994 place count 851 transition count 2112
Iterating global reduction 3 with 55 rules applied. Total rules applied 2049 place count 851 transition count 2112
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2104 place count 796 transition count 2002
Iterating global reduction 3 with 55 rules applied. Total rules applied 2159 place count 796 transition count 2002
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2214 place count 741 transition count 1892
Iterating global reduction 3 with 55 rules applied. Total rules applied 2269 place count 741 transition count 1892
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2321 place count 689 transition count 1788
Iterating global reduction 3 with 52 rules applied. Total rules applied 2373 place count 689 transition count 1788
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2379 place count 683 transition count 1776
Iterating global reduction 3 with 6 rules applied. Total rules applied 2385 place count 683 transition count 1776
Applied a total of 2385 rules in 1179 ms. Remains 683 /1628 variables (removed 945) and now considering 1776/5962 (removed 4186) transitions.
[2024-05-31 22:38:59] [INFO ] Flow matrix only has 1191 transitions (discarded 585 similar events)
// Phase 1: matrix 1191 rows 683 cols
[2024-05-31 22:38:59] [INFO ] Computed 2 invariants in 37 ms
[2024-05-31 22:38:59] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-05-31 22:38:59] [INFO ] Flow matrix only has 1191 transitions (discarded 585 similar events)
[2024-05-31 22:38:59] [INFO ] Invariant cache hit.
[2024-05-31 22:39:00] [INFO ] State equation strengthened by 292 read => feed constraints.
[2024-05-31 22:39:01] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 2452 ms to find 0 implicit places.
Running 1774 sub problems to find dead transitions.
[2024-05-31 22:39:01] [INFO ] Flow matrix only has 1191 transitions (discarded 585 similar events)
[2024-05-31 22:39:01] [INFO ] Invariant cache hit.
[2024-05-31 22:39:01] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/683 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/683 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 683/1874 variables, and 2 constraints, problems are : Problem set: 0 solved, 1774 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/683 constraints, ReadFeed: 0/292 constraints, PredecessorRefiner: 1774/1774 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/683 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/683 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/683 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 3 (OVERLAPS) 1191/1874 variables, 683/685 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1874 variables, 292/977 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1874/1874 variables, and 2751 constraints, problems are : Problem set: 0 solved, 1774 unsolved in 31236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 683/683 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 1774/1774 constraints, Known Traps: 0/0 constraints]
After SMT, in 69530ms problems are : Problem set: 0 solved, 1774 unsolved
Search for dead transitions found 0 dead transitions in 69562ms
Starting structural reductions in LTL mode, iteration 1 : 683/1628 places, 1776/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73227 ms. Remains : 683/1628 places, 1776/5962 transitions.
Support contains 20 out of 683 places after structural reductions.
[2024-05-31 22:40:11] [INFO ] Flatten gal took : 130 ms
[2024-05-31 22:40:11] [INFO ] Flatten gal took : 87 ms
[2024-05-31 22:40:11] [INFO ] Input system was already deterministic with 1776 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40040 steps (8 resets) in 1625 ms. (24 steps per ms) remains 14/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (18 resets) in 95 ms. (416 steps per ms) remains 8/13 properties
[2024-05-31 22:40:12] [INFO ] Flow matrix only has 1191 transitions (discarded 585 similar events)
[2024-05-31 22:40:12] [INFO ] Invariant cache hit.
[2024-05-31 22:40:12] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 594/604 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1034/1638 variables, 517/527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1638 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1638 variables, 292/820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1638 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 62/1700 variables, 1/821 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1700 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 172/1872 variables, 154/975 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1872 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/1874 variables, 2/977 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1874 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1874 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1874/1874 variables, and 977 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 683/683 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 594/604 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1034/1638 variables, 517/527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1638 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1638 variables, 292/820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1638 variables, 8/828 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1638 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 62/1700 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1700 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 172/1872 variables, 154/983 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1872 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/1874 variables, 2/985 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1874 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/1874 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1874/1874 variables, and 985 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 683/683 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4989ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 55361 steps, including 68 resets, run visited all 8 properties in 1013 ms. (steps per millisecond=54 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 1027 ms.
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 666 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 659 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 652 transition count 1688
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 645 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 645 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 624 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 624 transition count 1628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 617 transition count 1614
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Applied a total of 140 rules in 194 ms. Remains 614 /683 variables (removed 69) and now considering 1608/1776 (removed 168) transitions.
[2024-05-31 22:40:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-31 22:40:19] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 22:40:19] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-31 22:40:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:40:19] [INFO ] Invariant cache hit.
[2024-05-31 22:40:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:40:21] [INFO ] Implicit Places using invariants and state equation in 1975 ms returned []
Implicit Place search using SMT with State Equation took 2326 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:40:21] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:40:21] [INFO ] Invariant cache hit.
[2024-05-31 22:40:21] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
SMT process timed out in 36968ms, After SMT, problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 36985ms
Starting structural reductions in LTL mode, iteration 1 : 614/683 places, 1608/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39513 ms. Remains : 614/683 places, 1608/1776 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-00 finished in 39832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 666 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 659 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 652 transition count 1688
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 645 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 645 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 624 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 624 transition count 1628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 617 transition count 1614
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 614 transition count 1604
Applied a total of 144 rules in 499 ms. Remains 614 /683 variables (removed 69) and now considering 1604/1776 (removed 172) transitions.
[2024-05-31 22:40:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-31 22:40:59] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 22:40:59] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-31 22:40:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:40:59] [INFO ] Invariant cache hit.
[2024-05-31 22:41:00] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:41:02] [INFO ] Implicit Places using invariants and state equation in 2910 ms returned []
Implicit Place search using SMT with State Equation took 3270 ms to find 0 implicit places.
[2024-05-31 22:41:02] [INFO ] Redundant transitions in 81 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-31 22:41:02] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:41:02] [INFO ] Invariant cache hit.
[2024-05-31 22:41:02] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
SMT process timed out in 36789ms, After SMT, problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 36803ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/683 places, 1604/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40666 ms. Remains : 614/683 places, 1604/1776 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-01
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 8 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-01 finished in 40739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 666 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 659 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 652 transition count 1688
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 645 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 645 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 624 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 624 transition count 1628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 617 transition count 1614
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Applied a total of 140 rules in 179 ms. Remains 614 /683 variables (removed 69) and now considering 1608/1776 (removed 168) transitions.
[2024-05-31 22:41:39] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-31 22:41:39] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 22:41:40] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-31 22:41:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:41:40] [INFO ] Invariant cache hit.
[2024-05-31 22:41:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:41:42] [INFO ] Implicit Places using invariants and state equation in 1904 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:41:42] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:41:42] [INFO ] Invariant cache hit.
[2024-05-31 22:41:42] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 616 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 66781ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 66795ms
Starting structural reductions in LTL mode, iteration 1 : 614/683 places, 1608/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69242 ms. Remains : 614/683 places, 1608/1776 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-02
Entered a terminal (fully accepting) state of product in 37562 steps with 259 reset in 224 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-02 finished in 69570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(!p1))))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 665 transition count 1738
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 665 transition count 1738
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 657 transition count 1708
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 657 transition count 1708
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 649 transition count 1678
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 649 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 641 transition count 1662
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 641 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 633 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 633 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 625 transition count 1626
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 625 transition count 1626
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 126 place count 617 transition count 1610
Iterating global reduction 1 with 8 rules applied. Total rules applied 134 place count 617 transition count 1610
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 609 transition count 1594
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 606 transition count 1588
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 158 place count 606 transition count 1586
Applied a total of 158 rules in 365 ms. Remains 606 /683 variables (removed 77) and now considering 1586/1776 (removed 190) transitions.
[2024-05-31 22:42:49] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
// Phase 1: matrix 1060 rows 606 cols
[2024-05-31 22:42:49] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 22:42:49] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-31 22:42:49] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:42:49] [INFO ] Invariant cache hit.
[2024-05-31 22:42:50] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-31 22:42:51] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
[2024-05-31 22:42:51] [INFO ] Redundant transitions in 21 ms returned []
Running 1584 sub problems to find dead transitions.
[2024-05-31 22:42:51] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:42:51] [INFO ] Invariant cache hit.
[2024-05-31 22:42:51] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 36906ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 36920ms
Starting structural reductions in SI_LTL mode, iteration 1 : 606/683 places, 1586/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39132 ms. Remains : 606/683 places, 1586/1776 transitions.
Stuttering acceptance computed with spot in 37 ms :[false]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-05
Product exploration explored 100000 steps with 760 reset in 526 ms.
Product exploration explored 100000 steps with 755 reset in 550 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) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[false]
RANDOM walk for 40089 steps (8 resets) in 163 ms. (244 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 206181 steps, run timeout after 3008 ms. (steps per millisecond=68 ) properties seen :0 out of 4
Probabilistic random walk after 206181 steps, saw 133842 distinct states, run finished after 3011 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-31 22:43:32] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:43:32] [INFO ] Invariant cache hit.
[2024-05-31 22:43:32] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 779/1165 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 67/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 415/1580 variables, 144/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 197/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1581 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 71/1652 variables, 67/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 779/1165 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 67/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 415/1580 variables, 144/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 197/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1580 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1581 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1581 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 71/1652 variables, 67/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1652 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/1660 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1660 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1666 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1666 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1666 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1666/1666 variables, and 876 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3251ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 147380 steps, including 231 resets, run visited all 4 properties in 1926 ms. (steps per millisecond=76 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 1930 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 234 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[false]
Stuttering acceptance computed with spot in 38 ms :[false]
Support contains 3 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 84 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2024-05-31 22:43:38] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:43:38] [INFO ] Invariant cache hit.
[2024-05-31 22:43:38] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-31 22:43:38] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:43:38] [INFO ] Invariant cache hit.
[2024-05-31 22:43:39] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-31 22:43:40] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2024-05-31 22:43:40] [INFO ] Redundant transitions in 97 ms returned []
Running 1584 sub problems to find dead transitions.
[2024-05-31 22:43:40] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:43:40] [INFO ] Invariant cache hit.
[2024-05-31 22:43:40] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 36990ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 37006ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38993 ms. Remains : 606/606 places, 1586/1586 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[false]
RANDOM walk for 40073 steps (8 resets) in 104 ms. (381 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 213878 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 4
Probabilistic random walk after 213878 steps, saw 138839 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-31 22:44:20] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:44:20] [INFO ] Invariant cache hit.
[2024-05-31 22:44:20] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 779/1165 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 67/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 415/1580 variables, 144/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 197/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1581 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 71/1652 variables, 67/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 779/1165 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 67/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 415/1580 variables, 144/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 197/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1580 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1581 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1581 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 71/1652 variables, 67/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1652 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/1660 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1660 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1666 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1666 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1666 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1666/1666 variables, and 876 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3258ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 68229 steps, including 96 resets, run visited all 4 properties in 902 ms. (steps per millisecond=75 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 904 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 216 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[false]
Stuttering acceptance computed with spot in 150 ms :[false]
Stuttering acceptance computed with spot in 61 ms :[false]
Product exploration explored 100000 steps with 780 reset in 471 ms.
Product exploration explored 100000 steps with 752 reset in 481 ms.
Support contains 3 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 75 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2024-05-31 22:44:26] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:44:26] [INFO ] Invariant cache hit.
[2024-05-31 22:44:26] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-31 22:44:26] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:44:26] [INFO ] Invariant cache hit.
[2024-05-31 22:44:27] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-31 22:44:28] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2024-05-31 22:44:28] [INFO ] Redundant transitions in 35 ms returned []
Running 1584 sub problems to find dead transitions.
[2024-05-31 22:44:28] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-31 22:44:28] [INFO ] Invariant cache hit.
[2024-05-31 22:44:28] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 36582ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 36595ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38494 ms. Remains : 606/606 places, 1586/1586 transitions.
Treatment of property FunctionPointer-PT-c128-LTLFireability-05 finished in 135744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 4 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1754
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 672 transition count 1752
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 664 transition count 1736
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 664 transition count 1736
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 656 transition count 1706
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 656 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 648 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 648 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 640 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 640 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 632 transition count 1642
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 632 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 624 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 624 transition count 1624
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 616 transition count 1608
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 616 transition count 1608
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 143 place count 609 transition count 1594
Iterating global reduction 1 with 7 rules applied. Total rules applied 150 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 606 transition count 1588
Applied a total of 156 rules in 182 ms. Remains 606 /683 variables (removed 77) and now considering 1588/1776 (removed 188) transitions.
[2024-05-31 22:45:05] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2024-05-31 22:45:05] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 22:45:05] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-31 22:45:05] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-31 22:45:05] [INFO ] Invariant cache hit.
[2024-05-31 22:45:05] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-31 22:45:07] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
Running 1586 sub problems to find dead transitions.
[2024-05-31 22:45:07] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-31 22:45:07] [INFO ] Invariant cache hit.
[2024-05-31 22:45:07] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1061/1667 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
SMT process timed out in 37019ms, After SMT, problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 37033ms
Starting structural reductions in LTL mode, iteration 1 : 606/683 places, 1588/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39144 ms. Remains : 606/683 places, 1588/1776 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-07
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-07 finished in 39344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 666 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 659 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 652 transition count 1688
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 645 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 645 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 624 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 624 transition count 1628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 617 transition count 1614
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 614 transition count 1604
Applied a total of 144 rules in 346 ms. Remains 614 /683 variables (removed 69) and now considering 1604/1776 (removed 172) transitions.
[2024-05-31 22:45:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-31 22:45:44] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 22:45:44] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-31 22:45:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:45:44] [INFO ] Invariant cache hit.
[2024-05-31 22:45:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:45:48] [INFO ] Implicit Places using invariants and state equation in 3571 ms returned []
Implicit Place search using SMT with State Equation took 3899 ms to find 0 implicit places.
[2024-05-31 22:45:48] [INFO ] Redundant transitions in 28 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-31 22:45:48] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:45:48] [INFO ] Invariant cache hit.
[2024-05-31 22:45:48] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
SMT process timed out in 36973ms, After SMT, problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 36988ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/683 places, 1604/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41275 ms. Remains : 614/683 places, 1604/1776 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-09
Entered a terminal (fully accepting) state of product in 413 steps with 3 reset in 3 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-09 finished in 41390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1||(G(p3)&&p2))))))'
Support contains 5 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 674 transition count 1758
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 674 transition count 1758
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 674 transition count 1756
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 666 transition count 1740
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 658 transition count 1710
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 658 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 650 transition count 1680
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 650 transition count 1680
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 76 place count 642 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 642 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 92 place count 634 transition count 1646
Iterating global reduction 1 with 8 rules applied. Total rules applied 100 place count 634 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 108 place count 626 transition count 1628
Iterating global reduction 1 with 8 rules applied. Total rules applied 116 place count 626 transition count 1628
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 124 place count 618 transition count 1612
Iterating global reduction 1 with 8 rules applied. Total rules applied 132 place count 618 transition count 1612
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 610 transition count 1596
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 607 transition count 1590
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 607 transition count 1588
Applied a total of 156 rules in 343 ms. Remains 607 /683 variables (removed 76) and now considering 1588/1776 (removed 188) transitions.
[2024-05-31 22:46:26] [INFO ] Flow matrix only has 1063 transitions (discarded 525 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-31 22:46:26] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 22:46:26] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-31 22:46:26] [INFO ] Flow matrix only has 1063 transitions (discarded 525 similar events)
[2024-05-31 22:46:26] [INFO ] Invariant cache hit.
[2024-05-31 22:46:26] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-31 22:46:27] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
[2024-05-31 22:46:28] [INFO ] Redundant transitions in 21 ms returned []
Running 1586 sub problems to find dead transitions.
[2024-05-31 22:46:28] [INFO ] Flow matrix only has 1063 transitions (discarded 525 similar events)
[2024-05-31 22:46:28] [INFO ] Invariant cache hit.
[2024-05-31 22:46:28] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1670 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
SMT process timed out in 36660ms, After SMT, problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 36674ms
Starting structural reductions in SI_LTL mode, iteration 1 : 607/683 places, 1588/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38992 ms. Remains : 607/683 places, 1588/1776 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-10
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-10 finished in 39208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||(G(p2)&&p1)))))'
Support contains 5 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 675 transition count 1760
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 675 transition count 1760
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 670 transition count 1750
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 670 transition count 1750
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 665 transition count 1730
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 665 transition count 1730
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 660 transition count 1710
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 660 transition count 1710
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 655 transition count 1700
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 655 transition count 1700
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 650 transition count 1690
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 650 transition count 1690
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 645 transition count 1680
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 645 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 640 transition count 1670
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 640 transition count 1670
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 635 transition count 1660
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 635 transition count 1660
Applied a total of 96 rules in 136 ms. Remains 635 /683 variables (removed 48) and now considering 1660/1776 (removed 116) transitions.
[2024-05-31 22:47:05] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
// Phase 1: matrix 1107 rows 635 cols
[2024-05-31 22:47:05] [INFO ] Computed 2 invariants in 23 ms
[2024-05-31 22:47:05] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-31 22:47:05] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
[2024-05-31 22:47:05] [INFO ] Invariant cache hit.
[2024-05-31 22:47:05] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-31 22:47:07] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 2261 ms to find 0 implicit places.
Running 1658 sub problems to find dead transitions.
[2024-05-31 22:47:07] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
[2024-05-31 22:47:07] [INFO ] Invariant cache hit.
[2024-05-31 22:47:07] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/635 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 635/1742 variables, and 2 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/635 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/635 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/635 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 3 (OVERLAPS) 1107/1742 variables, 635/637 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1742 variables, 271/908 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1742/1742 variables, and 2566 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30709 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 635/635 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
After SMT, in 67696ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 67711ms
Starting structural reductions in LTL mode, iteration 1 : 635/683 places, 1660/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70114 ms. Remains : 635/683 places, 1660/1776 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2269 steps with 12 reset in 17 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-13 finished in 70438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1754
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 672 transition count 1752
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 664 transition count 1736
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 664 transition count 1736
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 656 transition count 1706
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 656 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 648 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 648 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 640 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 640 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 632 transition count 1642
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 632 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 624 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 624 transition count 1624
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 616 transition count 1608
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 616 transition count 1608
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 144 place count 608 transition count 1592
Iterating global reduction 1 with 8 rules applied. Total rules applied 152 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 605 transition count 1586
Applied a total of 158 rules in 192 ms. Remains 605 /683 variables (removed 78) and now considering 1586/1776 (removed 190) transitions.
[2024-05-31 22:48:15] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-31 22:48:15] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 22:48:15] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-31 22:48:15] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-31 22:48:15] [INFO ] Invariant cache hit.
[2024-05-31 22:48:16] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:48:17] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-31 22:48:17] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-31 22:48:17] [INFO ] Invariant cache hit.
[2024-05-31 22:48:17] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 37503ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 37519ms
Starting structural reductions in LTL mode, iteration 1 : 605/683 places, 1586/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40116 ms. Remains : 605/683 places, 1586/1776 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-14
Stuttering criterion allowed to conclude after 195 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-14 finished in 40219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 674 transition count 1758
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 674 transition count 1758
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 674 transition count 1756
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 667 transition count 1742
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 667 transition count 1742
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 660 transition count 1716
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 660 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 653 transition count 1690
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 653 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 646 transition count 1676
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 646 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 639 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 639 transition count 1660
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 632 transition count 1644
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 632 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 111 place count 625 transition count 1630
Iterating global reduction 1 with 7 rules applied. Total rules applied 118 place count 625 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 618 transition count 1616
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 142 place count 615 transition count 1606
Applied a total of 142 rules in 353 ms. Remains 615 /683 variables (removed 68) and now considering 1606/1776 (removed 170) transitions.
[2024-05-31 22:48:55] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 615 cols
[2024-05-31 22:48:55] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 22:48:56] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-31 22:48:56] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-31 22:48:56] [INFO ] Invariant cache hit.
[2024-05-31 22:48:56] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 22:48:58] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2024-05-31 22:48:58] [INFO ] Redundant transitions in 28 ms returned []
Running 1604 sub problems to find dead transitions.
[2024-05-31 22:48:58] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-31 22:48:58] [INFO ] Invariant cache hit.
[2024-05-31 22:48:58] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1689 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1689 variables, 267/884 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1689/1689 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 68186ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 615/683 places, 1606/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70728 ms. Remains : 615/683 places, 1606/1776 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-15
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-15 finished in 70855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(!p1))))'
[2024-05-31 22:50:06] [INFO ] Flatten gal took : 69 ms
[2024-05-31 22:50:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 22:50:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 683 places, 1776 transitions and 7230 arcs took 14 ms.
Total runtime 669447 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-c128-LTLFireability-05
BK_STOP 1717195926561
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-c128-LTLFireability-05
ltl formula formula --ltl=/tmp/948/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 683 places, 1776 transitions and 7230 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.070 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/948/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/948/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/948/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/948/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 684 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 684, there are 1785 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~70464 transitions
pnml2lts-mc( 3/ 4): ~3328 levels ~20000 states ~139896 transitions
pnml2lts-mc( 3/ 4): ~6054 levels ~40000 states ~259208 transitions
pnml2lts-mc( 3/ 4): ~11510 levels ~80000 states ~498072 transitions
pnml2lts-mc( 3/ 4): ~22419 levels ~160000 states ~975640 transitions
pnml2lts-mc( 3/ 4): ~44237 levels ~320000 states ~1930752 transitions
pnml2lts-mc( 3/ 4): ~87873 levels ~640000 states ~3841056 transitions
pnml2lts-mc( 3/ 4): ~175145 levels ~1280000 states ~7661664 transitions
pnml2lts-mc( 3/ 4): ~349692 levels ~2560000 states ~15302960 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2338961
pnml2lts-mc( 0/ 4): unique transitions count: 20005334
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2782932
pnml2lts-mc( 0/ 4): - claim success count: 2339224
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1808326
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2339224 states 20006378 transitions, fanout: 8.553
pnml2lts-mc( 0/ 4): Total exploration time 117.640 sec (117.620 sec minimum, 117.630 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19885, Transitions per second: 170064
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 126.6MB, 16.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1806 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 126.6MB (~256.0MB paged-in)
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-5568"
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 r496-tall-171640603100324"
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 '
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 ;