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.r289-tajo-171654445800367.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 greatspnxred
Input is PolyORBNT-COL-S05J20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445800367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 8.0K Apr 12 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 09:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 09:45 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 4.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 09:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K 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-COL-S05J20-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716874916717

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:41:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:41:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:41:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 05:41:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 05:41:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 682 ms
[2024-05-28 05:41:59] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
[2024-05-28 05:41:59] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 05:41:59] [INFO ] Skeletonized 15 HLPN properties in 0 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (3189 resets) in 667 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1011 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
Probably explored full state space saw : 721 states, properties seen :0
Probabilistic random walk after 1974 steps, saw 721 distinct states, run finished after 22 ms. (steps per millisecond=89 ) properties seen :0
Explored full state space saw : 721 states, properties seen :0
Exhaustive walk after 1974 steps, saw 721 distinct states, run finished after 4 ms. (steps per millisecond=493 ) properties seen :0
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 05:41:59] [INFO ] Flatten gal took : 18 ms
[2024-05-28 05:41:59] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07 TRUE TECHNIQUES CPN_APPROX
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 05:41:59] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 52 ms.
[2024-05-28 05:41:59] [INFO ] Unfolded 15 HLPN properties in 0 ms.
[2024-05-28 05:41:59] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 05:41:59] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 05:41:59] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 05:41:59] [INFO ] Reduced 555 identical enabling conditions.
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2731 resets) in 2749 ms. (14 steps per ms) remains 4/14 properties
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (1001 resets) in 951 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (729 resets) in 631 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (627 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (694 resets) in 377 ms. (105 steps per ms) remains 4/4 properties
[2024-05-28 05:42:01] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2024-05-28 05:42:01] [INFO ] Computed 62 invariants in 35 ms
[2024-05-28 05:42:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-COL-S05J20-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/324 variables, 33/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem PolyORBNT-COL-S05J20-ReachabilityFireability-2024-05 is UNSAT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 2/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 21/345 variables, 21/58 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/349 variables, 4/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 551/900 variables, 349/411 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 1/412 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/900 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 412 constraints, problems are : Problem set: 2 solved, 2 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 349/349 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem PolyORBNT-COL-S05J20-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 238/321 variables, 34/34 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/342 variables, 21/55 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/349 variables, 7/62 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/900 variables, and 411 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 349/349 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2781ms problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 344 transition count 530
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 56 place count 319 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 57 place count 318 transition count 505
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 105 place count 294 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 293 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 293 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 111 place count 291 transition count 502
Applied a total of 111 rules in 186 ms. Remains 291 /349 variables (removed 58) and now considering 502/555 (removed 53) transitions.
Running 496 sub problems to find dead transitions.
[2024-05-28 05:42:04] [INFO ] Flow matrix only has 498 transitions (discarded 4 similar events)
// Phase 1: matrix 498 rows 291 cols
[2024-05-28 05:42:04] [INFO ] Computed 57 invariants in 12 ms
[2024-05-28 05:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/290 variables, 4/56 constraints. Problems are: Problem set: 78 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/56 constraints. Problems are: Problem set: 78 solved, 418 unsolved
Problem TDEAD264 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/291 variables, 1/57 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/57 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 498/789 variables, 291/348 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 1/349 constraints. Problems are: Problem set: 95 solved, 401 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 0/349 constraints. Problems are: Problem set: 95 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 789/789 variables, and 349 constraints, problems are : Problem set: 95 solved, 401 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 291/291 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 46/46 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 6/52 constraints. Problems are: Problem set: 95 solved, 401 unsolved
[2024-05-28 05:42:26] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 1/53 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/53 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 4 (OVERLAPS) 4/290 variables, 4/57 constraints. Problems are: Problem set: 95 solved, 401 unsolved
[2024-05-28 05:42:33] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 18 ms to minimize.
[2024-05-28 05:42:33] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 2/59 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/59 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 1/291 variables, 1/60 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/60 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 9 (OVERLAPS) 498/789 variables, 291/351 constraints. Problems are: Problem set: 95 solved, 401 unsolved
SMT process timed out in 41257ms, After SMT, problems are : Problem set: 95 solved, 401 unsolved
Search for dead transitions found 95 dead transitions in 41269ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 291/349 places, 407/555 transitions.
Applied a total of 0 rules in 61 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41554 ms. Remains : 291/349 places, 407/555 transitions.
RANDOM walk for 40000 steps (1899 resets) in 564 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (223 resets) in 375 ms. (106 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 792281 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 792281 steps, saw 244453 distinct states, run finished after 3018 ms. (steps per millisecond=262 ) properties seen :0
[2024-05-28 05:42:48] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2024-05-28 05:42:48] [INFO ] Computed 57 invariants in 8 ms
[2024-05-28 05:42:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 136/161 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 105/266 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/278 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/289 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/290 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 403/693 variables, 290/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/693 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/693 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/694 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/694 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/694 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 291/291 constraints, ReadFeed: 1/1 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 136/161 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/266 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/278 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/289 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/290 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 403/693 variables, 290/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/693 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/693 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 694/694 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9435 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 291/291 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10048ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 19 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 291/291 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 14 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2024-05-28 05:42:58] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2024-05-28 05:42:58] [INFO ] Invariant cache hit.
[2024-05-28 05:42:59] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-28 05:42:59] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2024-05-28 05:42:59] [INFO ] Invariant cache hit.
[2024-05-28 05:42:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 05:43:00] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2024-05-28 05:43:00] [INFO ] Redundant transitions in 26 ms returned []
Running 401 sub problems to find dead transitions.
[2024-05-28 05:43:00] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2024-05-28 05:43:00] [INFO ] Invariant cache hit.
[2024-05-28 05:43:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-28 05:43:03] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-28 05:43:03] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
[2024-05-28 05:43:03] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 2 ms to minimize.
[2024-05-28 05:43:04] [INFO ] Deduced a trap composed of 77 places in 595 ms of which 2 ms to minimize.
[2024-05-28 05:43:04] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 2 ms to minimize.
[2024-05-28 05:43:04] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 4 ms to minimize.
[2024-05-28 05:43:04] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 2 ms to minimize.
[2024-05-28 05:43:05] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 2 ms to minimize.
[2024-05-28 05:43:05] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 1 ms to minimize.
[2024-05-28 05:43:05] [INFO ] Deduced a trap composed of 77 places in 193 ms of which 6 ms to minimize.
[2024-05-28 05:43:05] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2024-05-28 05:43:05] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 3 ms to minimize.
[2024-05-28 05:43:05] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 3 ms to minimize.
[2024-05-28 05:43:06] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 2 ms to minimize.
[2024-05-28 05:43:06] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-28 05:43:06] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 1 ms to minimize.
[2024-05-28 05:43:06] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-28 05:43:06] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-05-28 05:43:06] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-28 05:43:06] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-28 05:43:07] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 2 ms to minimize.
[2024-05-28 05:43:07] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-05-28 05:43:07] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
[2024-05-28 05:43:07] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 4 ms to minimize.
[2024-05-28 05:43:07] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-05-28 05:43:08] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-28 05:43:08] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 3 ms to minimize.
[2024-05-28 05:43:08] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-05-28 05:43:08] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 3 ms to minimize.
[2024-05-28 05:43:08] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 2 ms to minimize.
[2024-05-28 05:43:08] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-05-28 05:43:08] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 4 ms to minimize.
[2024-05-28 05:43:09] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-28 05:43:09] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 2 ms to minimize.
[2024-05-28 05:43:09] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 2 ms to minimize.
[2024-05-28 05:43:09] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
[2024-05-28 05:43:09] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-05-28 05:43:09] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-05-28 05:43:10] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2024-05-28 05:43:10] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 4/290 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-28 05:43:14] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 5 ms to minimize.
[2024-05-28 05:43:15] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 2 ms to minimize.
[2024-05-28 05:43:15] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-05-28 05:43:15] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 2 ms to minimize.
[2024-05-28 05:43:15] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 2 ms to minimize.
[2024-05-28 05:43:15] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 3 ms to minimize.
[2024-05-28 05:43:16] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-28 05:43:16] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-28 05:43:19] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 4 ms to minimize.
[2024-05-28 05:43:19] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-28 05:43:19] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-28 05:43:19] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 2 ms to minimize.
[2024-05-28 05:43:19] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 2 ms to minimize.
[2024-05-28 05:43:20] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-28 05:43:20] [INFO ] Deduced a trap composed of 112 places in 202 ms of which 2 ms to minimize.
[2024-05-28 05:43:20] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 3 ms to minimize.
[2024-05-28 05:43:20] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 1 ms to minimize.
[2024-05-28 05:43:20] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-28 05:43:20] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 1 ms to minimize.
[2024-05-28 05:43:20] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 2 ms to minimize.
[2024-05-28 05:43:21] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-28 05:43:23] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 3 ms to minimize.
[2024-05-28 05:43:23] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
[2024-05-28 05:43:23] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-28 05:43:24] [INFO ] Deduced a trap composed of 89 places in 199 ms of which 4 ms to minimize.
[2024-05-28 05:43:24] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-28 05:43:26] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-28 05:43:26] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-28 05:43:26] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-28 05:43:27] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-28 05:43:27] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-28 05:43:29] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 2 ms to minimize.
[2024-05-28 05:43:29] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 2 ms to minimize.
[2024-05-28 05:43:29] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-05-28 05:43:29] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 3 ms to minimize.
[2024-05-28 05:43:30] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 2 ms to minimize.
[2024-05-28 05:43:30] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 2 ms to minimize.
[2024-05-28 05:43:30] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 2 ms to minimize.
[2024-05-28 05:43:30] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 2 ms to minimize.
[2024-05-28 05:43:30] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 2 ms to minimize.
[2024-05-28 05:43:30] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-05-28 05:43:31] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
SMT process timed out in 30795ms, After SMT, problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 30820ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32151 ms. Remains : 291/291 places, 407/407 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 291 transition count 403
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 291 transition count 402
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 290 transition count 402
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 290 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 289 transition count 401
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 289 transition count 396
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 284 transition count 396
Applied a total of 18 rules in 78 ms. Remains 284 /291 variables (removed 7) and now considering 396/407 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 284 cols
[2024-05-28 05:43:31] [INFO ] Computed 57 invariants in 8 ms
[2024-05-28 05:43:31] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-28 05:43:31] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 05:43:31] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 05:43:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2024-05-28 05:43:31] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 05:43:32] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 1084 ms.
All properties solved without resorting to model-checking.
Total runtime 94010 ms.
ITS solved all properties within timeout

BK_STOP 1716875012463

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

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