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-171654446700275.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700275
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717253855050

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
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:57:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:57:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:57:36] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-06-01 14:57:36] [INFO ] Transformed 712 places.
[2024-06-01 14:57:36] [INFO ] Transformed 4012 transitions.
[2024-06-01 14:57:36] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 171 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
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 701 transition count 1837
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 701 transition count 1837
Applied a total of 18 rules in 142 ms. Remains 701 /712 variables (removed 11) and now considering 1837/1844 (removed 7) transitions.
Running 1833 sub problems to find dead transitions.
[2024-06-01 14:57:37] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 701 cols
[2024-06-01 14:57:37] [INFO ] Computed 50 invariants in 106 ms
[2024-06-01 14:57:37] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 24 ms to minimize.
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 75 places in 639 ms of which 15 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 343 places in 1546 ms of which 10 ms to minimize.
SMT process timed out in 30619ms, After SMT, problems are : Problem set: 0 solved, 1833 unsolved
Search for dead transitions found 0 dead transitions in 30704ms
[2024-06-01 14:58:08] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
[2024-06-01 14:58:08] [INFO ] Invariant cache hit.
[2024-06-01 14:58:08] [INFO ] Implicit Places using invariants in 790 ms returned [142, 229, 252, 352, 475, 540, 553, 680]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 808 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 693/712 places, 1837/1844 transitions.
Applied a total of 0 rules in 25 ms. Remains 693 /693 variables (removed 0) and now considering 1837/1837 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31731 ms. Remains : 693/712 places, 1837/1844 transitions.
Support contains 171 out of 693 places after structural reductions.
[2024-06-01 14:58:09] [INFO ] Flatten gal took : 241 ms
[2024-06-01 14:58:09] [INFO ] Flatten gal took : 164 ms
[2024-06-01 14:58:09] [INFO ] Input system was already deterministic with 1837 transitions.
Support contains 124 out of 693 places (down from 171) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 1505 ms. (26 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40002 steps (8 resets) in 492 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
[2024-06-01 14:58:11] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 693 cols
[2024-06-01 14:58:11] [INFO ] Computed 42 invariants in 105 ms
[2024-06-01 14:58:11] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/68 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/76 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 116/192 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 7 (OVERLAPS) 473/665 variables, 17/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 9 (OVERLAPS) 14/679 variables, 7/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 0/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 693/2498 variables, and 42 constraints, problems are : Problem set: 6 solved, 0 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/693 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 854ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X(X(F(p0)))))'
Support contains 2 out of 693 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 1837/1837 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 685 transition count 1829
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 685 transition count 1829
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 684 transition count 1828
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 684 transition count 1828
Applied a total of 18 rules in 53 ms. Remains 684 /693 variables (removed 9) and now considering 1828/1837 (removed 9) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 14:58:12] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-06-01 14:58:12] [INFO ] Computed 42 invariants in 29 ms
[2024-06-01 14:58:12] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:58:35] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:58:35] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 0 ms to minimize.
[2024-06-01 14:58:35] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:58:35] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:58:36] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:58:36] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:58:36] [INFO ] Deduced a trap composed of 74 places in 381 ms of which 0 ms to minimize.
[2024-06-01 14:58:36] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:58:37] [INFO ] Deduced a trap composed of 54 places in 339 ms of which 4 ms to minimize.
[2024-06-01 14:58:37] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:58:38] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 3 ms to minimize.
[2024-06-01 14:58:38] [INFO ] Deduced a trap composed of 342 places in 496 ms of which 5 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 81 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 194 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:58:41] [INFO ] Deduced a trap composed of 378 places in 384 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 53 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:58:58] [INFO ] Deduced a trap composed of 373 places in 527 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 54 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 16/16 constraints]
After SMT, in 48769ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48790ms
[2024-06-01 14:59:01] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:59:01] [INFO ] Invariant cache hit.
[2024-06-01 14:59:02] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-06-01 14:59:02] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:59:02] [INFO ] Invariant cache hit.
[2024-06-01 14:59:02] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:59:33] [INFO ] Performed 643/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 14:59:34] [INFO ] Implicit Places using invariants and state equation in 32294 ms returned []
Implicit Place search using SMT with State Equation took 33367 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-06-01 14:59:34] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:59:34] [INFO ] Invariant cache hit.
[2024-06-01 14:59:34] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 2 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 2 ms to minimize.
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 341 places in 331 ms of which 4 ms to minimize.
[2024-06-01 15:00:00] [INFO ] Deduced a trap composed of 407 places in 346 ms of which 4 ms to minimize.
[2024-06-01 15:00:01] [INFO ] Deduced a trap composed of 347 places in 315 ms of which 3 ms to minimize.
[2024-06-01 15:00:02] [INFO ] Deduced a trap composed of 186 places in 327 ms of which 4 ms to minimize.
[2024-06-01 15:00:02] [INFO ] Deduced a trap composed of 212 places in 357 ms of which 19 ms to minimize.
[2024-06-01 15:00:02] [INFO ] Deduced a trap composed of 201 places in 346 ms of which 3 ms to minimize.
[2024-06-01 15:00:03] [INFO ] Deduced a trap composed of 201 places in 349 ms of which 4 ms to minimize.
[2024-06-01 15:00:04] [INFO ] Deduced a trap composed of 381 places in 339 ms of which 3 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 81 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 342 places in 315 ms of which 4 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 398 places in 319 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:00:10] [INFO ] Deduced a trap composed of 54 places in 355 ms of which 3 ms to minimize.
[2024-06-01 15:00:10] [INFO ] Deduced a trap composed of 365 places in 321 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 60 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 461 places in 414 ms of which 5 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 410 places in 363 ms of which 4 ms to minimize.
[2024-06-01 15:00:32] [INFO ] Deduced a trap composed of 385 places in 299 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 63 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 25/25 constraints]
After SMT, in 68468ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68486ms
Starting structural reductions in LTL mode, iteration 1 : 684/693 places, 1828/1837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150706 ms. Remains : 684/693 places, 1828/1837 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 1242 ms.
Product exploration explored 100000 steps with 25000 reset in 1019 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 407 steps (0 resets) in 7 ms. (50 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 13 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:00:46] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 15:00:46] [INFO ] Invariant cache hit.
[2024-06-01 15:00:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 0 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:01:11] [INFO ] Deduced a trap composed of 341 places in 304 ms of which 7 ms to minimize.
[2024-06-01 15:01:12] [INFO ] Deduced a trap composed of 407 places in 316 ms of which 3 ms to minimize.
[2024-06-01 15:01:13] [INFO ] Deduced a trap composed of 347 places in 423 ms of which 5 ms to minimize.
[2024-06-01 15:01:14] [INFO ] Deduced a trap composed of 186 places in 390 ms of which 3 ms to minimize.
SMT process timed out in 28616ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 28648ms
[2024-06-01 15:01:14] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 15:01:14] [INFO ] Invariant cache hit.
[2024-06-01 15:01:15] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-06-01 15:01:15] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 15:01:15] [INFO ] Invariant cache hit.
[2024-06-01 15:01:16] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:01:46] [INFO ] Performed 607/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:01:49] [INFO ] Implicit Places using invariants and state equation in 33668 ms returned []
Implicit Place search using SMT with State Equation took 34237 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:01:49] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 15:01:49] [INFO ] Invariant cache hit.
[2024-06-01 15:01:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:02:12] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:02:12] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 3 ms to minimize.
[2024-06-01 15:02:13] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:02:15] [INFO ] Deduced a trap composed of 341 places in 491 ms of which 4 ms to minimize.
[2024-06-01 15:02:15] [INFO ] Deduced a trap composed of 407 places in 406 ms of which 3 ms to minimize.
[2024-06-01 15:02:16] [INFO ] Deduced a trap composed of 347 places in 303 ms of which 3 ms to minimize.
[2024-06-01 15:02:17] [INFO ] Deduced a trap composed of 186 places in 415 ms of which 4 ms to minimize.
[2024-06-01 15:02:17] [INFO ] Deduced a trap composed of 212 places in 360 ms of which 4 ms to minimize.
[2024-06-01 15:02:18] [INFO ] Deduced a trap composed of 201 places in 360 ms of which 3 ms to minimize.
[2024-06-01 15:02:18] [INFO ] Deduced a trap composed of 201 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:02:20] [INFO ] Deduced a trap composed of 381 places in 536 ms of which 4 ms to minimize.
[2024-06-01 15:02:20] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 2 ms to minimize.
[2024-06-01 15:02:21] [INFO ] Deduced a trap composed of 342 places in 463 ms of which 5 ms to minimize.
[2024-06-01 15:02:23] [INFO ] Deduced a trap composed of 398 places in 461 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:02:27] [INFO ] Deduced a trap composed of 54 places in 452 ms of which 5 ms to minimize.
[2024-06-01 15:02:28] [INFO ] Deduced a trap composed of 365 places in 410 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 60 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:02:47] [INFO ] Deduced a trap composed of 461 places in 402 ms of which 5 ms to minimize.
[2024-06-01 15:02:47] [INFO ] Deduced a trap composed of 410 places in 395 ms of which 4 ms to minimize.
[2024-06-01 15:02:49] [INFO ] Deduced a trap composed of 385 places in 321 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 63 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 25/25 constraints]
After SMT, in 69351ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 69378ms
Finished structural reductions in LTL mode , in 1 iterations and 132289 ms. Remains : 684/684 places, 1828/1828 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 281 steps (0 resets) in 6 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 971 ms.
Product exploration explored 100000 steps with 25000 reset in 903 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 684 transition count 1828
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 48 place count 684 transition count 1892
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 684 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 112 place count 668 transition count 1876
Deduced a syphon composed of 80 places in 3 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 128 place count 668 transition count 1876
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 2 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 248 place count 668 transition count 1876
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 279 place count 637 transition count 1845
Deduced a syphon composed of 176 places in 5 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 310 place count 637 transition count 1845
Deduced a syphon composed of 176 places in 2 ms
Applied a total of 310 rules in 407 ms. Remains 637 /684 variables (removed 47) and now considering 1845/1828 (removed -17) transitions.
Running 1841 sub problems to find dead transitions.
[2024-06-01 15:03:01] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
// Phase 1: matrix 1813 rows 637 cols
[2024-06-01 15:03:02] [INFO ] Computed 42 invariants in 57 ms
[2024-06-01 15:03:02] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 15:03:27] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 15:03:28] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD266 is UNSAT
[2024-06-01 15:03:29] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD291 is UNSAT
[2024-06-01 15:03:29] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
Problem TDEAD300 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD551 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/2450 variables, and 39 constraints, problems are : Problem set: 20 solved, 1821 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/637 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1841/1841 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1821 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 10/10 constraints. Problems are: Problem set: 20 solved, 1821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 9/19 constraints. Problems are: Problem set: 20 solved, 1821 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 6/25 constraints. Problems are: Problem set: 20 solved, 1821 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 0/25 constraints. Problems are: Problem set: 20 solved, 1821 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
At refinement iteration 4 (OVERLAPS) 12/625 variables, 5/30 constraints. Problems are: Problem set: 266 solved, 1575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/625 variables, 5/35 constraints. Problems are: Problem set: 266 solved, 1575 unsolved
[2024-06-01 15:03:50] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-01 15:03:51] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD190 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/2450 variables, and 37 constraints, problems are : Problem set: 278 solved, 1563 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 14/27 constraints, State Equation: 0/637 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/1841 constraints, Known Traps: 8/8 constraints]
After SMT, in 50342ms problems are : Problem set: 278 solved, 1563 unsolved
Search for dead transitions found 278 dead transitions in 50368ms
Found 278 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 278 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 278 transitions.
[2024-06-01 15:03:52] [INFO ] Redundant transitions in 69 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 637/684 places, 1567/1828 transitions.
Graph (complete) has 3785 edges and 637 vertex of which 598 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.4 ms
Discarding 39 places :
Also discarding 0 output transitions
Deduced a syphon composed of 137 places in 1 ms
Applied a total of 1 rules in 44 ms. Remains 598 /637 variables (removed 39) and now considering 1567/1567 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 598/684 places, 1567/1828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50904 ms. Remains : 598/684 places, 1567/1828 transitions.
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 16 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:03:52] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-06-01 15:03:52] [INFO ] Computed 42 invariants in 65 ms
[2024-06-01 15:03:52] [INFO ] State equation strengthened by 160 read => feed constraints.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLCardinality-03
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLCardinality-05
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-LTLCardinality-08
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717254905682

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S04J04T08-LTLCardinality-00
ltl formula formula --ltl=/tmp/1070/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 0.800 real 0.210 user 0.180 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 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 4021 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 ~604!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2954
pnml2lts-mc( 0/ 4): unique transitions count: 6442
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: 2957
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2957
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2957 states 6458 transitions, fanout: 2.184
pnml2lts-mc( 0/ 4): Total exploration time 0.420 sec (0.410 sec minimum, 0.417 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7040, Transitions per second: 15376
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, 50.3 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.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLCardinality-01
ltl formula formula --ltl=/tmp/1070/ltl_1_
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.720 real 0.170 user 0.260 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/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 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( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~966!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2731
pnml2lts-mc( 0/ 4): unique transitions count: 9272
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: 2735
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2735
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2735 states 9308 transitions, fanout: 3.403
pnml2lts-mc( 0/ 4): Total exploration time 0.420 sec (0.400 sec minimum, 0.415 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6512, Transitions per second: 22162
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, 47.2 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-LTLCardinality-02
ltl formula formula --ltl=/tmp/1070/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.760 real 0.210 user 0.230 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_2_
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 4016 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: 29
pnml2lts-mc( 0/ 4): unique states count: 29
pnml2lts-mc( 0/ 4): unique transitions count: 48
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 30
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 43
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 43 states 91 transitions, fanout: 2.116
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 93.5 B/state, compr.: 3.3%
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-LTLCardinality-03
ltl formula formula --ltl=/tmp/1070/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( 2/ 4): LTL layer: formula: /tmp/1070/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.160 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_3_
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 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): ~2377 levels ~10000 states ~19744 transitions
pnml2lts-mc( 1/ 4): ~4798 levels ~20000 states ~45628 transitions
pnml2lts-mc( 2/ 4): ~9735 levels ~40000 states ~100228 transitions
pnml2lts-mc( 0/ 4): ~18357 levels ~80000 states ~144196 transitions
pnml2lts-mc( 1/ 4): ~37203 levels ~160000 states ~369660 transitions
pnml2lts-mc( 3/ 4): ~74351 levels ~320000 states ~719560 transitions
pnml2lts-mc( 3/ 4): ~145397 levels ~640000 states ~1471108 transitions
pnml2lts-mc( 0/ 4): ~271976 levels ~1280000 states ~2406020 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26037
pnml2lts-mc( 0/ 4): unique states count: 2307427
pnml2lts-mc( 0/ 4): unique transitions count: 5424382
pnml2lts-mc( 0/ 4): - self-loop count: 175
pnml2lts-mc( 0/ 4): - claim dead count: 5763
pnml2lts-mc( 0/ 4): - claim found count: 689037
pnml2lts-mc( 0/ 4): - claim success count: 2307434
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2028031
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2307436 states 5424404 transitions, fanout: 2.351
pnml2lts-mc( 0/ 4): Total exploration time 195.490 sec (195.430 sec minimum, 195.452 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11803, Transitions per second: 27748
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 97.6MB, 23.2 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.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: 97.6MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLCardinality-04
ltl formula formula --ltl=/tmp/1070/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.660 real 0.190 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 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):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~503!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1629
pnml2lts-mc( 0/ 4): unique transitions count: 3816
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: 1634
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1634
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1634 states 3840 transitions, fanout: 2.350
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.220 sec minimum, 0.220 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7427, Transitions per second: 17455
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.1 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-LTLCardinality-05
ltl formula formula --ltl=/tmp/1070/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.530 real 0.180 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 732 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 713, there are 4021 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): ~1229 levels ~10000 states ~24316 transitions
pnml2lts-mc( 3/ 4): ~2456 levels ~20000 states ~46144 transitions
pnml2lts-mc( 3/ 4): ~4803 levels ~40000 states ~87804 transitions
pnml2lts-mc( 3/ 4): ~9536 levels ~80000 states ~173464 transitions
pnml2lts-mc( 3/ 4): ~18816 levels ~160000 states ~341468 transitions
pnml2lts-mc( 3/ 4): ~34964 levels ~320000 states ~636372 transitions
pnml2lts-mc( 3/ 4): ~70704 levels ~640000 states ~1321104 transitions
pnml2lts-mc( 3/ 4): ~143457 levels ~1280000 states ~2695052 transitions
pnml2lts-mc( 3/ 4): ~280631 levels ~2560000 states ~5434708 transitions
ltl formula name PolyORBLF-PT-S04J04T08-LTLCardinality-06
ltl formula formula --ltl=/tmp/1070/ltl_6_
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.640 real 0.220 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 5 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 4021 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: 13
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13 states 20 transitions, fanout: 1.538
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1300, 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, 264.0 B/state, compr.: 9.3%
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-LTLCardinality-07
ltl formula formula --ltl=/tmp/1070/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.490 real 0.220 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_7_
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 4017 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 ~481!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2086
pnml2lts-mc( 0/ 4): unique transitions count: 4875
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: 2094
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2094
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2094 states 4906 transitions, fanout: 2.343
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.230 sec minimum, 0.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9104, Transitions per second: 21330
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.3 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-LTLCardinality-08
ltl formula formula --ltl=/tmp/1070/ltl_8_
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.550 real 0.180 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_8_
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 4017 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): ~24 levels ~10000 states ~17348 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~20000 states ~35192 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~40000 states ~70416 transitions
pnml2lts-mc( 0/ 4): ~33 levels ~80000 states ~146584 transitions
pnml2lts-mc( 0/ 4): ~33 levels ~160000 states ~358556 transitions
pnml2lts-mc( 2/ 4): ~42 levels ~320000 states ~924396 transitions
pnml2lts-mc( 2/ 4): ~42 levels ~640000 states ~2122760 transitions
pnml2lts-mc( 0/ 4): ~33 levels ~1280000 states ~3398628 transitions
pnml2lts-mc( 0/ 4): ~33 levels ~2560000 states ~6895932 transitions
ltl formula name PolyORBLF-PT-S04J04T08-LTLCardinality-09
ltl formula formula --ltl=/tmp/1070/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.610 real 0.220 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_9_
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 4020 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 ~354!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1415
pnml2lts-mc( 0/ 4): unique transitions count: 3219
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: 1419
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1419
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1419 states 3239 transitions, fanout: 2.283
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.150 sec minimum, 0.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9460, Transitions per second: 21593
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, 53.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-LTLCardinality-10
ltl formula formula --ltl=/tmp/1070/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.540 real 0.190 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_10_
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 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 ~667!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2404
pnml2lts-mc( 0/ 4): unique transitions count: 5512
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: 2408
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2408
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2408 states 5532 transitions, fanout: 2.297
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.260 sec minimum, 0.260 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9262, Transitions per second: 21277
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, 52.2 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.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T08-LTLCardinality-11
ltl formula formula --ltl=/tmp/1070/ltl_11_
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.510 real 0.180 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_11_
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 4021 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 ~455!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1690
pnml2lts-mc( 0/ 4): unique transitions count: 3955
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: 1694
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1694
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1694 states 3975 transitions, fanout: 2.347
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: 8470, Transitions per second: 19875
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.3 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-LTLCardinality-12
ltl formula formula --ltl=/tmp/1070/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.510 real 0.200 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/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( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~411!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1712
pnml2lts-mc( 0/ 4): unique transitions count: 3836
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: 1716
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1716
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1716 states 3856 transitions, fanout: 2.247
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.220 sec minimum, 0.220 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7800, Transitions per second: 17527
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, 54.1 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-LTLCardinality-13
ltl formula formula --ltl=/tmp/1070/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.500 real 0.200 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 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 4021 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 ~685!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 177
pnml2lts-mc( 0/ 4): unique states count: 2984
pnml2lts-mc( 0/ 4): unique transitions count: 14176
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 499
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2996
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2819
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2996 states 14396 transitions, fanout: 4.805
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.320 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9362, Transitions per second: 44988
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.4 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-LTLCardinality-14
ltl formula formula --ltl=/tmp/1070/ltl_14_
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.530 real 0.210 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_14_
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( 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: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 760.0 B/state, compr.: 26.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-LTLCardinality-15
ltl formula formula --ltl=/tmp/1070/ltl_15_
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.620 real 0.190 user 0.200 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1070/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1070/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1070/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1070/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 1 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 4013 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: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 760.0 B/state, compr.: 26.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)

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="LTLCardinality"
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 LTLCardinality"
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-171654446700275"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;