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.r516-tajo-171654446700276.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 ltsminxred
Input is PolyORBLF-PT-S04J04T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 21K Apr 11 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 11 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 780K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.3M 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 PolyORBLF-PT-S04J04T08-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717253971497

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:59:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:59:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:59:33] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-06-01 14:59:33] [INFO ] Transformed 712 places.
[2024-06-01 14:59:33] [INFO ] Transformed 4012 transitions.
[2024-06-01 14:59:33] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 218 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 87 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 14:59:33] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-06-01 14:59:33] [INFO ] Computed 50 invariants in 150 ms
[2024-06-01 14:59:33] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 147 places in 319 ms of which 28 ms to minimize.
[2024-06-01 15:00:00] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 42 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20090 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 4 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 76 places in 327 ms of which 3 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:00:15] [INFO ] Deduced a trap composed of 146 places in 185 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 50 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 10/10 constraints]
After SMT, in 48535ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48588ms
[2024-06-01 15:00:22] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 15:00:22] [INFO ] Invariant cache hit.
[2024-06-01 15:00:22] [INFO ] Implicit Places using invariants in 661 ms returned [142, 228, 251, 352, 479, 545, 558, 687]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 680 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 700/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 30 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49436 ms. Remains : 700/712 places, 1844/1844 transitions.
Support contains 218 out of 700 places after structural reductions.
[2024-06-01 15:00:23] [INFO ] Flatten gal took : 213 ms
[2024-06-01 15:00:23] [INFO ] Flatten gal took : 121 ms
[2024-06-01 15:00:23] [INFO ] Input system was already deterministic with 1844 transitions.
RANDOM walk for 40000 steps (10 resets) in 1449 ms. (27 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
[2024-06-01 15:00:24] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 700 cols
[2024-06-01 15:00:24] [INFO ] Computed 42 invariants in 45 ms
[2024-06-01 15:00:24] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/119 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/131 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 70/201 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 681/2512 variables, and 27 constraints, problems are : Problem set: 1 solved, 0 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 15/25 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 700 transition count 1780
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 136 place count 636 transition count 1772
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 304 place count 548 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 311 place count 541 transition count 1685
Iterating global reduction 3 with 7 rules applied. Total rules applied 318 place count 541 transition count 1685
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 462 place count 469 transition count 1613
Applied a total of 462 rules in 198 ms. Remains 469 /700 variables (removed 231) and now considering 1613/1844 (removed 231) transitions.
Running 1609 sub problems to find dead transitions.
[2024-06-01 15:00:25] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
// Phase 1: matrix 1581 rows 469 cols
[2024-06-01 15:00:25] [INFO ] Computed 42 invariants in 25 ms
[2024-06-01 15:00:25] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-06-01 15:00:45] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:00:45] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 195 places in 281 ms of which 3 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 168 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 158 places in 313 ms of which 4 ms to minimize.
[2024-06-01 15:00:48] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:00:50] [INFO ] Deduced a trap composed of 40 places in 350 ms of which 4 ms to minimize.
[2024-06-01 15:00:51] [INFO ] Deduced a trap composed of 76 places in 348 ms of which 3 ms to minimize.
[2024-06-01 15:00:53] [INFO ] Deduced a trap composed of 272 places in 348 ms of which 3 ms to minimize.
[2024-06-01 15:00:54] [INFO ] Deduced a trap composed of 252 places in 378 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/2050 variables, and 55 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1609/1609 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-06-01 15:01:14] [INFO ] Deduced a trap composed of 206 places in 345 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/2050 variables, and 56 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1609 constraints, Known Traps: 18/18 constraints]
After SMT, in 49839ms problems are : Problem set: 0 solved, 1609 unsolved
Search for dead transitions found 0 dead transitions in 49861ms
[2024-06-01 15:01:15] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-06-01 15:01:15] [INFO ] Invariant cache hit.
[2024-06-01 15:01:15] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-06-01 15:01:15] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-06-01 15:01:15] [INFO ] Invariant cache hit.
[2024-06-01 15:01:17] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:01:38] [INFO ] Implicit Places using invariants and state equation in 22075 ms returned []
Implicit Place search using SMT with State Equation took 22753 ms to find 0 implicit places.
[2024-06-01 15:01:38] [INFO ] Redundant transitions in 109 ms returned []
Running 1609 sub problems to find dead transitions.
[2024-06-01 15:01:38] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-06-01 15:01:38] [INFO ] Invariant cache hit.
[2024-06-01 15:01:38] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-06-01 15:01:56] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:01:56] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:01:56] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:01:56] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 192 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:01:58] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
[2024-06-01 15:01:59] [INFO ] Deduced a trap composed of 158 places in 382 ms of which 4 ms to minimize.
[2024-06-01 15:02:01] [INFO ] Deduced a trap composed of 74 places in 326 ms of which 3 ms to minimize.
[2024-06-01 15:02:01] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 2 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 242 places in 318 ms of which 7 ms to minimize.
[2024-06-01 15:02:12] [INFO ] Deduced a trap composed of 213 places in 328 ms of which 3 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 203 places in 354 ms of which 3 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 123 places in 330 ms of which 3 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 199 places in 294 ms of which 3 ms to minimize.
[2024-06-01 15:02:14] [INFO ] Deduced a trap composed of 202 places in 309 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/2050 variables, and 58 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1609/1609 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/2050 variables, and 58 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1609 constraints, Known Traps: 20/20 constraints]
After SMT, in 68546ms problems are : Problem set: 0 solved, 1609 unsolved
Search for dead transitions found 0 dead transitions in 68567ms
Starting structural reductions in SI_LTL mode, iteration 1 : 469/700 places, 1613/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141509 ms. Remains : 469/700 places, 1613/1844 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLFireability-00
Stuttering criterion allowed to conclude after 6028 steps with 0 reset in 113 ms.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T08-LTLFireability-00 finished in 141851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 700 transition count 1788
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 644 transition count 1788
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 112 place count 644 transition count 1700
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 288 place count 556 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 296 place count 548 transition count 1692
Iterating global reduction 2 with 8 rules applied. Total rules applied 304 place count 548 transition count 1692
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 15 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 448 place count 476 transition count 1620
Applied a total of 448 rules in 198 ms. Remains 476 /700 variables (removed 224) and now considering 1620/1844 (removed 224) transitions.
Running 1616 sub problems to find dead transitions.
[2024-06-01 15:02:47] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
// Phase 1: matrix 1588 rows 476 cols
[2024-06-01 15:02:47] [INFO ] Computed 42 invariants in 48 ms
[2024-06-01 15:02:47] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 15:03:05] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:03:07] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:03:10] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2064 variables, and 36 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 2 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 2 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 8 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 1 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 15:03:32] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2064 variables, and 46 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 13/13 constraints]
After SMT, in 49395ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 49425ms
[2024-06-01 15:03:36] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-06-01 15:03:36] [INFO ] Invariant cache hit.
[2024-06-01 15:03:37] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-01 15:03:37] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-06-01 15:03:37] [INFO ] Invariant cache hit.
[2024-06-01 15:03:38] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:03:55] [INFO ] Implicit Places using invariants and state equation in 18705 ms returned []
Implicit Place search using SMT with State Equation took 19189 ms to find 0 implicit places.
[2024-06-01 15:03:56] [INFO ] Redundant transitions in 135 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-06-01 15:03:56] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-06-01 15:03:56] [INFO ] Invariant cache hit.
[2024-06-01 15:03:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 15:04:14] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2064 variables, and 34 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 5 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 0 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 5 (OVERLAPS) 4/476 variables, 9/53 constraints. Problems are: Problem set: 68 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/2064 variables, and 53 constraints, problems are : Problem set: 68 solved, 1548 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 11/11 constraints]
After SMT, in 69391ms problems are : Problem set: 68 solved, 1548 unsolved
Search for dead transitions found 68 dead transitions in 69425ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 476/700 places, 1552/1844 transitions.
Applied a total of 0 rules in 44 ms. Remains 476 /476 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2024-06-01 15:05:05] [INFO ] Redundant transitions in 38 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 138521 ms. Remains : 476/700 places, 1552/1844 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLFireability-01
Stuttering criterion allowed to conclude after 2198 steps with 0 reset in 18 ms.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T08-LTLFireability-01 finished in 138621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p1)) U !p2)||p0)))'
Support contains 25 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 65 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:05:05] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-06-01 15:05:05] [INFO ] Computed 42 invariants in 37 ms
[2024-06-01 15:05:05] [INFO ] State equation strengthened by 160 read => feed constraints.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLFireability-03
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLFireability-04
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLFireability-05
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLFireability-06
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLFireability-07
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLFireability-08
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLFireability-13
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717254782990

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-00
ltl formula formula --ltl=/tmp/849/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.080 real 0.170 user 0.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 732 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4030 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~855!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2695
pnml2lts-mc( 0/ 4): unique transitions count: 6772
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2699
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2699
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2699 states 6792 transitions, fanout: 2.516
pnml2lts-mc( 0/ 4): Total exploration time 0.390 sec (0.380 sec minimum, 0.387 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6921, Transitions per second: 17415
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 49.5 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-01
ltl formula formula --ltl=/tmp/849/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.000 real 0.200 user 0.210 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 732 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4030 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~224!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1196
pnml2lts-mc( 0/ 4): unique transitions count: 2969
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1204
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1204
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1204 states 3006 transitions, fanout: 2.497
pnml2lts-mc( 0/ 4): Total exploration time 0.200 sec (0.200 sec minimum, 0.200 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6020, Transitions per second: 15030
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 54.3 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-02
ltl formula formula --ltl=/tmp/849/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.990 real 0.190 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 732 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4119 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 4
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 20 transitions, fanout: 1.667
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1200, Transitions per second: 2000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 260.8 B/state, compr.: 9.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-03
ltl formula formula --ltl=/tmp/849/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.850 real 0.180 user 0.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-04
ltl formula formula --ltl=/tmp/849/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.950 real 0.180 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-05
ltl formula formula --ltl=/tmp/849/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.920 real 0.170 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_5_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-06
ltl formula formula --ltl=/tmp/849/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.910 real 0.180 user 0.270 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_6_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-07
ltl formula formula --ltl=/tmp/849/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.900 real 0.240 user 0.210 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_7_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_7_
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-08
ltl formula formula --ltl=/tmp/849/ltl_8_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.920 real 0.150 user 0.190 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 733 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4022 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2487 levels ~10000 states ~19732 transitions
pnml2lts-mc( 0/ 4): ~4899 levels ~20000 states ~37576 transitions
pnml2lts-mc( 0/ 4): ~8879 levels ~40000 states ~69176 transitions
pnml2lts-mc( 2/ 4): ~14975 levels ~80000 states ~133836 transitions
pnml2lts-mc( 2/ 4): ~22530 levels ~160000 states ~248684 transitions
pnml2lts-mc( 2/ 4): ~58648 levels ~320000 states ~550132 transitions
pnml2lts-mc( 0/ 4): ~135222 levels ~640000 states ~1118644 transitions
pnml2lts-mc( 0/ 4): ~259884 levels ~1280000 states ~2232672 transitions
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-09
ltl formula formula --ltl=/tmp/849/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.900 real 0.150 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 733 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4035 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~662!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 157
pnml2lts-mc( 0/ 4): unique states count: 1933
pnml2lts-mc( 0/ 4): unique transitions count: 4596
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 21
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1936
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1779
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1936 states 4612 transitions, fanout: 2.382
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.240 sec minimum, 0.255 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7446, Transitions per second: 17738
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 52.8 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-10
ltl formula formula --ltl=/tmp/849/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.830 real 0.180 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 732 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4029 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~744!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2726
pnml2lts-mc( 0/ 4): unique transitions count: 6388
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2729
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2729
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2729 states 6404 transitions, fanout: 2.347
pnml2lts-mc( 0/ 4): Total exploration time 0.380 sec (0.370 sec minimum, 0.377 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7182, Transitions per second: 16853
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 49.0 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-11
ltl formula formula --ltl=/tmp/849/ltl_11_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.660 real 0.180 user 0.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 733 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4015 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15
pnml2lts-mc( 0/ 4): unique states count: 15
pnml2lts-mc( 0/ 4): unique transitions count: 20
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 21
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21 states 44 transitions, fanout: 2.095
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.005 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2100, Transitions per second: 4400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 131.2 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-12
ltl formula formula --ltl=/tmp/849/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.730 real 0.200 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 733 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4018 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~744!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1970
pnml2lts-mc( 0/ 4): unique transitions count: 4817
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1974
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1974
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1974 states 4849 transitions, fanout: 2.456
pnml2lts-mc( 0/ 4): Total exploration time 0.280 sec (0.280 sec minimum, 0.280 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7050, Transitions per second: 17318
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 51.5 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-13
ltl formula formula --ltl=/tmp/849/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.890 real 0.190 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 732 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4018 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2467 levels ~10000 states ~23844 transitions
pnml2lts-mc( 0/ 4): ~4846 levels ~20000 states ~42252 transitions
pnml2lts-mc( 1/ 4): ~9567 levels ~40000 states ~89500 transitions
pnml2lts-mc( 1/ 4): ~18616 levels ~80000 states ~171064 transitions
pnml2lts-mc( 1/ 4): ~37458 levels ~160000 states ~348096 transitions
pnml2lts-mc( 1/ 4): ~71384 levels ~320000 states ~670152 transitions
pnml2lts-mc( 1/ 4): ~136810 levels ~640000 states ~1287300 transitions
pnml2lts-mc( 0/ 4): ~299993 levels ~1280000 states ~2788608 transitions
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-14
ltl formula formula --ltl=/tmp/849/ltl_14_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_14_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.170 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 733 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4015 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~486!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1361
pnml2lts-mc( 0/ 4): unique transitions count: 3135
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1365
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1365
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1365 states 3167 transitions, fanout: 2.320
pnml2lts-mc( 0/ 4): Total exploration time 0.210 sec (0.200 sec minimum, 0.205 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6500, Transitions per second: 15081
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 52.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLFireability-15
ltl formula formula --ltl=/tmp/849/ltl_15_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 712 places, 4012 transitions and 27744 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.760 real 0.210 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/849/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/849/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/849/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/849/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 733 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4019 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~713!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2642
pnml2lts-mc( 0/ 4): unique transitions count: 7904
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2646
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2646
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2646 states 7924 transitions, fanout: 2.995
pnml2lts-mc( 0/ 4): Total exploration time 0.370 sec (0.360 sec minimum, 0.365 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7151, Transitions per second: 21416
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 48.7 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)

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="PolyORBLF-PT-S04J04T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S04J04T08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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