Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200487.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S10J20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M May 18 16:43 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 PolyORBNT-PT-S10J20-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716933086517

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 21:51:27] [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-28 21:51:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:51:28] [INFO ] Load time of PNML (sax parser for PT used): 595 ms
[2024-05-28 21:51:28] [INFO ] Transformed 474 places.
[2024-05-28 21:51:28] [INFO ] Transformed 11760 transitions.
[2024-05-28 21:51:28] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 850 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 153 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 21:51:28] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 21:51:28] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 21:51:28] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 21:51:28] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 21:51:28] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 21:51:28] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2239 resets) in 5252 ms. (7 steps per ms) remains 16/16 properties
[2024-05-28 21:51:30] [INFO ] Flatten gal took : 669 ms
BEST_FIRST walk for 4004 steps (40 resets) in 736 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
[2024-05-28 21:51:31] [INFO ] Flatten gal took : 199 ms
[2024-05-28 21:51:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6789980815224219591.gal : 151 ms
[2024-05-28 21:51:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15732546323288077972.prop : 48 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/ReachabilityCardinality6789980815224219591.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15732546323288077972.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
BEST_FIRST walk for 4003 steps (40 resets) in 2296 ms. (1 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (40 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (40 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (38 resets) in 144 ms. (27 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality15732546323288077972.prop.
BEST_FIRST walk for 4003 steps (40 resets) in 1134 ms. (3 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (40 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/16 properties
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 14/15 properties
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (40 resets) in 122 ms. (32 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 14/14 properties
[2024-05-28 21:51:32] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-28 21:51:32] [INFO ] Computed 72 invariants in 72 ms
[2024-05-28 21:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :5 after 25
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :25 after 110
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :110 after 427
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :427 after 870
Reachability property PolyORBNT-PT-S10J20-ReachabilityFireability-2024-02 is true.
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :870 after 1093
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :1093 after 1099
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :1099 after 1107
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1107 after 1121
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :1121 after 1207
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :1207 after 1424
Reachability property PolyORBNT-PT-S10J20-ReachabilityFireability-2024-07 is true.
Reachability property PolyORBNT-PT-S10J20-ReachabilityFireability-2024-04 is true.
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :1424 after 2359
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-09 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 24/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-08 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 19/43 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/43 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 41/468 variables, 21/64 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 3/67 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/67 constraints. Problems are: Problem set: 7 solved, 7 unsolved
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-01 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-05 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 6/474 variables, 5/72 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/72 constraints. Problems are: Problem set: 12 solved, 2 unsolved
Problem PolyORBNT-PT-S10J20-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1641/2115 variables, 474/546 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2115 variables, 1/547 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2115 variables, 0/547 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2115 variables, 0/547 constraints. Problems are: Problem set: 13 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2115/2115 variables, and 547 constraints, problems are : Problem set: 13 solved, 1 unsolved in 1650 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/182 variables, 21/21 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 190/372 variables, 19/40 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/40 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/378 variables, 2/42 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/42 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/398 variables, 2/44 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/44 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/472 variables, 27/71 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/71 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/473 variables, 1/72 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1641/2114 variables, 473/545 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2114 variables, 1/546 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2114 variables, 1/547 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2114 variables, 0/547 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/2115 variables, 1/548 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2115 variables, 0/548 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2115 variables, 0/548 constraints. Problems are: Problem set: 13 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2115/2115 variables, and 548 constraints, problems are : Problem set: 13 solved, 1 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 13541ms problems are : Problem set: 13 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 23 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1624
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 1599
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 413 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 1598
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 410 transition count 1596
Applied a total of 118 rules in 367 ms. Remains 410 /474 variables (removed 64) and now considering 1596/1650 (removed 54) transitions.
Running 1585 sub problems to find dead transitions.
[2024-05-28 21:51:46] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2024-05-28 21:51:46] [INFO ] Computed 62 invariants in 42 ms
[2024-05-28 21:51:46] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :2359 after 50890
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :50890 after 53831
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
Problem TDEAD392 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1364 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/401 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1997 variables, and 53 constraints, problems are : Problem set: 66 solved, 1519 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1585/585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 8/52 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
[2024-05-28 21:52:23] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 10 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :53831 after 55624
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1997 variables, and 53 constraints, problems are : Problem set: 66 solved, 1519 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/585 constraints, Known Traps: 1/1 constraints]
After SMT, in 55828ms problems are : Problem set: 66 solved, 1519 unsolved
Search for dead transitions found 66 dead transitions in 55853ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/474 places, 1530/1650 transitions.
Applied a total of 0 rules in 56 ms. Remains 410 /410 variables (removed 0) and now considering 1530/1530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56299 ms. Remains : 410/474 places, 1530/1650 transitions.
RANDOM walk for 1516 steps (109 resets) in 28 ms. (52 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 74417 ms.

BK_STOP 1716933162272

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="PolyORBNT-PT-S10J20"
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 PolyORBNT-PT-S10J20, 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 r290-tajo-171654447200487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 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 ;