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.r180-tall-171640603100319.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 itstools
Input is FunctionPointer-PT-c064, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:11 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-c064-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716491823015

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-23 19:17:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 19:17:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:17:04] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2024-05-23 19:17:04] [INFO ] Transformed 2826 places.
[2024-05-23 19:17:04] [INFO ] Transformed 8960 transitions.
[2024-05-23 19:17:04] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40035 steps (8 resets) in 4131 ms. (9 steps per ms) remains 9/12 properties
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 9/9 properties
[2024-05-23 19:17:06] [INFO ] Flatten gal took : 905 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1308 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
[2024-05-23 19:17:06] [INFO ] Flatten gal took : 273 ms
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
[2024-05-23 19:17:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14851240972047392361.gal : 183 ms
[2024-05-23 19:17:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6134465492332343247.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14851240972047392361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6134465492332343247.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-23 19:17:07] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 19:17:07] [INFO ] Computed 4 invariants in 76 ms
[2024-05-23 19:17:07] [INFO ] State equation strengthened by 479 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality6134465492332343247.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FunctionPointer-PT-c064-ReachabilityFireability-2024-01 is UNSAT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c064-ReachabilityFireability-2024-07 is UNSAT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c064-ReachabilityFireability-2024-10 is UNSAT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c064-ReachabilityFireability-2024-15 is UNSAT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 524/587 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/588 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1570/2158 variables, 588/592 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2158 variables, 403/995 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2158 variables, 0/995 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1679/3837 variables, 484/1479 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3837 variables, 76/1555 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3837 variables, 0/1555 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 713/4550 variables, 398/1953 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4550 variables, 0/1953 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 437/4987 variables, 105/2058 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4987 variables, 0/2058 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 181/5168 variables, 53/2111 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 4 solved, 5 unsolved in 3165 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: 9/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 529/571 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/572 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1497/2069 variables, 572/576 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2069 variables, 399/975 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2069 variables, 0/975 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1635/3704 variables, 463/1438 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3704 variables, 80/1518 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3704 variables, 4/1522 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-23 19:17:13] [INFO ] Deduced a trap composed of 135 places in 307 ms of which 33 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3704 variables, 1/1523 constraints. Problems are: Problem set: 4 solved, 5 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 31
At refinement iteration 12 (INCLUDED_ONLY) 0/3704 variables, 0/1523 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 738/4442 variables, 412/1935 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4442/5168 variables, and 1935 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1447/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 8745ms problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 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 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.15 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 289 place count 1323 transition count 3832
Iterating global reduction 0 with 288 rules applied. Total rules applied 577 place count 1323 transition count 3832
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 448 transitions.
Iterating post reduction 0 with 448 rules applied. Total rules applied 1025 place count 1323 transition count 3384
Discarding 145 places :
Symmetric choice reduction at 1 with 145 rule applications. Total rules 1170 place count 1178 transition count 3094
Iterating global reduction 1 with 145 rules applied. Total rules applied 1315 place count 1178 transition count 3094
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 1419 place count 1178 transition count 2990
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1432 place count 1165 transition count 2964
Iterating global reduction 2 with 13 rules applied. Total rules applied 1445 place count 1165 transition count 2964
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1458 place count 1152 transition count 2938
Iterating global reduction 2 with 13 rules applied. Total rules applied 1471 place count 1152 transition count 2938
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1484 place count 1139 transition count 2912
Iterating global reduction 2 with 13 rules applied. Total rules applied 1497 place count 1139 transition count 2912
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1510 place count 1126 transition count 2886
Iterating global reduction 2 with 13 rules applied. Total rules applied 1523 place count 1126 transition count 2886
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1536 place count 1113 transition count 2860
Iterating global reduction 2 with 13 rules applied. Total rules applied 1549 place count 1113 transition count 2860
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1562 place count 1100 transition count 2834
Iterating global reduction 2 with 13 rules applied. Total rules applied 1575 place count 1100 transition count 2834
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1588 place count 1087 transition count 2808
Iterating global reduction 2 with 13 rules applied. Total rules applied 1601 place count 1087 transition count 2808
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1642 place count 1046 transition count 2658
Iterating global reduction 2 with 41 rules applied. Total rules applied 1683 place count 1046 transition count 2658
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1730 place count 999 transition count 2470
Iterating global reduction 2 with 47 rules applied. Total rules applied 1777 place count 999 transition count 2470
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1823 place count 953 transition count 2350
Iterating global reduction 2 with 46 rules applied. Total rules applied 1869 place count 953 transition count 2350
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1914 place count 908 transition count 2260
Iterating global reduction 2 with 45 rules applied. Total rules applied 1959 place count 908 transition count 2260
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 2003 place count 864 transition count 2172
Iterating global reduction 2 with 44 rules applied. Total rules applied 2047 place count 864 transition count 2172
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 2091 place count 820 transition count 2084
Iterating global reduction 2 with 44 rules applied. Total rules applied 2135 place count 820 transition count 2084
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 2178 place count 777 transition count 1998
Iterating global reduction 2 with 43 rules applied. Total rules applied 2221 place count 777 transition count 1998
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2234 place count 764 transition count 1972
Iterating global reduction 2 with 13 rules applied. Total rules applied 2247 place count 764 transition count 1972
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 2 with 34 rules applied. Total rules applied 2281 place count 764 transition count 1938
Applied a total of 2281 rules in 1966 ms. Remains 764 /1628 variables (removed 864) and now considering 1938/5962 (removed 4024) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1986 ms. Remains : 764/1628 places, 1938/5962 transitions.
RANDOM walk for 40034 steps (8 resets) in 336 ms. (118 steps per ms) remains 4/5 properties
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 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 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
[2024-05-23 19:17:18] [INFO ] Flow matrix only has 1315 transitions (discarded 623 similar events)
// Phase 1: matrix 1315 rows 764 cols
[2024-05-23 19:17:18] [INFO ] Computed 2 invariants in 25 ms
[2024-05-23 19:17:18] [INFO ] State equation strengthened by 324 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 373/415 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/452 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :31 after 2059
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1026/1478 variables, 452/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1478 variables, 257/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1478 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 500/1978 variables, 214/925 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1978 variables, 67/992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1978 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 101/2079 variables, 98/1090 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2079 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2079 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2079/2079 variables, and 1090 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 764/764 constraints, ReadFeed: 324/324 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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 373/415 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/452 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1026/1478 variables, 452/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1478 variables, 257/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1478 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 500/1978 variables, 214/925 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1978 variables, 67/992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1978 variables, 4/996 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 19:17:20] [INFO ] Deduced a trap composed of 131 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1978 variables, 1/997 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1978 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 101/2079 variables, 98/1095 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2079 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2079 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2079/2079 variables, and 1095 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 764/764 constraints, ReadFeed: 324/324 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4302ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 86752 steps, including 246 resets, run visited all 4 properties in 835 ms. (steps per millisecond=103 )
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
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 846 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 19111 ms.

BK_STOP 1716491843444

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c064"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c064, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603100319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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