About the Execution of LTSMin+red for FunctionPointer-PT-c004
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
14175.044 | 3589651.00 | 14301459.00 | 405.90 | TFT?FTT??TFTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856300726.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FunctionPointer-PT-c004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856300726
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678628424211
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:40:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 13:40:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:40:26] [INFO ] Load time of PNML (sax parser for PT used): 356 ms
[2023-03-12 13:40:26] [INFO ] Transformed 2826 places.
[2023-03-12 13:40:26] [INFO ] Transformed 8960 transitions.
[2023-03-12 13:40:26] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 641 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 49 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 10) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
[2023-03-12 13:40:27] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 13:40:27] [INFO ] Computed 4 place invariants in 87 ms
[2023-03-12 13:40:28] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-12 13:40:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:40:28] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:40:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:40:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-12 13:40:30] [INFO ] After 1334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:40:30] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 13:40:30] [INFO ] After 561ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-12 13:40:31] [INFO ] Deduced a trap composed of 131 places in 656 ms of which 9 ms to minimize.
[2023-03-12 13:40:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 844 ms
[2023-03-12 13:40:32] [INFO ] After 2140ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-03-12 13:40:32] [INFO ] After 4460ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 117 ms.
Support contains 7 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 1425 are kept as prefixes of interest. Removing 203 places using SCC suffix rule.13 ms
Discarding 203 places :
Also discarding 0 output transitions
Drop transitions removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 1425 transition count 5590
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 671 place count 1127 transition count 3318
Iterating global reduction 1 with 298 rules applied. Total rules applied 969 place count 1127 transition count 3318
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 1331 place count 1127 transition count 2956
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1486 place count 972 transition count 2646
Iterating global reduction 2 with 155 rules applied. Total rules applied 1641 place count 972 transition count 2646
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1705 place count 972 transition count 2582
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1719 place count 958 transition count 2554
Iterating global reduction 3 with 14 rules applied. Total rules applied 1733 place count 958 transition count 2554
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1747 place count 944 transition count 2526
Iterating global reduction 3 with 14 rules applied. Total rules applied 1761 place count 944 transition count 2526
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1775 place count 930 transition count 2498
Iterating global reduction 3 with 14 rules applied. Total rules applied 1789 place count 930 transition count 2498
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1803 place count 916 transition count 2470
Iterating global reduction 3 with 14 rules applied. Total rules applied 1817 place count 916 transition count 2470
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1831 place count 902 transition count 2442
Iterating global reduction 3 with 14 rules applied. Total rules applied 1845 place count 902 transition count 2442
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1858 place count 889 transition count 2416
Iterating global reduction 3 with 13 rules applied. Total rules applied 1871 place count 889 transition count 2416
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1882 place count 878 transition count 2394
Iterating global reduction 3 with 11 rules applied. Total rules applied 1893 place count 878 transition count 2394
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1945 place count 826 transition count 2196
Iterating global reduction 3 with 52 rules applied. Total rules applied 1997 place count 826 transition count 2196
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2054 place count 769 transition count 1968
Iterating global reduction 3 with 57 rules applied. Total rules applied 2111 place count 769 transition count 1968
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2168 place count 712 transition count 1834
Iterating global reduction 3 with 57 rules applied. Total rules applied 2225 place count 712 transition count 1834
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2282 place count 655 transition count 1720
Iterating global reduction 3 with 57 rules applied. Total rules applied 2339 place count 655 transition count 1720
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2396 place count 598 transition count 1606
Iterating global reduction 3 with 57 rules applied. Total rules applied 2453 place count 598 transition count 1606
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2510 place count 541 transition count 1492
Iterating global reduction 3 with 57 rules applied. Total rules applied 2567 place count 541 transition count 1492
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2624 place count 484 transition count 1378
Iterating global reduction 3 with 57 rules applied. Total rules applied 2681 place count 484 transition count 1378
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2691 place count 474 transition count 1358
Iterating global reduction 3 with 10 rules applied. Total rules applied 2701 place count 474 transition count 1358
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 2715 place count 474 transition count 1344
Applied a total of 2715 rules in 1158 ms. Remains 474 /1628 variables (removed 1154) and now considering 1344/5962 (removed 4618) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1159 ms. Remains : 474/1628 places, 1344/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:40:34] [INFO ] Flow matrix only has 777 transitions (discarded 567 similar events)
// Phase 1: matrix 777 rows 474 cols
[2023-03-12 13:40:34] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 13:40:34] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:34] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:40:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:34] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:40:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-12 13:40:34] [INFO ] After 101ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:40:35] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-12 13:40:35] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1344/1344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 473 transition count 1342
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 1342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 473 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 472 transition count 1338
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 472 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 471 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 471 transition count 1336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 469 transition count 1328
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 469 transition count 1328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 467 transition count 1324
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 467 transition count 1324
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 465 transition count 1320
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 465 transition count 1320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 463 transition count 1316
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 463 transition count 1316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 461 transition count 1312
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 461 transition count 1312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 459 transition count 1308
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 459 transition count 1308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 457 transition count 1304
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 457 transition count 1304
Applied a total of 36 rules in 155 ms. Remains 457 /474 variables (removed 17) and now considering 1304/1344 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 457/474 places, 1304/1344 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 244880 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244880 steps, saw 150172 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:40:38] [INFO ] Flow matrix only has 749 transitions (discarded 555 similar events)
// Phase 1: matrix 749 rows 457 cols
[2023-03-12 13:40:38] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-12 13:40:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:38] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:40:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:40:38] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:40:38] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-12 13:40:39] [INFO ] After 93ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:40:39] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-12 13:40:39] [INFO ] After 642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1304/1304 transitions.
Applied a total of 0 rules in 52 ms. Remains 457 /457 variables (removed 0) and now considering 1304/1304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 457/457 places, 1304/1304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1304/1304 transitions.
Applied a total of 0 rules in 49 ms. Remains 457 /457 variables (removed 0) and now considering 1304/1304 (removed 0) transitions.
[2023-03-12 13:40:39] [INFO ] Flow matrix only has 749 transitions (discarded 555 similar events)
[2023-03-12 13:40:39] [INFO ] Invariant cache hit.
[2023-03-12 13:40:39] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 13:40:39] [INFO ] Flow matrix only has 749 transitions (discarded 555 similar events)
[2023-03-12 13:40:39] [INFO ] Invariant cache hit.
[2023-03-12 13:40:39] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-12 13:40:40] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
[2023-03-12 13:40:40] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-12 13:40:40] [INFO ] Flow matrix only has 749 transitions (discarded 555 similar events)
[2023-03-12 13:40:40] [INFO ] Invariant cache hit.
[2023-03-12 13:40:41] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1769 ms. Remains : 457/457 places, 1304/1304 transitions.
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 555 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 563 rules applied. Total rules applied 563 place count 457 transition count 741
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 573 place count 449 transition count 739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 575 place count 447 transition count 739
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 575 place count 447 transition count 656
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 741 place count 364 transition count 656
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 1003 place count 233 transition count 525
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1066 place count 170 transition count 399
Iterating global reduction 3 with 63 rules applied. Total rules applied 1129 place count 170 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1130 place count 170 transition count 398
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1192 place count 108 transition count 274
Iterating global reduction 4 with 62 rules applied. Total rules applied 1254 place count 108 transition count 274
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1316 place count 46 transition count 150
Iterating global reduction 4 with 62 rules applied. Total rules applied 1378 place count 46 transition count 150
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1440 place count 46 transition count 88
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 1442 place count 45 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1454 place count 39 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1456 place count 39 transition count 91
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1464 place count 39 transition count 83
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1465 place count 38 transition count 82
Iterating global reduction 6 with 1 rules applied. Total rules applied 1466 place count 38 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1470 place count 38 transition count 78
Applied a total of 1470 rules in 75 ms. Remains 38 /457 variables (removed 419) and now considering 78/1304 (removed 1226) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 78 rows 38 cols
[2023-03-12 13:40:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 13:40:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:40:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:41] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:40:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:40:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:40:41] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:40:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:40:41] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:40:41] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 13:40:41] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:40:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-12 13:40:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 457 places, 1304 transitions and 5342 arcs took 8 ms.
[2023-03-12 13:40:41] [INFO ] Flatten gal took : 123 ms
Total runtime 15879 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/506/inv_0_ --invariant=/tmp/506/inv_1_ --invariant=/tmp/506/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 1964812 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093552 kB
Could not compute solution for formula : FunctionPointer-PT-c004-ReachabilityCardinality-03
Could not compute solution for formula : FunctionPointer-PT-c004-ReachabilityCardinality-07
Could not compute solution for formula : FunctionPointer-PT-c004-ReachabilityCardinality-08
BK_STOP 1678632013862
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name FunctionPointer-PT-c004-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_0_
rfs formula name FunctionPointer-PT-c004-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_1_
rfs formula name FunctionPointer-PT-c004-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 457 places, 1304 transitions and 5342 arcs
pnml2lts-sym: Petri net FuncPointer_3 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1304->1109 groups
pnml2lts-sym: Regrouping took 1.090 real 1.090 user 0.000 sys
pnml2lts-sym: state vector length is 457; there are 1109 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 512
Killing (9) : 512
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-c004"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c004, 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 r169-tall-167838856300726"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 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 '
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 ;