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.r443-smll-171701109500007.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 greatspnxred
Input is UtahNoC-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701109500007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 10:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 205K 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 UtahNoC-PT-none-ReachabilityFireability-2024-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717052826124

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:07:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 07:07:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:07:08] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2024-05-30 07:07:08] [INFO ] Transformed 216 places.
[2024-05-30 07:07:08] [INFO ] Transformed 977 transitions.
[2024-05-30 07:07:08] [INFO ] Found NUPN structural information;
[2024-05-30 07:07:08] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
RANDOM walk for 40000 steps (8 resets) in 3736 ms. (10 steps per ms) remains 4/16 properties
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 916 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/4 properties
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-30 07:07:10] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2024-05-30 07:07:10] [INFO ] Computed 8 invariants in 35 ms
[2024-05-30 07:07:10] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem UtahNoC-PT-none-ReachabilityFireability-2024-05 is UNSAT
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 122/216 variables, 8/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 122/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 426/642 variables, 216/440 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 42/482 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/482 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/643 variables, 1/483 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/483 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/643 variables, 0/483 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 483 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1121 ms.
Refiners :[Domain max(s): 216/216 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 216/216 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 151/216 variables, 8/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 151/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 426/642 variables, 216/440 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 42/482 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 2/484 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 0/484 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/643 variables, 1/485 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/485 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/643 variables, 0/485 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 485 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1194 ms.
Refiners :[Domain max(s): 216/216 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 216/216 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2645ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 117 ms.
Support contains 65 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 194 edges and 216 vertex of which 40 / 216 are part of one of the 11 SCC in 4 ms
Free SCC test removed 29 places
Drop transitions (Empty/Sink Transition effects.) removed 172 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 190 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 187 transition count 637
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 185 transition count 636
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 184 transition count 636
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 27 place count 164 transition count 570
Iterating global reduction 3 with 20 rules applied. Total rules applied 47 place count 164 transition count 570
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 66 place count 164 transition count 551
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 69 place count 161 transition count 543
Iterating global reduction 4 with 3 rules applied. Total rules applied 72 place count 161 transition count 543
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 76 place count 161 transition count 539
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 160 transition count 538
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 80 place count 160 transition count 536
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 81 place count 159 transition count 534
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 159 transition count 534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 84 place count 158 transition count 547
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 95 place count 158 transition count 536
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 96 place count 157 transition count 535
Iterating global reduction 6 with 1 rules applied. Total rules applied 97 place count 157 transition count 535
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 103 place count 157 transition count 529
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 115 place count 151 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 116 place count 151 transition count 522
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 118 place count 151 transition count 522
Applied a total of 118 rules in 272 ms. Remains 151 /216 variables (removed 65) and now considering 522/829 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 151/216 places, 522/829 transitions.
RANDOM walk for 40000 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1095267 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1095267 steps, saw 657111 distinct states, run finished after 3008 ms. (steps per millisecond=364 ) properties seen :0
[2024-05-30 07:07:16] [INFO ] Flow matrix only has 291 transitions (discarded 231 similar events)
// Phase 1: matrix 291 rows 151 cols
[2024-05-30 07:07:16] [INFO ] Computed 8 invariants in 3 ms
[2024-05-30 07:07:16] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 291/442 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 43/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/442 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 291/442 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 43/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/442 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 65 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 522/522 transitions.
Applied a total of 0 rules in 16 ms. Remains 151 /151 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 151/151 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 522/522 transitions.
Applied a total of 0 rules in 15 ms. Remains 151 /151 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-30 07:07:17] [INFO ] Flow matrix only has 291 transitions (discarded 231 similar events)
[2024-05-30 07:07:17] [INFO ] Invariant cache hit.
[2024-05-30 07:07:17] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-30 07:07:17] [INFO ] Flow matrix only has 291 transitions (discarded 231 similar events)
[2024-05-30 07:07:17] [INFO ] Invariant cache hit.
[2024-05-30 07:07:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-30 07:07:18] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-30 07:07:18] [INFO ] Redundant transitions in 52 ms returned []
Running 521 sub problems to find dead transitions.
[2024-05-30 07:07:18] [INFO ] Flow matrix only has 291 transitions (discarded 231 similar events)
[2024-05-30 07:07:18] [INFO ] Invariant cache hit.
[2024-05-30 07:07:18] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 291/442 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 43/202 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/442 variables, and 202 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 291/442 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 43/202 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 521/723 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/442 variables, and 723 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints]
After SMT, in 60657ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60677ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61168 ms. Remains : 151/151 places, 522/522 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 50 edges and 151 vertex of which 12 / 151 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 144 transition count 277
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 8 rules applied. Total rules applied 10 place count 143 transition count 270
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 17 place count 136 transition count 270
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 136 transition count 268
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 134 transition count 268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 25 place count 130 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 130 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 29 place count 130 transition count 263
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 129 transition count 263
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 41 place count 124 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 56 place count 124 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 123 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 123 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 123 transition count 239
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 4 with 2 rules applied. Total rules applied 61 place count 122 transition count 238
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 122 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 120 transition count 236
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 70 place count 120 transition count 236
Applied a total of 70 rules in 117 ms. Remains 120 /151 variables (removed 31) and now considering 236/522 (removed 286) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 236 rows 120 cols
[2024-05-30 07:08:19] [INFO ] Computed 8 invariants in 4 ms
[2024-05-30 07:08:19] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 07:08:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-30 07:08:19] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 07:08:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-30 07:08:19] [INFO ] After 118ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 07:08:19] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 07:08:19] [INFO ] After 675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 985 ms.
[2024-05-30 07:08:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-30 07:08:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 522 transitions and 1787 arcs took 9 ms.
[2024-05-30 07:08:20] [INFO ] Flatten gal took : 125 ms
Total runtime 72104 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtahNoC-PT-none

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 151
TRANSITIONS: 522
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 583
MODEL NAME: /home/mcc/execution/412/model
151 places, 522 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtahNoC-PT-none-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717052936621

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="UtahNoC-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is UtahNoC-PT-none, 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 r443-smll-171701109500007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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