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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 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 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 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.5M 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-S04J06T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717254800448

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-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:13:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:13:22] [INFO ] Load time of PNML (sax parser for PT used): 471 ms
[2024-06-01 15:13:22] [INFO ] Transformed 792 places.
[2024-06-01 15:13:22] [INFO ] Transformed 4268 transitions.
[2024-06-01 15:13:22] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 690 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 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-S04J06T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 350 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 781 transition count 2093
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 781 transition count 2093
Applied a total of 18 rules in 194 ms. Remains 781 /792 variables (removed 11) and now considering 2093/2100 (removed 7) transitions.
Running 2089 sub problems to find dead transitions.
[2024-06-01 15:13:23] [INFO ] Flow matrix only has 2061 transitions (discarded 32 similar events)
// Phase 1: matrix 2061 rows 781 cols
[2024-06-01 15:13:23] [INFO ] Computed 54 invariants in 165 ms
[2024-06-01 15:13:23] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/777 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2089 unsolved
SMT process timed out in 30242ms, After SMT, problems are : Problem set: 0 solved, 2089 unsolved
Search for dead transitions found 0 dead transitions in 30374ms
[2024-06-01 15:13:53] [INFO ] Flow matrix only has 2061 transitions (discarded 32 similar events)
[2024-06-01 15:13:53] [INFO ] Invariant cache hit.
[2024-06-01 15:13:54] [INFO ] Implicit Places using invariants in 700 ms returned [2, 134, 146, 217, 295, 351, 389, 575]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 709 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 773/792 places, 2093/2100 transitions.
Applied a total of 0 rules in 12 ms. Remains 773 /773 variables (removed 0) and now considering 2093/2093 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31451 ms. Remains : 773/792 places, 2093/2100 transitions.
Support contains 350 out of 773 places after structural reductions.
[2024-06-01 15:13:55] [INFO ] Flatten gal took : 343 ms
[2024-06-01 15:13:55] [INFO ] Flatten gal took : 243 ms
[2024-06-01 15:13:56] [INFO ] Input system was already deterministic with 2093 transitions.
Support contains 349 out of 773 places (down from 350) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 1896 ms. (21 steps per ms) remains 4/27 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
[2024-06-01 15:13:57] [INFO ] Flow matrix only has 2061 transitions (discarded 32 similar events)
// Phase 1: matrix 2061 rows 773 cols
[2024-06-01 15:13:57] [INFO ] Computed 46 invariants in 92 ms
[2024-06-01 15:13:57] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/256 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/259 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/276 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 9 (OVERLAPS) 478/754 variables, 17/32 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 757/2834 variables, and 35 constraints, problems are : Problem set: 4 solved, 0 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/27 constraints, State Equation: 0/773 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2277ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0))&&G(p1)) U G(p2))))'
Support contains 68 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 2093/2093 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 765 transition count 2085
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 765 transition count 2085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 764 transition count 2084
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 764 transition count 2084
Applied a total of 18 rules in 44 ms. Remains 764 /773 variables (removed 9) and now considering 2084/2093 (removed 9) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:13:59] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2024-06-01 15:13:59] [INFO ] Computed 46 invariants in 33 ms
[2024-06-01 15:13:59] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 29255ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 29283ms
[2024-06-01 15:14:29] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:14:29] [INFO ] Invariant cache hit.
[2024-06-01 15:14:30] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2024-06-01 15:14:30] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:14:30] [INFO ] Invariant cache hit.
[2024-06-01 15:14:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:15:02] [INFO ] Performed 363/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:15:22] [INFO ] Implicit Places using invariants and state equation in 52059 ms returned []
Implicit Place search using SMT with State Equation took 53135 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:15:22] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:15:22] [INFO ] Invariant cache hit.
[2024-06-01 15:15:22] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:15:52] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 25 ms to minimize.
[2024-06-01 15:15:59] [INFO ] Deduced a trap composed of 131 places in 383 ms of which 18 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 39 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:16:18] [INFO ] Deduced a trap composed of 61 places in 506 ms of which 7 ms to minimize.
[2024-06-01 15:16:18] [INFO ] Deduced a trap composed of 82 places in 427 ms of which 8 ms to minimize.
[2024-06-01 15:16:18] [INFO ] Deduced a trap composed of 82 places in 358 ms of which 3 ms to minimize.
[2024-06-01 15:16:19] [INFO ] Deduced a trap composed of 82 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:16:19] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 3 ms to minimize.
[2024-06-01 15:16:19] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:16:19] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:16:20] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:16:20] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:16:20] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:16:32] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 70314ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 70333ms
Starting structural reductions in LTL mode, iteration 1 : 764/773 places, 2084/2093 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152810 ms. Remains : 764/773 places, 2084/2093 transitions.
Stuttering acceptance computed with spot in 445 ms :[(NOT p2), (NOT p2), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLCardinality-00 finished in 153325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(p1)&&G(p2))))'
Support contains 101 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 2093/2093 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 765 transition count 2085
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 765 transition count 2085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 764 transition count 2084
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 764 transition count 2084
Applied a total of 18 rules in 81 ms. Remains 764 /773 variables (removed 9) and now considering 2084/2093 (removed 9) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:16:33] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:16:33] [INFO ] Invariant cache hit.
[2024-06-01 15:16:33] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 38 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 82 places in 350 ms of which 16 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 82 places in 298 ms of which 2 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 19 places in 456 ms of which 3 ms to minimize.
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 49 places in 348 ms of which 2 ms to minimize.
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 82 places in 296 ms of which 2 ms to minimize.
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 54 places in 297 ms of which 2 ms to minimize.
[2024-06-01 15:17:12] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:17:12] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:17:12] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:17:15] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 48 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 11/11 constraints]
After SMT, in 50864ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 50898ms
[2024-06-01 15:17:24] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:17:24] [INFO ] Invariant cache hit.
[2024-06-01 15:17:25] [INFO ] Implicit Places using invariants in 1846 ms returned []
[2024-06-01 15:17:25] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:17:25] [INFO ] Invariant cache hit.
[2024-06-01 15:17:27] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:17:57] [INFO ] Performed 466/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:18:13] [INFO ] Implicit Places using invariants and state equation in 47666 ms returned []
Implicit Place search using SMT with State Equation took 49513 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:18:13] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:18:13] [INFO ] Invariant cache hit.
[2024-06-01 15:18:13] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:18:42] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:18:47] [INFO ] Deduced a trap composed of 131 places in 218 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 39 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:19:03] [INFO ] Deduced a trap composed of 61 places in 466 ms of which 4 ms to minimize.
[2024-06-01 15:19:03] [INFO ] Deduced a trap composed of 82 places in 422 ms of which 5 ms to minimize.
[2024-06-01 15:19:04] [INFO ] Deduced a trap composed of 82 places in 387 ms of which 4 ms to minimize.
[2024-06-01 15:19:04] [INFO ] Deduced a trap composed of 82 places in 348 ms of which 2 ms to minimize.
[2024-06-01 15:19:04] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 2 ms to minimize.
[2024-06-01 15:19:05] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:19:05] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:19:05] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:19:05] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 3 ms to minimize.
[2024-06-01 15:19:05] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:19:18] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 70149ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 70177ms
Starting structural reductions in LTL mode, iteration 1 : 764/773 places, 2084/2093 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170684 ms. Remains : 764/773 places, 2084/2093 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLCardinality-02
Product exploration explored 100000 steps with 10359 reset in 1043 ms.
Product exploration explored 100000 steps with 10373 reset in 921 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 : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 222 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:19:26] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:19:26] [INFO ] Invariant cache hit.
[2024-06-01 15:19:27] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:19:27] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 74 ms returned sat
[2024-06-01 15:19:30] [INFO ] [Real]Absence check using state equation in 2634 ms returned sat
[2024-06-01 15:19:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:19:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:19:32] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 136 ms returned sat
[2024-06-01 15:19:36] [INFO ] [Nat]Absence check using state equation in 4763 ms returned unknown
Could not prove EG (NOT p0)
Support contains 57 out of 764 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 764 transition count 2052
Reduce places removed 32 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 732 transition count 2036
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 96 place count 716 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 716 transition count 1940
Deduced a syphon composed of 96 places in 14 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 288 place count 620 transition count 1940
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 432 place count 548 transition count 1868
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 439 place count 541 transition count 1861
Iterating global reduction 3 with 7 rules applied. Total rules applied 446 place count 541 transition count 1861
Applied a total of 446 rules in 414 ms. Remains 541 /764 variables (removed 223) and now considering 1861/2084 (removed 223) transitions.
Running 1857 sub problems to find dead transitions.
[2024-06-01 15:19:37] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
// Phase 1: matrix 1829 rows 541 cols
[2024-06-01 15:19:37] [INFO ] Computed 46 invariants in 31 ms
[2024-06-01 15:19:37] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-06-01 15:19:59] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:19:59] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:19:59] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 2 ms to minimize.
[2024-06-01 15:19:59] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:19:59] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:20:00] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:20:00] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:20:00] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:20:01] [INFO ] Deduced a trap composed of 33 places in 496 ms of which 4 ms to minimize.
[2024-06-01 15:20:01] [INFO ] Deduced a trap composed of 191 places in 373 ms of which 3 ms to minimize.
[2024-06-01 15:20:01] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:20:04] [INFO ] Deduced a trap composed of 195 places in 492 ms of which 4 ms to minimize.
[2024-06-01 15:20:04] [INFO ] Deduced a trap composed of 190 places in 510 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/2370 variables, and 55 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1857/1857 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-06-01 15:20:20] [INFO ] Deduced a trap composed of 300 places in 424 ms of which 5 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 87 places in 421 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 5)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 2)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 5)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/2370 variables, and 57 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1857 constraints, Known Traps: 15/15 constraints]
After SMT, in 49388ms problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 49438ms
[2024-06-01 15:20:26] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
[2024-06-01 15:20:26] [INFO ] Invariant cache hit.
[2024-06-01 15:20:27] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-06-01 15:20:27] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
[2024-06-01 15:20:27] [INFO ] Invariant cache hit.
[2024-06-01 15:20:28] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:20:53] [INFO ] Implicit Places using invariants and state equation in 25678 ms returned []
Implicit Place search using SMT with State Equation took 26220 ms to find 0 implicit places.
[2024-06-01 15:20:53] [INFO ] Redundant transitions in 149 ms returned []
Running 1857 sub problems to find dead transitions.
[2024-06-01 15:20:53] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
[2024-06-01 15:20:53] [INFO ] Invariant cache hit.
[2024-06-01 15:20:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 5 ms to minimize.
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:21:17] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:21:17] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:21:18] [INFO ] Deduced a trap composed of 190 places in 460 ms of which 4 ms to minimize.
[2024-06-01 15:21:18] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 2 ms to minimize.
[2024-06-01 15:21:20] [INFO ] Deduced a trap composed of 50 places in 342 ms of which 4 ms to minimize.
[2024-06-01 15:21:21] [INFO ] Deduced a trap composed of 91 places in 513 ms of which 3 ms to minimize.
[2024-06-01 15:21:23] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/2370 variables, and 56 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1857/1857 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-06-01 15:21:41] [INFO ] Deduced a trap composed of 155 places in 365 ms of which 3 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 200 places in 423 ms of which 4 ms to minimize.
[2024-06-01 15:21:47] [INFO ] Deduced a trap composed of 300 places in 274 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/2370 variables, and 59 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1857 constraints, Known Traps: 17/17 constraints]
After SMT, in 69153ms problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 69173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 541/764 places, 1861/2084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145414 ms. Remains : 541/764 places, 1861/2084 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:22:02] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
[2024-06-01 15:22:02] [INFO ] Invariant cache hit.
[2024-06-01 15:22:03] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:22:03] [INFO ] [Real]Absence check using 18 positive and 28 generalized place invariants in 48 ms returned sat
[2024-06-01 15:22:06] [INFO ] [Real]Absence check using state equation in 2739 ms returned sat
[2024-06-01 15:22:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:22:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:22:07] [INFO ] [Nat]Absence check using 18 positive and 28 generalized place invariants in 68 ms returned sat
[2024-06-01 15:22:12] [INFO ] [Nat]Absence check using state equation in 5362 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10416 reset in 959 ms.
Product exploration explored 100000 steps with 10362 reset in 818 ms.
Support contains 57 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 1861/1861 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 541 transition count 1853
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 533 transition count 1853
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 525 transition count 1845
Applied a total of 32 rules in 158 ms. Remains 525 /541 variables (removed 16) and now considering 1845/1861 (removed 16) transitions.
Running 1841 sub problems to find dead transitions.
[2024-06-01 15:22:14] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
// Phase 1: matrix 1813 rows 525 cols
[2024-06-01 15:22:14] [INFO ] Computed 46 invariants in 57 ms
[2024-06-01 15:22:14] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-06-01 15:22:36] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:22:36] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:22:36] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:22:36] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:22:37] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:22:37] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:22:37] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:22:37] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:22:37] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:22:37] [INFO ] Deduced a trap composed of 174 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:22:38] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 78 places in 375 ms of which 4 ms to minimize.
[2024-06-01 15:22:41] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2338 variables, and 56 constraints, problems are : Problem set: 0 solved, 1841 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1841/1841 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1841 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-06-01 15:22:59] [INFO ] Deduced a trap composed of 284 places in 360 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/2338 variables, and 57 constraints, problems are : Problem set: 0 solved, 1841 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1841 constraints, Known Traps: 15/15 constraints]
After SMT, in 49683ms problems are : Problem set: 0 solved, 1841 unsolved
Search for dead transitions found 0 dead transitions in 49713ms
[2024-06-01 15:23:04] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
[2024-06-01 15:23:04] [INFO ] Invariant cache hit.
[2024-06-01 15:23:05] [INFO ] Implicit Places using invariants in 745 ms returned []
[2024-06-01 15:23:05] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
[2024-06-01 15:23:05] [INFO ] Invariant cache hit.
[2024-06-01 15:23:07] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:23:26] [INFO ] Implicit Places using invariants and state equation in 21083 ms returned []
Implicit Place search using SMT with State Equation took 21830 ms to find 0 implicit places.
[2024-06-01 15:23:26] [INFO ] Redundant transitions in 147 ms returned []
Running 1841 sub problems to find dead transitions.
[2024-06-01 15:23:26] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
[2024-06-01 15:23:26] [INFO ] Invariant cache hit.
[2024-06-01 15:23:26] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-06-01 15:23:46] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 283 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:23:48] [INFO ] Deduced a trap composed of 174 places in 263 ms of which 2 ms to minimize.
[2024-06-01 15:23:48] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 7 ms to minimize.
[2024-06-01 15:23:48] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:23:50] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:23:54] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:23:55] [INFO ] Deduced a trap composed of 99 places in 279 ms of which 2 ms to minimize.
[2024-06-01 15:24:03] [INFO ] Deduced a trap composed of 208 places in 264 ms of which 2 ms to minimize.
[2024-06-01 15:24:03] [INFO ] Deduced a trap composed of 139 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:24:04] [INFO ] Deduced a trap composed of 209 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2338 variables, and 59 constraints, problems are : Problem set: 0 solved, 1841 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1841/1841 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1841 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-06-01 15:24:26] [INFO ] Deduced a trap composed of 284 places in 296 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/2338 variables, and 60 constraints, problems are : Problem set: 0 solved, 1841 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1841 constraints, Known Traps: 18/18 constraints]
After SMT, in 68912ms problems are : Problem set: 0 solved, 1841 unsolved
Search for dead transitions found 0 dead transitions in 68944ms
Starting structural reductions in SI_LTL mode, iteration 1 : 525/541 places, 1845/1861 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140825 ms. Remains : 525/541 places, 1845/1861 transitions.
Treatment of property PolyORBLF-PT-S04J06T08-LTLCardinality-02 finished in 482586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1)&&X(p2))))))'
Support contains 33 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 2093/2093 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 772 transition count 2092
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 772 transition count 2092
Applied a total of 2 rules in 36 ms. Remains 772 /773 variables (removed 1) and now considering 2092/2093 (removed 1) transitions.
Running 2088 sub problems to find dead transitions.
[2024-06-01 15:24:35] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 772 cols
[2024-06-01 15:24:35] [INFO ] Computed 46 invariants in 44 ms
[2024-06-01 15:24:35] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 15:25:03] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2832 variables, and 38 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 15:25:18] [INFO ] Deduced a trap composed of 83 places in 384 ms of which 3 ms to minimize.
[2024-06-01 15:25:18] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 1 ms to minimize.
[2024-06-01 15:25:18] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:25:18] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 16 ms to minimize.
[2024-06-01 15:25:19] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:25:19] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:25:25] [INFO ] Deduced a trap composed of 156 places in 279 ms of which 3 ms to minimize.
SMT process timed out in 49764ms, After SMT, problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 49794ms
[2024-06-01 15:25:25] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 15:25:25] [INFO ] Invariant cache hit.
[2024-06-01 15:25:26] [INFO ] Implicit Places using invariants in 919 ms returned []
[2024-06-01 15:25:26] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 15:25:26] [INFO ] Invariant cache hit.
[2024-06-01 15:25:27] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:25:57] [INFO ] Performed 669/772 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:26:00] [INFO ] Implicit Places using invariants and state equation in 34345 ms returned []
Implicit Place search using SMT with State Equation took 35278 ms to find 0 implicit places.
Running 2088 sub problems to find dead transitions.
[2024-06-01 15:26:00] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 15:26:00] [INFO ] Invariant cache hit.
[2024-06-01 15:26:00] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 15:26:26] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:26:32] [INFO ] Deduced a trap composed of 147 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:26:32] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2832 variables, and 40 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/772 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 2070 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/2832 variables, and 49 constraints, problems are : Problem set: 18 solved, 2070 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 3/3 constraints]
After SMT, in 68419ms problems are : Problem set: 18 solved, 2070 unsolved
Search for dead transitions found 18 dead transitions in 68441ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 772/773 places, 2074/2093 transitions.
Applied a total of 0 rules in 14 ms. Remains 772 /772 variables (removed 0) and now considering 2074/2074 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153590 ms. Remains : 772/773 places, 2074/2093 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 46707 steps with 9317 reset in 376 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLCardinality-03 finished in 154209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)) U X(G(p0))))'
Support contains 73 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 2093/2093 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 765 transition count 2085
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 765 transition count 2085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 764 transition count 2084
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 764 transition count 2084
Applied a total of 18 rules in 50 ms. Remains 764 /773 variables (removed 9) and now considering 2084/2093 (removed 9) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:27:09] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2024-06-01 15:27:10] [INFO ] Computed 46 invariants in 28 ms
[2024-06-01 15:27:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:27:36] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 38 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:27:45] [INFO ] Deduced a trap composed of 49 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:27:45] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:27:45] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:27:45] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:27:45] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 0 ms to minimize.
[2024-06-01 15:27:46] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:27:46] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:27:47] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:27:55] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 4 ms to minimize.
[2024-06-01 15:27:55] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 49193ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49215ms
[2024-06-01 15:27:59] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:27:59] [INFO ] Invariant cache hit.
[2024-06-01 15:27:59] [INFO ] Implicit Places using invariants in 743 ms returned []
[2024-06-01 15:27:59] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:27:59] [INFO ] Invariant cache hit.
[2024-06-01 15:28:01] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:28:30] [INFO ] Implicit Places using invariants and state equation in 30817 ms returned []
Implicit Place search using SMT with State Equation took 31575 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:28:30] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:28:30] [INFO ] Invariant cache hit.
[2024-06-01 15:28:30] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:28:59] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:29:05] [INFO ] Deduced a trap composed of 131 places in 266 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 39 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:29:19] [INFO ] Deduced a trap composed of 61 places in 459 ms of which 5 ms to minimize.
[2024-06-01 15:29:20] [INFO ] Deduced a trap composed of 82 places in 468 ms of which 5 ms to minimize.
[2024-06-01 15:29:20] [INFO ] Deduced a trap composed of 82 places in 419 ms of which 4 ms to minimize.
[2024-06-01 15:29:21] [INFO ] Deduced a trap composed of 82 places in 440 ms of which 3 ms to minimize.
[2024-06-01 15:29:21] [INFO ] Deduced a trap composed of 42 places in 362 ms of which 3 ms to minimize.
[2024-06-01 15:29:21] [INFO ] Deduced a trap composed of 49 places in 349 ms of which 3 ms to minimize.
[2024-06-01 15:29:21] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:29:22] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:29:22] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:29:22] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:29:33] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 69346ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 69364ms
Starting structural reductions in LTL mode, iteration 1 : 764/773 places, 2084/2093 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150229 ms. Remains : 764/773 places, 2084/2093 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLCardinality-04 finished in 150430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(F(p1))&&(p2||X(p3)))))'
Support contains 48 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 2093/2093 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 765 transition count 2085
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 765 transition count 2085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 764 transition count 2084
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 764 transition count 2084
Applied a total of 18 rules in 36 ms. Remains 764 /773 variables (removed 9) and now considering 2084/2093 (removed 9) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:29:40] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:29:40] [INFO ] Invariant cache hit.
[2024-06-01 15:29:40] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:30:06] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 38 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:30:15] [INFO ] Deduced a trap composed of 82 places in 340 ms of which 3 ms to minimize.
[2024-06-01 15:30:15] [INFO ] Deduced a trap composed of 82 places in 302 ms of which 2 ms to minimize.
[2024-06-01 15:30:15] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 4 ms to minimize.
[2024-06-01 15:30:16] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 2 ms to minimize.
[2024-06-01 15:30:16] [INFO ] Deduced a trap composed of 82 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:30:16] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:30:16] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:30:16] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:30:17] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:30:19] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:30:27] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:30:27] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 48688ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 48711ms
[2024-06-01 15:30:29] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:30:29] [INFO ] Invariant cache hit.
[2024-06-01 15:30:29] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-06-01 15:30:29] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:30:29] [INFO ] Invariant cache hit.
[2024-06-01 15:30:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:31:01] [INFO ] Performed 336/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:31:27] [INFO ] Implicit Places using invariants and state equation in 57812 ms returned []
Implicit Place search using SMT with State Equation took 58702 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:31:27] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:31:27] [INFO ] Invariant cache hit.
[2024-06-01 15:31:27] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:31:53] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:31:58] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 39 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:32:14] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 3 ms to minimize.
[2024-06-01 15:32:14] [INFO ] Deduced a trap composed of 82 places in 317 ms of which 3 ms to minimize.
[2024-06-01 15:32:15] [INFO ] Deduced a trap composed of 82 places in 432 ms of which 4 ms to minimize.
[2024-06-01 15:32:15] [INFO ] Deduced a trap composed of 82 places in 369 ms of which 4 ms to minimize.
[2024-06-01 15:32:15] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 49 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:32:26] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 68578ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 68606ms
Starting structural reductions in LTL mode, iteration 1 : 764/773 places, 2084/2093 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176067 ms. Remains : 764/773 places, 2084/2093 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), true]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLCardinality-05
Product exploration explored 100000 steps with 1731 reset in 448 ms.
Product exploration explored 100000 steps with 1744 reset in 459 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 : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT p2)), (X (NOT p1)), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 108 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 351 steps (0 resets) in 7 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT p2)), (X (NOT p1)), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 17 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
[2024-06-01 15:32:38] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:32:38] [INFO ] Invariant cache hit.
[2024-06-01 15:32:39] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 15:32:39] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 89 ms returned sat
[2024-06-01 15:32:41] [INFO ] [Real]Absence check using state equation in 2693 ms returned sat
[2024-06-01 15:32:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:32:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 15:32:43] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 69 ms returned sat
[2024-06-01 15:32:46] [INFO ] [Nat]Absence check using state equation in 3558 ms returned sat
[2024-06-01 15:32:46] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:32:47] [INFO ] [Nat]Added 160 Read/Feed constraints in 596 ms returned sat
[2024-06-01 15:32:47] [INFO ] Deduced a trap composed of 118 places in 486 ms of which 5 ms to minimize.
[2024-06-01 15:32:48] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 1 ms to minimize.
[2024-06-01 15:32:48] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:32:49] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 1 ms to minimize.
[2024-06-01 15:32:50] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 1 ms to minimize.
[2024-06-01 15:32:50] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:32:51] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:32:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4208 ms
[2024-06-01 15:32:51] [INFO ] Computed and/alt/rep : 1456/6179/1432 causal constraints (skipped 616 transitions) in 265 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 15:32:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 8 out of 764 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 764 transition count 2060
Reduce places removed 24 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 32 rules applied. Total rules applied 56 place count 740 transition count 2052
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 64 place count 732 transition count 2052
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 64 place count 732 transition count 1956
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 256 place count 636 transition count 1956
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 368 place count 580 transition count 1900
Applied a total of 368 rules in 176 ms. Remains 580 /764 variables (removed 184) and now considering 1900/2084 (removed 184) transitions.
Running 1896 sub problems to find dead transitions.
[2024-06-01 15:32:57] [INFO ] Flow matrix only has 1868 transitions (discarded 32 similar events)
// Phase 1: matrix 1868 rows 580 cols
[2024-06-01 15:32:57] [INFO ] Computed 46 invariants in 64 ms
[2024-06-01 15:32:57] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:33:21] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:33:21] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:33:22] [INFO ] Deduced a trap composed of 245 places in 215 ms of which 2 ms to minimize.
[2024-06-01 15:33:22] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:33:26] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2448 variables, and 54 constraints, problems are : Problem set: 0 solved, 1896 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/580 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1896/1896 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1896 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 236 places in 401 ms of which 3 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 101 places in 336 ms of which 3 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 252 places in 314 ms of which 2 ms to minimize.
[2024-06-01 15:33:40] [INFO ] Deduced a trap composed of 212 places in 331 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2448 variables, and 58 constraints, problems are : Problem set: 0 solved, 1896 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/580 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1896 constraints, Known Traps: 16/16 constraints]
After SMT, in 49831ms problems are : Problem set: 0 solved, 1896 unsolved
Search for dead transitions found 0 dead transitions in 49859ms
[2024-06-01 15:33:47] [INFO ] Flow matrix only has 1868 transitions (discarded 32 similar events)
[2024-06-01 15:33:47] [INFO ] Invariant cache hit.
[2024-06-01 15:33:47] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-06-01 15:33:47] [INFO ] Flow matrix only has 1868 transitions (discarded 32 similar events)
[2024-06-01 15:33:47] [INFO ] Invariant cache hit.
[2024-06-01 15:33:49] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:34:16] [INFO ] Implicit Places using invariants and state equation in 28921 ms returned []
Implicit Place search using SMT with State Equation took 29601 ms to find 0 implicit places.
[2024-06-01 15:34:16] [INFO ] Redundant transitions in 94 ms returned []
Running 1896 sub problems to find dead transitions.
[2024-06-01 15:34:16] [INFO ] Flow matrix only has 1868 transitions (discarded 32 similar events)
[2024-06-01 15:34:16] [INFO ] Invariant cache hit.
[2024-06-01 15:34:16] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 0 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 3 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 2 ms to minimize.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLCardinality-04
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLCardinality-07
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLCardinality-12
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLCardinality-15

BK_STOP 1717257139955

--------------------
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-S04J06T08-LTLCardinality-00
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.970 real 0.250 user 0.280 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 812 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4287 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~282!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 961
pnml2lts-mc( 0/ 4): unique transitions count: 2489
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: 965
pnml2lts-mc( 0/ 4): - cum. max stack depth: 965
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 965 states 2509 transitions, fanout: 2.600
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.210 sec minimum, 0.218 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4386, Transitions per second: 11405
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 53.0 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J06T08-LTLCardinality-01
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.180 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 812 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4287 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 ~348!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1396
pnml2lts-mc( 0/ 4): unique transitions count: 3088
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: 1404
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1404
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1404 states 3129 transitions, fanout: 2.229
pnml2lts-mc( 0/ 4): Total exploration time 0.330 sec (0.310 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4255, Transitions per second: 9482
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.0 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 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-S04J06T08-LTLCardinality-02
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.710 real 0.220 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_2_
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 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4278 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): ~13 levels ~10000 states ~14360 transitions
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: 14453
pnml2lts-mc( 0/ 4): unique states count: 14453
pnml2lts-mc( 0/ 4): unique transitions count: 21423
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7182
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 14572
pnml2lts-mc( 0/ 4): - cum. max stack depth: 52
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14572 states 22167 transitions, fanout: 1.521
pnml2lts-mc( 0/ 4): Total exploration time 2.780 sec (2.760 sec minimum, 2.767 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5242, Transitions per second: 7974
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, 23.9 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 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-S04J06T08-LTLCardinality-03
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.740 real 0.120 user 0.130 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4281 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 ~587!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 98
pnml2lts-mc( 0/ 4): unique states count: 2489
pnml2lts-mc( 0/ 4): unique transitions count: 6187
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 77
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2492
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2394
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2492 states 6203 transitions, fanout: 2.489
pnml2lts-mc( 0/ 4): Total exploration time 0.610 sec (0.590 sec minimum, 0.598 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4085, Transitions per second: 10169
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, 47.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 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-S04J06T08-LTLCardinality-04
ltl formula formula --ltl=/tmp/1621/ltl_4_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.650 real 0.210 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_4_
ltl formula name PolyORBLF-PT-S04J06T08-LTLCardinality-05
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.140 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_5_
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 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4279 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): ~109 levels ~10000 states ~13216 transitions
pnml2lts-mc( 3/ 4): ~109 levels ~20000 states ~25980 transitions
pnml2lts-mc( 3/ 4): ~109 levels ~40000 states ~51492 transitions
pnml2lts-mc( 3/ 4): ~109 levels ~80000 states ~102560 transitions
pnml2lts-mc( 0/ 4): ~1088 levels ~160000 states ~277028 transitions
pnml2lts-mc( 0/ 4): ~1092 levels ~320000 states ~548456 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~1799!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 509878
pnml2lts-mc( 0/ 4): unique states count: 514269
pnml2lts-mc( 0/ 4): unique transitions count: 737723
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 209417
pnml2lts-mc( 0/ 4): - claim found count: 28
pnml2lts-mc( 0/ 4): - claim success count: 514273
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4442
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 514273 states 737771 transitions, fanout: 1.435
pnml2lts-mc( 0/ 4): Total exploration time 94.310 sec (94.300 sec minimum, 94.305 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5453, Transitions per second: 7823
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 9.6MB, 19.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/8.0%
pnml2lts-mc( 0/ 4): Stored 4384 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 9.6MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J06T08-LTLCardinality-06
ltl formula formula --ltl=/tmp/1621/ltl_6_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.210 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 812 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4284 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 ~533!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2135
pnml2lts-mc( 0/ 4): unique transitions count: 5586
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: 2138
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2138
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2138 states 5602 transitions, fanout: 2.620
pnml2lts-mc( 0/ 4): Total exploration time 0.450 sec (0.430 sec minimum, 0.438 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4751, Transitions per second: 12449
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, 45.8 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 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-S04J06T08-LTLCardinality-07
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.180 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_7_
ltl formula name PolyORBLF-PT-S04J06T08-LTLCardinality-08
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_8_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.930 real 0.170 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_8_
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 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4274 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 ~272!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1751
pnml2lts-mc( 0/ 4): unique states count: 2293
pnml2lts-mc( 0/ 4): unique transitions count: 4714
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 1783
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2297
pnml2lts-mc( 0/ 4): - cum. max stack depth: 627
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2297 states 4734 transitions, fanout: 2.061
pnml2lts-mc( 0/ 4): Total exploration time 0.380 sec (0.380 sec minimum, 0.380 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6045, Transitions per second: 12458
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 41.9 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J06T08-LTLCardinality-09
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.150 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_9_
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 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4269 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~544!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 3025
pnml2lts-mc( 0/ 4): unique transitions count: 6934
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: 3029
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3029
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3029 states 6954 transitions, fanout: 2.296
pnml2lts-mc( 0/ 4): Total exploration time 0.460 sec (0.460 sec minimum, 0.460 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6585, Transitions per second: 15117
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, 46.2 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 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-S04J06T08-LTLCardinality-10
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.200 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4307 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, 808.0 B/state, compr.: 25.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 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-S04J06T08-LTLCardinality-11
ltl formula formula --ltl=/tmp/1621/ltl_11_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.220 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_11_
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 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4269 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.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
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, 808.0 B/state, compr.: 25.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 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-S04J06T08-LTLCardinality-12
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.170 user 0.130 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 812 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4276 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): ~2488 levels ~10000 states ~26168 transitions
pnml2lts-mc( 3/ 4): ~4930 levels ~20000 states ~51508 transitions
pnml2lts-mc( 2/ 4): ~7323 levels ~40000 states ~71364 transitions
pnml2lts-mc( 3/ 4): ~19535 levels ~80000 states ~201608 transitions
pnml2lts-mc( 3/ 4): ~39014 levels ~160000 states ~421624 transitions
pnml2lts-mc( 3/ 4): ~77468 levels ~320000 states ~799868 transitions
pnml2lts-mc( 2/ 4): ~114309 levels ~640000 states ~1144148 transitions
pnml2lts-mc( 0/ 4): ~297505 levels ~1280000 states ~2852884 transitions
ltl formula name PolyORBLF-PT-S04J06T08-LTLCardinality-13
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 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( 2/ 4): LTL layer: formula: /tmp/1621/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 812 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4276 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): ~2304 levels ~10000 states ~23768 transitions
pnml2lts-mc( 0/ 4): ~4642 levels ~20000 states ~47076 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~7076!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 249
pnml2lts-mc( 0/ 4): unique states count: 30050
pnml2lts-mc( 0/ 4): unique transitions count: 69000
pnml2lts-mc( 0/ 4): - self-loop count: 14
pnml2lts-mc( 0/ 4): - claim dead count: 28
pnml2lts-mc( 0/ 4): - claim found count: 884
pnml2lts-mc( 0/ 4): - claim success count: 30053
pnml2lts-mc( 0/ 4): - cum. max stack depth: 29098
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30053 states 69016 transitions, fanout: 2.296
pnml2lts-mc( 0/ 4): Total exploration time 3.360 sec (3.350 sec minimum, 3.357 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8944, Transitions per second: 20540
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.2MB, 34.6 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 4384 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J06T08-LTLCardinality-14
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.200 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4271 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 ~648!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2209
pnml2lts-mc( 0/ 4): unique transitions count: 5245
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: 2212
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2212
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2212 states 5261 transitions, fanout: 2.378
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.270 sec minimum, 0.270 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8193, Transitions per second: 19485
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, 49.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4384 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-S04J06T08-LTLCardinality-15
ltl formula formula --ltl=/tmp/1621/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 792 places, 4268 transitions and 28832 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J06T08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.570 real 0.170 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1621/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1621/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1621/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1621/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 812 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4274 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): ~2496 levels ~10000 states ~24804 transitions
pnml2lts-mc( 3/ 4): ~4942 levels ~20000 states ~48012 transitions
pnml2lts-mc( 3/ 4): ~9786 levels ~40000 states ~97140 transitions
pnml2lts-mc( 1/ 4): ~18856 levels ~80000 states ~191308 transitions
pnml2lts-mc( 1/ 4): ~37611 levels ~160000 states ~383600 transitions
pnml2lts-mc( 2/ 4): ~74319 levels ~320000 states ~647000 transitions
pnml2lts-mc( 1/ 4): ~144700 levels ~640000 states ~1528984 transitions
pnml2lts-mc( 0/ 4): ~293168 levels ~1280000 states ~3375016 transitions

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-S04J06T08"
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-S04J06T08, 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-171654446800299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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