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-171640603000278.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-c002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717190488157

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:21:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:21:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:21:29] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2024-05-31 21:21:29] [INFO ] Transformed 2826 places.
[2024-05-31 21:21:29] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:21:29] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 515 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (8 resets) in 2933 ms. (13 steps per ms) remains 8/10 properties
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 6/8 properties
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 5/6 properties
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/5 properties
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-31 21:21:31] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:21:31] [INFO ] Computed 4 invariants in 96 ms
[2024-05-31 21:21:31] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem FunctionPointer-PT-c002-ReachabilityCardinality-2024-01 is UNSAT
FORMULA FunctionPointer-PT-c002-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 532/570 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/572 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/573 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1476/2049 variables, 573/577 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2049 variables, 405/982 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2049 variables, 0/982 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1426/3475 variables, 438/1420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3475 variables, 74/1494 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3475 variables, 0/1494 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 760/4235 variables, 396/1890 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4235 variables, 0/1890 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 600/4835 variables, 128/2018 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4835 variables, 0/2018 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 333/5168 variables, 93/2111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/563 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/565 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/566 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1449/2015 variables, 566/570 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2015 variables, 403/973 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2015 variables, 1/974 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 21:21:34] [INFO ] Deduced a trap composed of 135 places in 220 ms of which 26 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2015 variables, 1/975 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2015 variables, 0/975 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1411/3426 variables, 427/1402 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3426 variables, 76/1478 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3426 variables, 1/1479 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3426 variables, 0/1479 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 787/4213 variables, 401/1880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4213 variables, 0/1880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 549/4762 variables, 132/2012 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4762 variables, 0/2012 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 406/5168 variables, 102/2114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5168 variables, 0/2114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/5168 variables, 0/2114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5168/5168 variables, and 2114 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 4770ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 20 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1428 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.12 ms
Discarding 200 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 367 transitions
Reduce isomorphic transitions removed 367 transitions.
Iterating post reduction 0 with 367 rules applied. Total rules applied 368 place count 1428 transition count 5595
Discarding 295 places :
Symmetric choice reduction at 1 with 295 rule applications. Total rules 663 place count 1133 transition count 3331
Iterating global reduction 1 with 295 rules applied. Total rules applied 958 place count 1133 transition count 3331
Ensure Unique test removed 358 transitions
Reduce isomorphic transitions removed 358 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 1316 place count 1133 transition count 2973
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1469 place count 980 transition count 2667
Iterating global reduction 2 with 153 rules applied. Total rules applied 1622 place count 980 transition count 2667
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1686 place count 980 transition count 2603
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1700 place count 966 transition count 2575
Iterating global reduction 3 with 14 rules applied. Total rules applied 1714 place count 966 transition count 2575
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1727 place count 953 transition count 2549
Iterating global reduction 3 with 13 rules applied. Total rules applied 1740 place count 953 transition count 2549
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1753 place count 940 transition count 2523
Iterating global reduction 3 with 13 rules applied. Total rules applied 1766 place count 940 transition count 2523
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1779 place count 927 transition count 2497
Iterating global reduction 3 with 13 rules applied. Total rules applied 1792 place count 927 transition count 2497
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1805 place count 914 transition count 2471
Iterating global reduction 3 with 13 rules applied. Total rules applied 1818 place count 914 transition count 2471
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1829 place count 903 transition count 2449
Iterating global reduction 3 with 11 rules applied. Total rules applied 1840 place count 903 transition count 2449
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1850 place count 893 transition count 2429
Iterating global reduction 3 with 10 rules applied. Total rules applied 1860 place count 893 transition count 2429
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1902 place count 851 transition count 2271
Iterating global reduction 3 with 42 rules applied. Total rules applied 1944 place count 851 transition count 2271
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 1995 place count 800 transition count 2067
Iterating global reduction 3 with 51 rules applied. Total rules applied 2046 place count 800 transition count 2067
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 2096 place count 750 transition count 1937
Iterating global reduction 3 with 50 rules applied. Total rules applied 2146 place count 750 transition count 1937
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2195 place count 701 transition count 1839
Iterating global reduction 3 with 49 rules applied. Total rules applied 2244 place count 701 transition count 1839
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2292 place count 653 transition count 1743
Iterating global reduction 3 with 48 rules applied. Total rules applied 2340 place count 653 transition count 1743
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2388 place count 605 transition count 1647
Iterating global reduction 3 with 48 rules applied. Total rules applied 2436 place count 605 transition count 1647
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 2483 place count 558 transition count 1553
Iterating global reduction 3 with 47 rules applied. Total rules applied 2530 place count 558 transition count 1553
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2544 place count 544 transition count 1525
Iterating global reduction 3 with 14 rules applied. Total rules applied 2558 place count 544 transition count 1525
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 2584 place count 544 transition count 1499
Applied a total of 2584 rules in 1129 ms. Remains 544 /1628 variables (removed 1084) and now considering 1499/5962 (removed 4463) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1138 ms. Remains : 544/1628 places, 1499/5962 transitions.
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 298009 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 298009 steps, saw 182746 distinct states, run finished after 3005 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-31 21:21:40] [INFO ] Flow matrix only has 896 transitions (discarded 603 similar events)
// Phase 1: matrix 896 rows 544 cols
[2024-05-31 21:21:40] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 21:21:40] [INFO ] State equation strengthened by 130 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 382/402 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/433 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 756/1189 variables, 433/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 18/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1189 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 163/1352 variables, 58/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1352 variables, 111/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1352 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 87/1439 variables, 52/674 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1439 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1439 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/1440 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1440 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1440 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1440/1440 variables, and 676 constraints, problems are : Problem set: 0 solved, 2 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 544/544 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 382/402 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/433 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 756/1189 variables, 433/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 18/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1189 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 163/1352 variables, 58/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1352 variables, 111/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1352 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:21:41] [INFO ] Deduced a trap composed of 135 places in 178 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1352 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1352 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 87/1439 variables, 52/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1439 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1439 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1440 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1440 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1440 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1440/1440 variables, and 679 constraints, problems are : Problem set: 0 solved, 2 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 544/544 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1439ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1499/1499 transitions.
Applied a total of 0 rules in 67 ms. Remains 544 /544 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 544/544 places, 1499/1499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1499/1499 transitions.
Applied a total of 0 rules in 67 ms. Remains 544 /544 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2024-05-31 21:21:41] [INFO ] Flow matrix only has 896 transitions (discarded 603 similar events)
[2024-05-31 21:21:41] [INFO ] Invariant cache hit.
[2024-05-31 21:21:42] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-31 21:21:42] [INFO ] Flow matrix only has 896 transitions (discarded 603 similar events)
[2024-05-31 21:21:42] [INFO ] Invariant cache hit.
[2024-05-31 21:21:42] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-31 21:21:43] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
[2024-05-31 21:21:44] [INFO ] Redundant transitions in 76 ms returned []
Running 1497 sub problems to find dead transitions.
[2024-05-31 21:21:44] [INFO ] Flow matrix only has 896 transitions (discarded 603 similar events)
[2024-05-31 21:21:44] [INFO ] Invariant cache hit.
[2024-05-31 21:21:44] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1497 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1497 unsolved
At refinement iteration 3 (OVERLAPS) 896/1440 variables, 544/546 constraints. Problems are: Problem set: 0 solved, 1497 unsolved
SMT process timed out in 35633ms, After SMT, problems are : Problem set: 0 solved, 1497 unsolved
Search for dead transitions found 0 dead transitions in 35648ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37841 ms. Remains : 544/544 places, 1499/1499 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 603 transitions
Reduce isomorphic transitions removed 603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 619 rules applied. Total rules applied 619 place count 544 transition count 880
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 637 place count 528 transition count 878
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 639 place count 526 transition count 878
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 639 place count 526 transition count 768
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 859 place count 416 transition count 768
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 1137 place count 277 transition count 629
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1200 place count 214 transition count 503
Iterating global reduction 3 with 63 rules applied. Total rules applied 1263 place count 214 transition count 503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1264 place count 214 transition count 502
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1326 place count 152 transition count 378
Iterating global reduction 4 with 62 rules applied. Total rules applied 1388 place count 152 transition count 378
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1450 place count 90 transition count 254
Iterating global reduction 4 with 62 rules applied. Total rules applied 1512 place count 90 transition count 254
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1574 place count 90 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1576 place count 89 transition count 191
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1598 place count 78 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1600 place count 78 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 1620 place count 78 transition count 179
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1621 place count 77 transition count 178
Iterating global reduction 6 with 1 rules applied. Total rules applied 1622 place count 77 transition count 178
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1628 place count 77 transition count 172
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1629 place count 77 transition count 172
Applied a total of 1629 rules in 87 ms. Remains 77 /544 variables (removed 467) and now considering 172/1499 (removed 1327) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 172 rows 77 cols
[2024-05-31 21:22:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:22:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:22:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 21:22:19] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 21:22:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:22:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:22:19] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 21:22:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:22:19] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 21:22:19] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 21:22:19] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 284 ms.
[2024-05-31 21:22:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-31 21:22:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 544 places, 1499 transitions and 6124 arcs took 11 ms.
[2024-05-31 21:22:20] [INFO ] Flatten gal took : 118 ms
Total runtime 51040 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-c002-ReachabilityCardinality-2024-05
Could not compute solution for formula : FunctionPointer-PT-c002-ReachabilityCardinality-2023-07

BK_STOP 1717190540528

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name FunctionPointer-PT-c002-ReachabilityCardinality-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/547/inv_0_
rfs formula name FunctionPointer-PT-c002-ReachabilityCardinality-2023-07
rfs formula type EF
rfs formula formula --invariant=/tmp/547/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c002"
export BK_EXAMINATION="ReachabilityCardinality"
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-c002, examination is ReachabilityCardinality"
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-171640603000278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c002.tgz
mv FunctionPointer-PT-c002 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;