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

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

=== Now, execution of the tool begins

BK_START 1717254896051

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:14:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:14:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:14:57] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2024-06-01 15:14:57] [INFO ] Transformed 792 places.
[2024-06-01 15:14:57] [INFO ] Transformed 4268 transitions.
[2024-06-01 15:14:57] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 476 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 171 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 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Applied a total of 20 rules in 126 ms. Remains 780 /792 variables (removed 12) and now considering 2092/2100 (removed 8) transitions.
Running 2088 sub problems to find dead transitions.
[2024-06-01 15:14:58] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 780 cols
[2024-06-01 15:14:58] [INFO ] Computed 54 invariants in 123 ms
[2024-06-01 15:14:58] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
SMT process timed out in 28900ms, After SMT, problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 28976ms
[2024-06-01 15:15:27] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 15:15:27] [INFO ] Invariant cache hit.
[2024-06-01 15:15:28] [INFO ] Implicit Places using invariants in 944 ms returned []
[2024-06-01 15:15:28] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 15:15:28] [INFO ] Invariant cache hit.
[2024-06-01 15:15:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:15:59] [INFO ] Implicit Places using invariants and state equation in 31403 ms returned []
Implicit Place search using SMT with State Equation took 32354 ms to find 0 implicit places.
Running 2088 sub problems to find dead transitions.
[2024-06-01 15:15:59] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 15:15:59] [INFO ] Invariant cache hit.
[2024-06-01 15:15:59] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 15:16:29] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 14 ms to minimize.
[2024-06-01 15:16:35] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 4 ms to minimize.
(s134 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.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 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 2.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 2.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 4.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 2.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 2.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 47 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 15:16:48] [INFO ] Deduced a trap composed of 98 places in 411 ms of which 5 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 83 places in 368 ms of which 6 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 82 places in 363 ms of which 3 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 82 places in 316 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 114 places in 297 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 2 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 83 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 83 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:16:51] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2840 variables, and 57 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 12/12 constraints]
After SMT, in 69365ms problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 69389ms
Starting structural reductions in LTL mode, iteration 1 : 780/792 places, 2092/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130905 ms. Remains : 780/792 places, 2092/2100 transitions.
Support contains 171 out of 780 places after structural reductions.
[2024-06-01 15:17:09] [INFO ] Flatten gal took : 200 ms
[2024-06-01 15:17:09] [INFO ] Flatten gal took : 121 ms
[2024-06-01 15:17:09] [INFO ] Input system was already deterministic with 2092 transitions.
Support contains 163 out of 780 places (down from 171) after GAL structural reductions.
RANDOM walk for 29406 steps (7 resets) in 900 ms. (32 steps per ms) remains 0/19 properties
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 17 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 780 transition count 2052
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 740 transition count 2044
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 732 transition count 2044
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 96 place count 732 transition count 1940
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 304 place count 628 transition count 1940
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 6 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 432 place count 564 transition count 1876
Applied a total of 432 rules in 166 ms. Remains 564 /780 variables (removed 216) and now considering 1876/2092 (removed 216) transitions.
Running 1872 sub problems to find dead transitions.
[2024-06-01 15:17:10] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
// Phase 1: matrix 1844 rows 564 cols
[2024-06-01 15:17:10] [INFO ] Computed 54 invariants in 41 ms
[2024-06-01 15:17:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 39 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/38 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD797 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/564 variables, 16/55 constraints. Problems are: Problem set: 185 solved, 1687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/2408 variables, and 55 constraints, problems are : Problem set: 185 solved, 1687 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 1/1 constraints]
After SMT, in 49064ms problems are : Problem set: 185 solved, 1687 unsolved
Search for dead transitions found 185 dead transitions in 49087ms
Found 185 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 185 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 185 transitions.
[2024-06-01 15:17:59] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
// Phase 1: matrix 1659 rows 564 cols
[2024-06-01 15:17:59] [INFO ] Computed 54 invariants in 38 ms
[2024-06-01 15:18:00] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-06-01 15:18:00] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:18:00] [INFO ] Invariant cache hit.
[2024-06-01 15:18:02] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:18:32] [INFO ] Performed 279/564 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:18:56] [INFO ] Implicit Places using invariants and state equation in 55921 ms returned []
Implicit Place search using SMT with State Equation took 56850 ms to find 0 implicit places.
[2024-06-01 15:18:56] [INFO ] Redundant transitions in 125 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 564/780 places, 1691/2092 transitions.
Applied a total of 0 rules in 49 ms. Remains 564 /564 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106294 ms. Remains : 564/780 places, 1691/2092 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-03
Product exploration explored 100000 steps with 3615 reset in 879 ms.
Product exploration explored 100000 steps with 3629 reset in 615 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 112 steps (0 resets) in 6 ms. (16 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 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-06-01 15:18:58] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:18:58] [INFO ] Invariant cache hit.
[2024-06-01 15:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:18:59] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 181 ms returned sat
[2024-06-01 15:19:04] [INFO ] [Real]Absence check using state equation in 5074 ms returned sat
[2024-06-01 15:19:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:19:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 15:19:05] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 114 ms returned sat
[2024-06-01 15:19:09] [INFO ] [Nat]Absence check using state equation in 3163 ms returned sat
[2024-06-01 15:19:09] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:19:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:19:12] [INFO ] [Nat]Added 160 Read/Feed constraints in 3022 ms returned unknown
Could not prove EG (NOT p0)
Support contains 17 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 1691/1691 transitions.
Applied a total of 0 rules in 80 ms. Remains 564 /564 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
Running 1687 sub problems to find dead transitions.
[2024-06-01 15:19:12] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:19:12] [INFO ] Invariant cache hit.
[2024-06-01 15:19:12] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:19:29] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:19:30] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2223 variables, and 47 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 2 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:19:39] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:19:47] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:19:57] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2223 variables, and 57 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1687 constraints, Known Traps: 12/12 constraints]
After SMT, in 45405ms problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 45438ms
[2024-06-01 15:19:57] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:19:57] [INFO ] Invariant cache hit.
[2024-06-01 15:19:58] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-06-01 15:19:58] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:19:58] [INFO ] Invariant cache hit.
[2024-06-01 15:19:59] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:20:30] [INFO ] Performed 242/564 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:20:59] [INFO ] Implicit Places using invariants and state equation in 61174 ms returned []
Implicit Place search using SMT with State Equation took 61820 ms to find 0 implicit places.
[2024-06-01 15:20:59] [INFO ] Redundant transitions in 33 ms returned []
Running 1687 sub problems to find dead transitions.
[2024-06-01 15:20:59] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:20:59] [INFO ] Invariant cache hit.
[2024-06-01 15:20:59] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:21:18] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:21:20] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2223 variables, and 47 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:21:36] [INFO ] Deduced a trap composed of 55 places in 287 ms of which 2 ms to minimize.
[2024-06-01 15:21:36] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:21:36] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:21:36] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:21:36] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:21:36] [INFO ] Deduced a trap composed of 57 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:21:37] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:21:37] [INFO ] Deduced a trap composed of 56 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:21:45] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:21:54] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2223 variables, and 57 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1687 constraints, Known Traps: 12/12 constraints]
After SMT, in 65174ms problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 65190ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172581 ms. Remains : 564/564 places, 1691/1691 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 51 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
RANDOM walk for 118 steps (0 resets) in 9 ms. (11 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 63 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
[2024-06-01 15:22:04] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:22:04] [INFO ] Invariant cache hit.
[2024-06-01 15:22:05] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 15:22:05] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 121 ms returned sat
[2024-06-01 15:22:10] [INFO ] [Real]Absence check using state equation in 4498 ms returned sat
[2024-06-01 15:22:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:22:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:22:11] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 175 ms returned sat
[2024-06-01 15:22:14] [INFO ] [Nat]Absence check using state equation in 3154 ms returned sat
[2024-06-01 15:22:14] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:22:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:22:17] [INFO ] [Nat]Added 160 Read/Feed constraints in 3019 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3610 reset in 817 ms.
Product exploration explored 100000 steps with 3603 reset in 834 ms.
Support contains 17 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 1691/1691 transitions.
Applied a total of 0 rules in 28 ms. Remains 564 /564 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
Running 1687 sub problems to find dead transitions.
[2024-06-01 15:22:19] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:22:19] [INFO ] Invariant cache hit.
[2024-06-01 15:22:19] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:22:37] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:22:38] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2223 variables, and 47 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 55 places in 321 ms of which 4 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 45 places in 272 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 Int declared 560/2223 variables, and 57 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1687 constraints, Known Traps: 12/12 constraints]
After SMT, in 44205ms problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 44219ms
[2024-06-01 15:23:03] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:23:03] [INFO ] Invariant cache hit.
[2024-06-01 15:23:04] [INFO ] Implicit Places using invariants in 797 ms returned []
[2024-06-01 15:23:04] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:23:04] [INFO ] Invariant cache hit.
[2024-06-01 15:23:05] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:23:35] [INFO ] Performed 246/564 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:24:02] [INFO ] Implicit Places using invariants and state equation in 58639 ms returned []
Implicit Place search using SMT with State Equation took 59438 ms to find 0 implicit places.
[2024-06-01 15:24:02] [INFO ] Redundant transitions in 113 ms returned []
Running 1687 sub problems to find dead transitions.
[2024-06-01 15:24:02] [INFO ] Flow matrix only has 1659 transitions (discarded 32 similar events)
[2024-06-01 15:24:02] [INFO ] Invariant cache hit.
[2024-06-01 15:24:02] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:24:20] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:24:21] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
(s436 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.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 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 2.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 2.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 4.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 2.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 2.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 2.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 4.0)
(s129 0.0)
(s130 1.0)
(s131 3.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 2.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 4.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 4.0)
(s188 0.0)
(s189 8.0)
(s190 0.0)
(s191 3.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 4.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 2.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 4.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 4.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 2.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 4.0)
(s279 7.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 2.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 2.0)
(s290 10.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 4.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 3.0)
(s309 1.0)
(s310 2.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 3.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 4.0)
(s355 0.0)
(s356 0.0)
(s357 2.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 4.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 2.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 4.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2223 variables, and 47 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 55 places in 277 ms of which 2 ms to minimize.
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 57 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:24:40] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:24:40] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 15:25:00] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 2 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 560/2223 variables, and 57 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1687 constraints, Known Traps: 12/12 constraints]
After SMT, in 64863ms problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 64878ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 168691 ms. Remains : 564/564 places, 1691/1691 transitions.
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-03 finished in 477539 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(((p1&&X(p2))||p0)))'
Support contains 35 out of 780 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 772 transition count 2084
Applied a total of 16 rules in 86 ms. Remains 772 /780 variables (removed 8) and now considering 2084/2092 (removed 8) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:25:08] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 15:25:08] [INFO ] Computed 54 invariants in 40 ms
[2024-06-01 15:25:08] [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, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 49 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:25:41] [INFO ] Deduced a trap composed of 374 places in 383 ms of which 4 ms to minimize.
[2024-06-01 15:25:42] [INFO ] Deduced a trap composed of 130 places in 387 ms of which 5 ms to minimize.
[2024-06-01 15:25:42] [INFO ] Deduced a trap composed of 187 places in 368 ms of which 4 ms to minimize.
[2024-06-01 15:25:42] [INFO ] Deduced a trap composed of 175 places in 350 ms of which 4 ms to minimize.
[2024-06-01 15:25:45] [INFO ] Deduced a trap composed of 383 places in 383 ms of which 4 ms to minimize.
[2024-06-01 15:25:46] [INFO ] Deduced a trap composed of 375 places in 374 ms of which 5 ms to minimize.
[2024-06-01 15:25:46] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 2 ms to minimize.
[2024-06-01 15:25:46] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:25:47] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:25:53] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(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 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 1)
(s75 1)
(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 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 2)
(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 1)
(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 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 2)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 8)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 2)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 5)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 9)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 4)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 1)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 1)
(s536 0)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s551 0)
(s552 0)
(s553 1)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 1)
(s613 0)
(s614 1)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 1)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 1)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 0)
(s652 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 64 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 15/15 constraints]
After SMT, in 48708ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 48742ms
[2024-06-01 15:25:56] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:25:56] [INFO ] Invariant cache hit.
[2024-06-01 15:25:57] [INFO ] Implicit Places using invariants in 951 ms returned [2, 132, 144, 214, 290, 345, 383, 568]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 966 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 764/780 places, 2084/2092 transitions.
Applied a total of 0 rules in 31 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49835 ms. Remains : 764/780 places, 2084/2092 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-04
Product exploration explored 100000 steps with 7400 reset in 1671 ms.
Product exploration explored 100000 steps with 7398 reset in 1306 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 p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 532 steps (0 resets) in 29 ms. (17 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 299 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-06-01 15:26:01] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2024-06-01 15:26:01] [INFO ] Computed 46 invariants in 47 ms
[2024-06-01 15:26:02] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:26:02] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 67 ms returned sat
[2024-06-01 15:26:04] [INFO ] [Real]Absence check using state equation in 1824 ms returned sat
[2024-06-01 15:26:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:26:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-06-01 15:26:06] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 96 ms returned sat
[2024-06-01 15:26:14] [INFO ] [Nat]Absence check using state equation in 8153 ms returned sat
[2024-06-01 15:26:14] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:26:15] [INFO ] [Nat]Added 160 Read/Feed constraints in 1295 ms returned sat
[2024-06-01 15:26:15] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:26:16] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2007 ms
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 15:26:17] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:26:17] [INFO ] Invariant cache hit.
[2024-06-01 15:26:19] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 15:26:19] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 186 ms returned sat
[2024-06-01 15:26:21] [INFO ] [Real]Absence check using state equation in 2017 ms returned sat
[2024-06-01 15:26:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:26:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:26:22] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 105 ms returned sat
[2024-06-01 15:26:29] [INFO ] [Nat]Absence check using state equation in 6275 ms returned sat
[2024-06-01 15:26:29] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:26:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:26:31] [INFO ] [Nat]Added 160 Read/Feed constraints in 2428 ms returned sat
[2024-06-01 15:26:31] [INFO ] Deduced a trap composed of 82 places in 235 ms of which 4 ms to minimize.
[2024-06-01 15:26:32] [INFO ] Deduced a trap composed of 82 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:26:32] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:26:34] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2484 ms
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 35 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Applied a total of 0 rules in 31 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:26:34] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:26:34] [INFO ] Invariant cache hit.
[2024-06-01 15:26:34] [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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 42 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:27:07] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:27:07] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:27:07] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:27:07] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:27:08] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
[2024-06-01 15:27:08] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:27:08] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:27:08] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:27:09] [INFO ] Deduced a trap composed of 19 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 378 places in 499 ms of which 5 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 374 places in 481 ms of which 4 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 139 places in 396 ms of which 4 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 178 places in 388 ms of which 4 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 81 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:27:16] [INFO ] Deduced a trap composed of 417 places in 433 ms of which 5 ms to minimize.
[2024-06-01 15:27:17] [INFO ] Deduced a trap composed of 482 places in 402 ms of which 4 ms to minimize.
[2024-06-01 15:27:17] [INFO ] Deduced a trap composed of 476 places in 446 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 59 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 17/17 constraints]
After SMT, in 48828ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 48860ms
[2024-06-01 15:27:22] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:27:22] [INFO ] Invariant cache hit.
[2024-06-01 15:27:23] [INFO ] Implicit Places using invariants in 896 ms returned []
[2024-06-01 15:27:23] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:27:23] [INFO ] Invariant cache hit.
[2024-06-01 15:27:24] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:27:55] [INFO ] Performed 519/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:28:05] [INFO ] Implicit Places using invariants and state equation in 41171 ms returned []
Implicit Place search using SMT with State Equation took 42071 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:28:05] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:28:05] [INFO ] Invariant cache hit.
[2024-06-01 15:28:05] [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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:28:32] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:28:32] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:28:32] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:28:33] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:28:33] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:28:33] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:28:33] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:28:33] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:28:34] [INFO ] Deduced a trap composed of 390 places in 518 ms of which 5 ms to minimize.
[2024-06-01 15:28:34] [INFO ] Deduced a trap composed of 386 places in 402 ms of which 4 ms to minimize.
[2024-06-01 15:28:35] [INFO ] Deduced a trap composed of 465 places in 570 ms of which 6 ms to minimize.
[2024-06-01 15:28:35] [INFO ] Deduced a trap composed of 424 places in 458 ms of which 4 ms to minimize.
[2024-06-01 15:28:36] [INFO ] Deduced a trap composed of 474 places in 366 ms of which 4 ms to minimize.
[2024-06-01 15:28:36] [INFO ] Deduced a trap composed of 447 places in 424 ms of which 4 ms to minimize.
[2024-06-01 15:28:37] [INFO ] Deduced a trap composed of 438 places in 410 ms of which 3 ms to minimize.
[2024-06-01 15:28:37] [INFO ] Deduced a trap composed of 430 places in 359 ms of which 3 ms to minimize.
[2024-06-01 15:28:37] [INFO ] Deduced a trap composed of 182 places in 349 ms of which 4 ms to minimize.
[2024-06-01 15:28:38] [INFO ] Deduced a trap composed of 187 places in 368 ms of which 4 ms to minimize.
[2024-06-01 15:28:38] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:28:39] [INFO ] Deduced a trap composed of 221 places in 275 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
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 62 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 20/20 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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:29:12] [INFO ] Deduced a trap composed of 424 places in 481 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 63 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 21/21 constraints]
After SMT, in 68166ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 68197ms
Finished structural reductions in LTL mode , in 1 iterations and 159175 ms. Remains : 764/764 places, 2084/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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 538 steps (0 resets) in 24 ms. (21 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-06-01 15:29:13] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:29:13] [INFO ] Invariant cache hit.
[2024-06-01 15:29:15] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 15:29:15] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 93 ms returned sat
[2024-06-01 15:29:21] [INFO ] [Real]Absence check using state equation in 6364 ms returned sat
[2024-06-01 15:29:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:29:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-06-01 15:29:23] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 495 ms returned sat
[2024-06-01 15:29:30] [INFO ] [Nat]Absence check using state equation in 7244 ms returned sat
[2024-06-01 15:29:30] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:29:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:29:33] [INFO ] [Nat]Added 160 Read/Feed constraints in 2464 ms returned sat
[2024-06-01 15:29:33] [INFO ] Deduced a trap composed of 82 places in 560 ms of which 5 ms to minimize.
[2024-06-01 15:29:34] [INFO ] Deduced a trap composed of 405 places in 463 ms of which 4 ms to minimize.
[2024-06-01 15:29:34] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:29:36] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2997 ms
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 15:29:36] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:29:36] [INFO ] Invariant cache hit.
[2024-06-01 15:29:37] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-06-01 15:29:37] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 109 ms returned sat
[2024-06-01 15:29:39] [INFO ] [Real]Absence check using state equation in 1996 ms returned sat
[2024-06-01 15:29:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:29:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:29:41] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 116 ms returned sat
[2024-06-01 15:29:48] [INFO ] [Nat]Absence check using state equation in 7203 ms returned sat
[2024-06-01 15:29:48] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:29:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:29:51] [INFO ] [Nat]Added 160 Read/Feed constraints in 3060 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 7382 reset in 1327 ms.
Product exploration explored 100000 steps with 7377 reset in 1360 ms.
Support contains 35 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Applied a total of 0 rules in 20 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:29:54] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:29:54] [INFO ] Invariant cache hit.
[2024-06-01 15:29:54] [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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:30:23] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:30:23] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:30:23] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.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)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 45 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 3/3 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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 82 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:30:37] [INFO ] Deduced a trap composed of 431 places in 567 ms of which 5 ms to minimize.
[2024-06-01 15:30:38] [INFO ] Deduced a trap composed of 414 places in 493 ms of which 5 ms to minimize.
[2024-06-01 15:30:38] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 2 ms to minimize.
[2024-06-01 15:30:38] [INFO ] Deduced a trap composed of 397 places in 449 ms of which 4 ms to minimize.
[2024-06-01 15:30:39] [INFO ] Deduced a trap composed of 593 places in 371 ms of which 4 ms to minimize.
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 148 places in 352 ms of which 4 ms to minimize.
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 178 places in 370 ms of which 4 ms to minimize.
[2024-06-01 15:30:42] [INFO ] Deduced a trap composed of 417 places in 477 ms of which 5 ms to minimize.
[2024-06-01 15:30:43] [INFO ] Deduced a trap composed of 381 places in 389 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 59 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 17/17 constraints]
After SMT, in 48816ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 48841ms
[2024-06-01 15:30:43] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:30:43] [INFO ] Invariant cache hit.
[2024-06-01 15:30:44] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-06-01 15:30:44] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:30:44] [INFO ] Invariant cache hit.
[2024-06-01 15:30:45] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:31:15] [INFO ] Performed 487/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:31:28] [INFO ] Implicit Places using invariants and state equation in 44334 ms returned []
Implicit Place search using SMT with State Equation took 45183 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:31:28] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:31:28] [INFO ] Invariant cache hit.
[2024-06-01 15:31:28] [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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:31:58] [INFO ] Deduced a trap composed of 390 places in 492 ms of which 5 ms to minimize.
[2024-06-01 15:31:59] [INFO ] Deduced a trap composed of 386 places in 446 ms of which 4 ms to minimize.
[2024-06-01 15:31:59] [INFO ] Deduced a trap composed of 465 places in 415 ms of which 5 ms to minimize.
[2024-06-01 15:32:00] [INFO ] Deduced a trap composed of 424 places in 408 ms of which 4 ms to minimize.
[2024-06-01 15:32:00] [INFO ] Deduced a trap composed of 474 places in 433 ms of which 4 ms to minimize.
[2024-06-01 15:32:00] [INFO ] Deduced a trap composed of 447 places in 481 ms of which 4 ms to minimize.
[2024-06-01 15:32:01] [INFO ] Deduced a trap composed of 438 places in 448 ms of which 4 ms to minimize.
[2024-06-01 15:32:01] [INFO ] Deduced a trap composed of 430 places in 425 ms of which 4 ms to minimize.
[2024-06-01 15:32:02] [INFO ] Deduced a trap composed of 182 places in 403 ms of which 5 ms to minimize.
[2024-06-01 15:32:02] [INFO ] Deduced a trap composed of 187 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:32:03] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 2 ms to minimize.
[2024-06-01 15:32:04] [INFO ] Deduced a trap composed of 221 places in 306 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
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 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 10.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 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 62 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 20/20 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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:32:37] [INFO ] Deduced a trap composed of 424 places in 479 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 63 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 21/21 constraints]
After SMT, in 69026ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 69045ms
Finished structural reductions in LTL mode , in 1 iterations and 163100 ms. Remains : 764/764 places, 2084/2084 transitions.
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-04 finished in 449769 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 24 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 780 transition count 2036
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 724 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 112 place count 724 transition count 1940
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 304 place count 628 transition count 1940
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 464 place count 548 transition count 1860
Applied a total of 464 rules in 125 ms. Remains 548 /780 variables (removed 232) and now considering 1860/2092 (removed 232) transitions.
Running 1856 sub problems to find dead transitions.
[2024-06-01 15:32:37] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
// Phase 1: matrix 1828 rows 548 cols
[2024-06-01 15:32:37] [INFO ] Computed 54 invariants in 36 ms
[2024-06-01 15:32:37] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-06-01 15:33:00] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:33:00] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:33:00] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:33:00] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:33:00] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:33:01] [INFO ] Deduced a trap composed of 53 places in 347 ms of which 4 ms to minimize.
[2024-06-01 15:33:01] [INFO ] Deduced a trap composed of 54 places in 314 ms of which 3 ms to minimize.
[2024-06-01 15:33:01] [INFO ] Deduced a trap composed of 214 places in 309 ms of which 3 ms to minimize.
[2024-06-01 15:33:02] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 3 ms to minimize.
[2024-06-01 15:33:02] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:33:02] [INFO ] Deduced a trap composed of 174 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:33:04] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:33:05] [INFO ] Deduced a trap composed of 74 places in 414 ms of which 4 ms to minimize.
[2024-06-01 15:33:05] [INFO ] Deduced a trap composed of 77 places in 330 ms of which 4 ms to minimize.
[2024-06-01 15:33:06] [INFO ] Deduced a trap composed of 212 places in 307 ms of which 3 ms to minimize.
[2024-06-01 15:33:06] [INFO ] Deduced a trap composed of 201 places in 278 ms of which 2 ms to minimize.
[2024-06-01 15:33:07] [INFO ] Deduced a trap composed of 299 places in 269 ms of which 3 ms to minimize.
[2024-06-01 15:33:07] [INFO ] Deduced a trap composed of 222 places in 277 ms of which 3 ms to minimize.
SMT process timed out in 29480ms, After SMT, problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 29502ms
[2024-06-01 15:33:07] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
[2024-06-01 15:33:07] [INFO ] Invariant cache hit.
[2024-06-01 15:33:07] [INFO ] Implicit Places using invariants in 531 ms returned [2, 91, 102, 150, 203, 240, 268, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 535 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/780 places, 1860/2092 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 533 transition count 1853
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 533 transition count 1853
Applied a total of 14 rules in 40 ms. Remains 533 /540 variables (removed 7) and now considering 1853/1860 (removed 7) transitions.
[2024-06-01 15:33:07] [INFO ] Flow matrix only has 1821 transitions (discarded 32 similar events)
// Phase 1: matrix 1821 rows 533 cols
[2024-06-01 15:33:07] [INFO ] Computed 46 invariants in 23 ms
[2024-06-01 15:33:08] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-06-01 15:33:08] [INFO ] Flow matrix only has 1821 transitions (discarded 32 similar events)
[2024-06-01 15:33:08] [INFO ] Invariant cache hit.
[2024-06-01 15:33:09] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:33:35] [INFO ] Implicit Places using invariants and state equation in 26798 ms returned []
Implicit Place search using SMT with State Equation took 27486 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 533/780 places, 1853/2092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57693 ms. Remains : 533/780 places, 1853/2092 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-05
Stuttering criterion allowed to conclude after 664 steps with 3 reset in 8 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-05 finished in 57854 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(X(F(p0)))))'
Support contains 9 out of 780 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 772 transition count 2084
Applied a total of 16 rules in 33 ms. Remains 772 /780 variables (removed 8) and now considering 2084/2092 (removed 8) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:33:35] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 15:33:35] [INFO ] Computed 54 invariants in 46 ms
[2024-06-01 15:33: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, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
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 768/2824 variables, and 49 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 374 places in 324 ms of which 6 ms to minimize.
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 130 places in 341 ms of which 4 ms to minimize.
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 187 places in 351 ms of which 5 ms to minimize.
[2024-06-01 15:34:11] [INFO ] Deduced a trap composed of 175 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 383 places in 390 ms of which 5 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 375 places in 345 ms of which 4 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:34:15] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:34:19] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:34:19] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 64 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 15/15 constraints]
After SMT, in 49803ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49824ms
[2024-06-01 15:34:25] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:34:25] [INFO ] Invariant cache hit.
[2024-06-01 15:34:26] [INFO ] Implicit Places using invariants in 779 ms returned [2, 132, 144, 214, 290, 345, 383, 568]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 791 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 764/780 places, 2084/2092 transitions.
Applied a total of 0 rules in 11 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50668 ms. Remains : 764/780 places, 2084/2092 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-06
Product exploration explored 100000 steps with 2061 reset in 540 ms.
Product exploration explored 100000 steps with 2066 reset in 559 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 203 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 15:34:27] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2024-06-01 15:34:28] [INFO ] Computed 46 invariants in 36 ms
[2024-06-01 15:34:29] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:34:29] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 49 ms returned sat
[2024-06-01 15:34:30] [INFO ] [Real]Absence check using state equation in 1856 ms returned sat
[2024-06-01 15:34:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:34:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 44 ms returned sat
[2024-06-01 15:34:32] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 100 ms returned sat
[2024-06-01 15:34:35] [INFO ] [Nat]Absence check using state equation in 3732 ms returned sat
[2024-06-01 15:34:35] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:34:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:34:37] [INFO ] [Nat]Added 160 Read/Feed constraints in 2013 ms returned sat
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 49 places in 430 ms of which 4 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3900 ms
[2024-06-01 15:34:42] [INFO ] Computed and/alt/rep : 1456/6179/1432 causal constraints (skipped 616 transitions) in 191 ms.
[2024-06-01 15:34:46] [INFO ] Added : 85 causal constraints over 17 iterations in 4180 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 9 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Applied a total of 0 rules in 23 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:34:46] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:34:46] [INFO ] Invariant cache hit.
[2024-06-01 15:34:46] [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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
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 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 (/ 1.0 3.0))
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 (/ 3.0 4.0))
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 (/ 1.0 3.0))
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 9.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 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 42 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:35:19] [INFO ] Deduced a trap composed of 82 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:35:20] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:35:20] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:35:20] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:35:20] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:35:20] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:35:20] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:35:20] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:35:21] [INFO ] Deduced a trap composed of 19 places in 330 ms of which 4 ms to minimize.
[2024-06-01 15:35:22] [INFO ] Deduced a trap composed of 378 places in 496 ms of which 5 ms to minimize.
[2024-06-01 15:35:22] [INFO ] Deduced a trap composed of 374 places in 404 ms of which 5 ms to minimize.
[2024-06-01 15:35:23] [INFO ] Deduced a trap composed of 139 places in 520 ms of which 5 ms to minimize.
[2024-06-01 15:35:24] [INFO ] Deduced a trap composed of 178 places in 439 ms of which 4 ms to minimize.
[2024-06-01 15:35:24] [INFO ] Deduced a trap composed of 81 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:35:29] [INFO ] Deduced a trap composed of 417 places in 499 ms of which 5 ms to minimize.
[2024-06-01 15:35:31] [INFO ] Deduced a trap composed of 482 places in 477 ms of which 5 ms to minimize.
[2024-06-01 15:35:31] [INFO ] Deduced a trap composed of 476 places in 414 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 59 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 17/17 constraints]
After SMT, in 49001ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49029ms
[2024-06-01 15:35:35] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:35:35] [INFO ] Invariant cache hit.
[2024-06-01 15:35:35] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-06-01 15:35:35] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:35:35] [INFO ] Invariant cache hit.
[2024-06-01 15:35:36] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:36:07] [INFO ] Performed 606/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:36:14] [INFO ] Implicit Places using invariants and state equation in 38710 ms returned []
Implicit Place search using SMT with State Equation took 39499 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:36:14] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:36:14] [INFO ] Invariant cache hit.
[2024-06-01 15:36:14] [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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 82 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 390 places in 362 ms of which 3 ms to minimize.
[2024-06-01 15:36:45] [INFO ] Deduced a trap composed of 386 places in 335 ms of which 3 ms to minimize.
[2024-06-01 15:36:45] [INFO ] Deduced a trap composed of 465 places in 434 ms of which 3 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 424 places in 393 ms of which 3 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 474 places in 366 ms of which 3 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 447 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 438 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 430 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 182 places in 377 ms of which 5 ms to minimize.
[2024-06-01 15:36:48] [INFO ] Deduced a trap composed of 187 places in 323 ms of which 4 ms to minimize.
[2024-06-01 15:36:48] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 221 places in 274 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 62 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 20/20 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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:37:22] [INFO ] Deduced a trap composed of 424 places in 472 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 63 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 21/21 constraints]
After SMT, in 68971ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 68991ms
Finished structural reductions in LTL mode , in 1 iterations and 157553 ms. Remains : 764/764 places, 2084/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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 214 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 15:37:24] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:37:24] [INFO ] Invariant cache hit.
[2024-06-01 15:37:25] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:37:25] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 65 ms returned sat
[2024-06-01 15:37:26] [INFO ] [Real]Absence check using state equation in 1622 ms returned sat
[2024-06-01 15:37:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:37:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:37:28] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 176 ms returned sat
[2024-06-01 15:37:34] [INFO ] [Nat]Absence check using state equation in 6359 ms returned sat
[2024-06-01 15:37:34] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:37:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:37:36] [INFO ] [Nat]Added 160 Read/Feed constraints in 2153 ms returned sat
[2024-06-01 15:37:36] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:37:37] [INFO ] Deduced a trap composed of 82 places in 389 ms of which 5 ms to minimize.
[2024-06-01 15:37:38] [INFO ] Deduced a trap composed of 49 places in 448 ms of which 4 ms to minimize.
[2024-06-01 15:37:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1772 ms
[2024-06-01 15:37:38] [INFO ] Computed and/alt/rep : 1456/6179/1432 causal constraints (skipped 616 transitions) in 159 ms.
[2024-06-01 15:37:41] [INFO ] Added : 80 causal constraints over 16 iterations in 3384 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2094 reset in 533 ms.
Product exploration explored 100000 steps with 2066 reset in 549 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 764 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 764 transition count 2084
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 50 place count 764 transition count 2148
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 96 place count 764 transition count 2148
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 112 place count 748 transition count 2132
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 128 place count 748 transition count 2132
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 2 ms
Iterating global reduction 1 with 136 rules applied. Total rules applied 264 place count 748 transition count 2132
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 295 place count 717 transition count 2101
Deduced a syphon composed of 192 places in 2 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 326 place count 717 transition count 2101
Deduced a syphon composed of 192 places in 1 ms
Applied a total of 326 rules in 224 ms. Remains 717 /764 variables (removed 47) and now considering 2101/2084 (removed -17) transitions.
Running 2097 sub problems to find dead transitions.
[2024-06-01 15:37:43] [INFO ] Flow matrix only has 2069 transitions (discarded 32 similar events)
// Phase 1: matrix 2069 rows 717 cols
[2024-06-01 15:37:43] [INFO ] Computed 46 invariants in 28 ms
[2024-06-01 15:37:43] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/713 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/713 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
[2024-06-01 15:38:11] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:38:12] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:38:12] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 15:38:13] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-06-01 15:38:13] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 713/2786 variables, and 42 constraints, problems are : Problem set: 3 solved, 2094 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/717 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2097/2097 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2094 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 2094 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 14/30 constraints. Problems are: Problem set: 3 solved, 2094 unsolved
Problem TDEAD25 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1241 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/710 variables, 5/35 constraints. Problems are: Problem set: 11 solved, 2086 unsolved
[2024-06-01 15:38:16] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD648 is UNSAT
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
Problem TDEAD735 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1100 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 710/2786 variables, and 37 constraints, problems are : Problem set: 26 solved, 2071 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 14/27 constraints, State Equation: 0/717 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/2097 constraints, Known Traps: 7/7 constraints]
After SMT, in 49602ms problems are : Problem set: 26 solved, 2071 unsolved
Search for dead transitions found 26 dead transitions in 49626ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 26 transitions.
[2024-06-01 15:38:33] [INFO ] Redundant transitions in 67 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 717/764 places, 2075/2084 transitions.
Graph (complete) has 4441 edges and 717 vertex of which 691 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.5 ms
Discarding 26 places :
Also discarding 0 output transitions
Deduced a syphon composed of 166 places in 1 ms
Applied a total of 1 rules in 43 ms. Remains 691 /717 variables (removed 26) and now considering 2075/2075 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 691/764 places, 2075/2084 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49980 ms. Remains : 691/764 places, 2075/2084 transitions.
Support contains 9 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Applied a total of 0 rules in 27 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:38:33] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2024-06-01 15:38:33] [INFO ] Computed 46 invariants in 47 ms
[2024-06-01 15:38:33] [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 28810ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 28837ms
[2024-06-01 15:39:02] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:39:02] [INFO ] Invariant cache hit.
[2024-06-01 15:39:03] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-06-01 15:39:03] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:39:03] [INFO ] Invariant cache hit.
[2024-06-01 15:39:04] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:39:34] [INFO ] Performed 621/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:39:41] [INFO ] Implicit Places using invariants and state equation in 37805 ms returned []
Implicit Place search using SMT with State Equation took 38696 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:39:41] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:39:41] [INFO ] Invariant cache hit.
[2024-06-01 15:39:41] [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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:40:09] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:40:09] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:40:09] [INFO ] Deduced a trap composed of 83 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:40:09] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:40:09] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:40:10] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:40:10] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:40:10] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:40:10] [INFO ] Deduced a trap composed of 390 places in 461 ms of which 6 ms to minimize.
[2024-06-01 15:40:11] [INFO ] Deduced a trap composed of 386 places in 400 ms of which 15 ms to minimize.
[2024-06-01 15:40:11] [INFO ] Deduced a trap composed of 465 places in 497 ms of which 6 ms to minimize.
[2024-06-01 15:40:12] [INFO ] Deduced a trap composed of 424 places in 410 ms of which 4 ms to minimize.
[2024-06-01 15:40:12] [INFO ] Deduced a trap composed of 474 places in 474 ms of which 4 ms to minimize.
[2024-06-01 15:40:13] [INFO ] Deduced a trap composed of 447 places in 390 ms of which 3 ms to minimize.
[2024-06-01 15:40:13] [INFO ] Deduced a trap composed of 438 places in 386 ms of which 5 ms to minimize.
[2024-06-01 15:40:14] [INFO ] Deduced a trap composed of 430 places in 439 ms of which 4 ms to minimize.
[2024-06-01 15:40:14] [INFO ] Deduced a trap composed of 182 places in 425 ms of which 4 ms to minimize.
[2024-06-01 15:40:14] [INFO ] Deduced a trap composed of 187 places in 357 ms of which 4 ms to minimize.
[2024-06-01 15:40:15] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 221 places in 275 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
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 62 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 20/20 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, 26/42 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:40:49] [INFO ] Deduced a trap composed of 424 places in 452 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 63 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 21/21 constraints]
After SMT, in 68901ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 68933ms
Finished structural reductions in LTL mode , in 1 iterations and 136508 ms. Remains : 764/764 places, 2084/2084 transitions.
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-06 finished in 434567 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' '!(G(F(p0)))'
Support contains 4 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 780 transition count 2036
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 724 transition count 2036
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 112 place count 724 transition count 1941
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 302 place count 629 transition count 1941
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 476 place count 542 transition count 1854
Applied a total of 476 rules in 110 ms. Remains 542 /780 variables (removed 238) and now considering 1854/2092 (removed 238) transitions.
Running 1850 sub problems to find dead transitions.
[2024-06-01 15:40:50] [INFO ] Flow matrix only has 1822 transitions (discarded 32 similar events)
// Phase 1: matrix 1822 rows 542 cols
[2024-06-01 15:40:50] [INFO ] Computed 54 invariants in 50 ms
[2024-06-01 15:40:50] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 30/49 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
[2024-06-01 15:41:16] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2024-06-01 15:41:18] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.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 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.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 1.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 2.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 4.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 3.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 2.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 4.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 6.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 2.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 2.0)
(s278 9.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 2.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 3.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 2.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 1.0)
(s445 0.0)
(s446 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/2364 variables, and 51 constraints, problems are : Problem set: 0 solved, 1850 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 30/35 constraints, State Equation: 0/542 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1850/1850 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 30/49 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 175 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:41:33] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:41:34] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 4 ms to minimize.
[2024-06-01 15:41:34] [INFO ] Deduced a trap composed of 71 places in 258 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/2364 variables, and 60 constraints, problems are : Problem set: 0 solved, 1850 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 30/35 constraints, State Equation: 0/542 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1850 constraints, Known Traps: 11/11 constraints]
After SMT, in 49216ms problems are : Problem set: 0 solved, 1850 unsolved
Search for dead transitions found 0 dead transitions in 49237ms
[2024-06-01 15:41:39] [INFO ] Flow matrix only has 1822 transitions (discarded 32 similar events)
[2024-06-01 15:41:39] [INFO ] Invariant cache hit.
[2024-06-01 15:41:40] [INFO ] Implicit Places using invariants in 777 ms returned [2, 90, 101, 148, 202, 238, 265, 399]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 783 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 534/780 places, 1854/2092 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 527 transition count 1847
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 527 transition count 1847
Applied a total of 14 rules in 50 ms. Remains 527 /534 variables (removed 7) and now considering 1847/1854 (removed 7) transitions.
[2024-06-01 15:41:40] [INFO ] Flow matrix only has 1815 transitions (discarded 32 similar events)
// Phase 1: matrix 1815 rows 527 cols
[2024-06-01 15:41:40] [INFO ] Computed 46 invariants in 43 ms
[2024-06-01 15:41:41] [INFO ] Implicit Places using invariants in 829 ms returned []
[2024-06-01 15:41:41] [INFO ] Flow matrix only has 1815 transitions (discarded 32 similar events)
[2024-06-01 15:41:41] [INFO ] Invariant cache hit.
[2024-06-01 15:41:42] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:42:04] [INFO ] Implicit Places using invariants and state equation in 23260 ms returned []
Implicit Place search using SMT with State Equation took 24090 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 527/780 places, 1847/2092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74276 ms. Remains : 527/780 places, 1847/2092 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-08
Stuttering criterion allowed to conclude after 49884 steps with 169 reset in 371 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-08 finished in 74755 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' '!(G((F(G(p0))&&(F(G(p1)) U p1))))'
Support contains 3 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 780 transition count 2037
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 111 place count 725 transition count 2036
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 724 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 112 place count 724 transition count 1940
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 304 place count 628 transition count 1940
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 476 place count 542 transition count 1854
Applied a total of 476 rules in 144 ms. Remains 542 /780 variables (removed 238) and now considering 1854/2092 (removed 238) transitions.
Running 1850 sub problems to find dead transitions.
[2024-06-01 15:42:05] [INFO ] Flow matrix only has 1822 transitions (discarded 32 similar events)
// Phase 1: matrix 1822 rows 542 cols
[2024-06-01 15:42:05] [INFO ] Computed 54 invariants in 35 ms
[2024-06-01 15:42:05] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:42:28] [INFO ] Deduced a trap composed of 34 places in 148 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 538/2364 variables, and 47 constraints, problems are : Problem set: 0 solved, 1850 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 30/38 constraints, State Equation: 0/542 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1850/1850 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
[2024-06-01 15:42:37] [INFO ] Deduced a trap composed of 53 places in 300 ms of which 2 ms to minimize.
[2024-06-01 15:42:37] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:42:37] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:42:37] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:42:37] [INFO ] Deduced a trap composed of 45 places in 305 ms of which 4 ms to minimize.
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 3 ms to minimize.
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 186 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:42:40] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:42:40] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:42:43] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:42:45] [INFO ] Deduced a trap composed of 73 places in 395 ms of which 4 ms to minimize.
[2024-06-01 15:42:46] [INFO ] Deduced a trap composed of 73 places in 336 ms of which 4 ms to minimize.
[2024-06-01 15:42:46] [INFO ] Deduced a trap composed of 73 places in 297 ms of which 3 ms to minimize.
[2024-06-01 15:42:46] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:42:47] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:42:47] [INFO ] Deduced a trap composed of 77 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:42:47] [INFO ] Deduced a trap composed of 73 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:42:47] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:42:47] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(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 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(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 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 3)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 10)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(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 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 3)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 4)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 6)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 1)
(s277 10)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 3)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s450 0)
(s451 1)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/2364 variables, and 67 constraints, problems are : Problem set: 0 solved, 1850 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 30/38 constraints, State Equation: 0/542 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1850 constraints, Known Traps: 22/22 constraints]
After SMT, in 49213ms problems are : Problem set: 0 solved, 1850 unsolved
Search for dead transitions found 0 dead transitions in 49234ms
[2024-06-01 15:42:54] [INFO ] Flow matrix only has 1822 transitions (discarded 32 similar events)
[2024-06-01 15:42:54] [INFO ] Invariant cache hit.
[2024-06-01 15:42:54] [INFO ] Implicit Places using invariants in 752 ms returned [2, 89, 100, 147, 200, 237, 264, 398]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 761 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 534/780 places, 1854/2092 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 527 transition count 1847
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 527 transition count 1847
Applied a total of 14 rules in 65 ms. Remains 527 /534 variables (removed 7) and now considering 1847/1854 (removed 7) transitions.
[2024-06-01 15:42:55] [INFO ] Flow matrix only has 1815 transitions (discarded 32 similar events)
// Phase 1: matrix 1815 rows 527 cols
[2024-06-01 15:42:55] [INFO ] Computed 46 invariants in 58 ms
[2024-06-01 15:42:55] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-06-01 15:42:55] [INFO ] Flow matrix only has 1815 transitions (discarded 32 similar events)
[2024-06-01 15:42:55] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:43:16] [INFO ] Implicit Places using invariants and state equation in 20465 ms returned []
Implicit Place search using SMT with State Equation took 21317 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 527/780 places, 1847/2092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71526 ms. Remains : 527/780 places, 1847/2092 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-09
Stuttering criterion allowed to conclude after 23299 steps with 0 reset in 169 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-09 finished in 71848 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' '!(G(F(p0)))'
Support contains 3 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 780 transition count 2052
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 740 transition count 2044
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 732 transition count 2044
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 96 place count 732 transition count 1940
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 304 place count 628 transition count 1940
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 432 place count 564 transition count 1876
Applied a total of 432 rules in 177 ms. Remains 564 /780 variables (removed 216) and now considering 1876/2092 (removed 216) transitions.
Running 1872 sub problems to find dead transitions.
[2024-06-01 15:43:16] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
// Phase 1: matrix 1844 rows 564 cols
[2024-06-01 15:43:16] [INFO ] Computed 54 invariants in 54 ms
[2024-06-01 15:43:16] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 15:43:38] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 39 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/38 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/564 variables, 16/55 constraints. Problems are: Problem set: 83 solved, 1789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/2408 variables, and 55 constraints, problems are : Problem set: 83 solved, 1789 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 1/1 constraints]
After SMT, in 48808ms problems are : Problem set: 83 solved, 1789 unsolved
Search for dead transitions found 83 dead transitions in 48834ms
Found 83 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 83 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 83 transitions.
[2024-06-01 15:44:05] [INFO ] Flow matrix only has 1761 transitions (discarded 32 similar events)
// Phase 1: matrix 1761 rows 564 cols
[2024-06-01 15:44:05] [INFO ] Computed 54 invariants in 21 ms
[2024-06-01 15:44:06] [INFO ] Implicit Places using invariants in 701 ms returned [2, 94, 106, 154, 211, 248, 277, 415]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 705 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/780 places, 1793/2092 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 549 transition count 1786
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 549 transition count 1786
Applied a total of 14 rules in 35 ms. Remains 549 /556 variables (removed 7) and now considering 1786/1793 (removed 7) transitions.
[2024-06-01 15:44:06] [INFO ] Flow matrix only has 1754 transitions (discarded 32 similar events)
// Phase 1: matrix 1754 rows 549 cols
[2024-06-01 15:44:06] [INFO ] Computed 46 invariants in 24 ms
[2024-06-01 15:44:06] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 15:44:06] [INFO ] Flow matrix only has 1754 transitions (discarded 32 similar events)
[2024-06-01 15:44:06] [INFO ] Invariant cache hit.
[2024-06-01 15:44:08] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:44:38] [INFO ] Performed 499/549 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:44:40] [INFO ] Implicit Places using invariants and state equation in 33512 ms returned []
Implicit Place search using SMT with State Equation took 34037 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 549/780 places, 1786/2092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83796 ms. Remains : 549/780 places, 1786/2092 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-10
Stuttering criterion allowed to conclude after 15355 steps with 6 reset in 112 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-10 finished in 84027 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' '!(G((p0||G(p1))))'
Support contains 3 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 780 transition count 2036
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 724 transition count 2036
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 112 place count 724 transition count 1942
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 300 place count 630 transition count 1942
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 476 place count 542 transition count 1854
Applied a total of 476 rules in 142 ms. Remains 542 /780 variables (removed 238) and now considering 1854/2092 (removed 238) transitions.
Running 1850 sub problems to find dead transitions.
[2024-06-01 15:44:40] [INFO ] Flow matrix only has 1822 transitions (discarded 32 similar events)
// Phase 1: matrix 1822 rows 542 cols
[2024-06-01 15:44:40] [INFO ] Computed 54 invariants in 61 ms
[2024-06-01 15:44:40] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/2364 variables, and 38 constraints, problems are : Problem set: 0 solved, 1850 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/38 constraints, State Equation: 0/542 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1850/1850 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD315 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/539 variables, 1/39 constraints. Problems are: Problem set: 9 solved, 1841 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/2364 variables, and 39 constraints, problems are : Problem set: 9 solved, 1841 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/38 constraints, State Equation: 0/542 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1850 constraints, Known Traps: 2/2 constraints]
After SMT, in 48604ms problems are : Problem set: 9 solved, 1841 unsolved
Search for dead transitions found 9 dead transitions in 48627ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
[2024-06-01 15:45:29] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
// Phase 1: matrix 1813 rows 542 cols
[2024-06-01 15:45:29] [INFO ] Computed 54 invariants in 43 ms
[2024-06-01 15:45:30] [INFO ] Implicit Places using invariants in 869 ms returned [2, 89, 100, 147, 200, 237, 264, 399]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 878 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 534/780 places, 1845/2092 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 527 transition count 1838
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 527 transition count 1838
Applied a total of 14 rules in 70 ms. Remains 527 /534 variables (removed 7) and now considering 1838/1845 (removed 7) transitions.
[2024-06-01 15:45:30] [INFO ] Flow matrix only has 1806 transitions (discarded 32 similar events)
// Phase 1: matrix 1806 rows 527 cols
[2024-06-01 15:45:30] [INFO ] Computed 46 invariants in 38 ms
[2024-06-01 15:45:31] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-06-01 15:45:31] [INFO ] Flow matrix only has 1806 transitions (discarded 32 similar events)
[2024-06-01 15:45:31] [INFO ] Invariant cache hit.
[2024-06-01 15:45:32] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:46:03] [INFO ] Performed 421/527 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:46:07] [INFO ] Implicit Places using invariants and state equation in 36519 ms returned []
Implicit Place search using SMT with State Equation took 37390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 527/780 places, 1838/2092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87114 ms. Remains : 527/780 places, 1838/2092 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1032 steps with 0 reset in 13 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-13 finished in 87259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(X(!p1) U ((!p0&&X(!p1))||X(G(!p1))))))'
Support contains 4 out of 780 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 772 transition count 2084
Applied a total of 16 rules in 41 ms. Remains 772 /780 variables (removed 8) and now considering 2084/2092 (removed 8) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:46:08] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 15:46:08] [INFO ] Computed 54 invariants in 80 ms
[2024-06-01 15:46:08] [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, 2080 unsolved
SMT process timed out in 28678ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 28704ms
[2024-06-01 15:46:36] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:46:36] [INFO ] Invariant cache hit.
[2024-06-01 15:46:37] [INFO ] Implicit Places using invariants in 755 ms returned [2, 132, 144, 214, 290, 345, 383, 568]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 759 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 764/780 places, 2084/2092 transitions.
Applied a total of 0 rules in 11 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29523 ms. Remains : 764/780 places, 2084/2092 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, true]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-14
Stuttering criterion allowed to conclude after 43696 steps with 80 reset in 183 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-14 finished in 29877 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)&&G(F((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 780 transition count 2038
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 726 transition count 2038
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 108 place count 726 transition count 1942
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 300 place count 630 transition count 1942
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 474 place count 543 transition count 1855
Applied a total of 474 rules in 77 ms. Remains 543 /780 variables (removed 237) and now considering 1855/2092 (removed 237) transitions.
Running 1851 sub problems to find dead transitions.
[2024-06-01 15:46:37] [INFO ] Flow matrix only has 1823 transitions (discarded 32 similar events)
// Phase 1: matrix 1823 rows 543 cols
[2024-06-01 15:46:38] [INFO ] Computed 54 invariants in 54 ms
[2024-06-01 15:46:38] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 1851 unsolved
[2024-06-01 15:46:59] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:47:00] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/2366 variables, and 47 constraints, problems are : Problem set: 0 solved, 1851 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/543 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1851/1851 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 1851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1851 unsolved
[2024-06-01 15:47:08] [INFO ] Deduced a trap composed of 56 places in 337 ms of which 3 ms to minimize.
[2024-06-01 15:47:08] [INFO ] Deduced a trap composed of 52 places in 360 ms of which 3 ms to minimize.
[2024-06-01 15:47:08] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:47:08] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:47:09] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:47:12] [INFO ] Deduced a trap composed of 52 places in 281 ms of which 2 ms to minimize.
[2024-06-01 15:47:12] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 2 ms to minimize.
[2024-06-01 15:47:12] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:47:13] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/2366 variables, and 56 constraints, problems are : Problem set: 0 solved, 1851 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/543 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1851 constraints, Known Traps: 11/11 constraints]
After SMT, in 48496ms problems are : Problem set: 0 solved, 1851 unsolved
Search for dead transitions found 0 dead transitions in 48513ms
[2024-06-01 15:47:26] [INFO ] Flow matrix only has 1823 transitions (discarded 32 similar events)
[2024-06-01 15:47:26] [INFO ] Invariant cache hit.
[2024-06-01 15:47:27] [INFO ] Implicit Places using invariants in 816 ms returned [2, 89, 100, 147, 200, 237, 265, 399]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 823 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 535/780 places, 1855/2092 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 528 transition count 1848
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 528 transition count 1848
Applied a total of 14 rules in 42 ms. Remains 528 /535 variables (removed 7) and now considering 1848/1855 (removed 7) transitions.
[2024-06-01 15:47:27] [INFO ] Flow matrix only has 1816 transitions (discarded 32 similar events)
// Phase 1: matrix 1816 rows 528 cols
[2024-06-01 15:47:27] [INFO ] Computed 46 invariants in 25 ms
[2024-06-01 15:47:28] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-06-01 15:47:28] [INFO ] Flow matrix only has 1816 transitions (discarded 32 similar events)
[2024-06-01 15:47:28] [INFO ] Invariant cache hit.
[2024-06-01 15:47:28] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:47:51] [INFO ] Implicit Places using invariants and state equation in 23345 ms returned []
Implicit Place search using SMT with State Equation took 24133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 528/780 places, 1848/2092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 73592 ms. Remains : 528/780 places, 1848/2092 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-15
Stuttering criterion allowed to conclude after 35127 steps with 36 reset in 252 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLFireability-15 finished in 74025 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))'
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(((p1&&X(p2))||p0)))'
Found a Shortening insensitive property : PolyORBLF-PT-S04J06T08-LTLFireability-04
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 35 out of 780 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 780 transition count 2036
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 724 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 112 place count 724 transition count 1940
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 304 place count 628 transition count 1940
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 384 place count 588 transition count 1900
Applied a total of 384 rules in 112 ms. Remains 588 /780 variables (removed 192) and now considering 1900/2092 (removed 192) transitions.
Running 1896 sub problems to find dead transitions.
[2024-06-01 15:47:52] [INFO ] Flow matrix only has 1868 transitions (discarded 32 similar events)
// Phase 1: matrix 1868 rows 588 cols
[2024-06-01 15:47:52] [INFO ] Computed 54 invariants in 28 ms
[2024-06-01 15:47:52] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
[2024-06-01 15:48:14] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:48:16] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/2456 variables, and 47 constraints, problems are : Problem set: 0 solved, 1896 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/35 constraints, State Equation: 0/588 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1896/1896 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1896 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1896 unsolved
[2024-06-01 15:48:23] [INFO ] Deduced a trap composed of 58 places in 322 ms of which 3 ms to minimize.
[2024-06-01 15:48:23] [INFO ] Deduced a trap composed of 58 places in 276 ms of which 2 ms to minimize.
[2024-06-01 15:48:23] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:48:24] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:48:24] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:48:24] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:48:24] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:48:24] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:48:25] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 3 ms to minimize.
[2024-06-01 15:48:26] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:48:26] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:48:30] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/2456 variables, and 59 constraints, problems are : Problem set: 0 solved, 1896 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/35 constraints, State Equation: 0/588 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1896 constraints, Known Traps: 14/14 constraints]
After SMT, in 48490ms problems are : Problem set: 0 solved, 1896 unsolved
Search for dead transitions found 0 dead transitions in 48510ms
[2024-06-01 15:48:40] [INFO ] Flow matrix only has 1868 transitions (discarded 32 similar events)
[2024-06-01 15:48:40] [INFO ] Invariant cache hit.
[2024-06-01 15:48:41] [INFO ] Implicit Places using invariants in 761 ms returned [2, 98, 110, 160, 220, 262, 291, 431]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 766 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 580/780 places, 1900/2092 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 573 transition count 1893
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 573 transition count 1893
Applied a total of 14 rules in 37 ms. Remains 573 /580 variables (removed 7) and now considering 1893/1900 (removed 7) transitions.
[2024-06-01 15:48:41] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
// Phase 1: matrix 1861 rows 573 cols
[2024-06-01 15:48:41] [INFO ] Computed 46 invariants in 31 ms
[2024-06-01 15:48:42] [INFO ] Implicit Places using invariants in 753 ms returned []
[2024-06-01 15:48:42] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:48:42] [INFO ] Invariant cache hit.
[2024-06-01 15:48:43] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:49:13] [INFO ] Performed 505/573 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:49:16] [INFO ] Implicit Places using invariants and state equation in 34094 ms returned []
Implicit Place search using SMT with State Equation took 34847 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 573/780 places, 1893/2092 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 84277 ms. Remains : 573/780 places, 1893/2092 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLFireability-04
Product exploration explored 100000 steps with 7395 reset in 1314 ms.
Product exploration explored 100000 steps with 7360 reset in 1471 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 p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 400 steps (0 resets) in 13 ms. (28 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-06-01 15:49:19] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:49:19] [INFO ] Invariant cache hit.
[2024-06-01 15:49:20] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:49:21] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 118 ms returned sat
[2024-06-01 15:49:22] [INFO ] [Real]Absence check using state equation in 1848 ms returned sat
[2024-06-01 15:49:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:49:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 15:49:24] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 551 ms returned sat
[2024-06-01 15:49:29] [INFO ] [Nat]Absence check using state equation in 5038 ms returned sat
[2024-06-01 15:49:29] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:49:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:49:32] [INFO ] [Nat]Added 160 Read/Feed constraints in 2598 ms returned sat
[2024-06-01 15:49:32] [INFO ] Deduced a trap composed of 58 places in 410 ms of which 3 ms to minimize.
[2024-06-01 15:49:33] [INFO ] Deduced a trap composed of 58 places in 464 ms of which 4 ms to minimize.
[2024-06-01 15:49:35] [INFO ] Deduced a trap composed of 59 places in 457 ms of which 4 ms to minimize.
[2024-06-01 15:49:35] [INFO ] Deduced a trap composed of 58 places in 385 ms of which 3 ms to minimize.
[2024-06-01 15:49:36] [INFO ] Deduced a trap composed of 279 places in 468 ms of which 4 ms to minimize.
[2024-06-01 15:49:37] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:49:38] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 5750 ms
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 15:49:38] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:49:38] [INFO ] Invariant cache hit.
[2024-06-01 15:49:39] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 15:49:39] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 310 ms returned sat
[2024-06-01 15:49:41] [INFO ] [Real]Absence check using state equation in 1802 ms returned sat
[2024-06-01 15:49:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:49:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 15:49:43] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 466 ms returned sat
[2024-06-01 15:49:47] [INFO ] [Nat]Absence check using state equation in 4667 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 35 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1893/1893 transitions.
Applied a total of 0 rules in 23 ms. Remains 573 /573 variables (removed 0) and now considering 1893/1893 (removed 0) transitions.
Running 1889 sub problems to find dead transitions.
[2024-06-01 15:49:47] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:49:47] [INFO ] Invariant cache hit.
[2024-06-01 15:49:47] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
[2024-06-01 15:50:11] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:50:13] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 2 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 569/2434 variables, and 39 constraints, problems are : Problem set: 0 solved, 1889 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/573 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1889/1889 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1889 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/569 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
[2024-06-01 15:50:19] [INFO ] Deduced a trap composed of 58 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:50:19] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:50:19] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:50:19] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:50:19] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:50:19] [INFO ] Deduced a trap composed of 59 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:50:20] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:50:21] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 3 ms to minimize.
[2024-06-01 15:50:21] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:50:21] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/2434 variables, and 49 constraints, problems are : Problem set: 0 solved, 1889 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/573 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1889 constraints, Known Traps: 12/12 constraints]
After SMT, in 49073ms problems are : Problem set: 0 solved, 1889 unsolved
Search for dead transitions found 0 dead transitions in 49105ms
[2024-06-01 15:50:36] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:50:36] [INFO ] Invariant cache hit.
[2024-06-01 15:50:37] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-06-01 15:50:37] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:50:37] [INFO ] Invariant cache hit.
[2024-06-01 15:50:38] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:51:08] [INFO ] Performed 488/573 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:51:13] [INFO ] Implicit Places using invariants and state equation in 35710 ms returned []
Implicit Place search using SMT with State Equation took 36409 ms to find 0 implicit places.
Running 1889 sub problems to find dead transitions.
[2024-06-01 15:51:13] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:51:13] [INFO ] Invariant cache hit.
[2024-06-01 15:51:13] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
[2024-06-01 15:51:36] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:51:37] [INFO ] Deduced a trap composed of 66 places in 195 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 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.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 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 2.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 2.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 4.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 2.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 2.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 4.0)
(s129 0.0)
(s130 1.0)
(s131 3.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 2.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 4.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 4.0)
(s191 0.0)
(s192 10.0)
(s193 0.0)
(s194 3.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 4.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 2.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 4.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 4.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 2.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 4.0)
(s285 8.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 2.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 2.0)
(s297 10.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 4.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 3.0)
(s318 1.0)
(s319 2.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 3.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 4.0)
(s361 0.0)
(s362 0.0)
(s363 2.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 4.0)
(s398 1.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 2.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 4.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 3.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/2434 variables, and 39 constraints, problems are : Problem set: 0 solved, 1889 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/573 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1889/1889 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1889 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/569 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
[2024-06-01 15:51:54] [INFO ] Deduced a trap composed of 58 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:51:54] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:51:54] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:51:54] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:51:54] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:51:54] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:51:55] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:51:56] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:51:56] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:51:56] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1889 unsolved
[2024-06-01 15:52:21] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(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 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 3)
(s75 0)
(s76 1)
(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 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(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 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 3)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 7)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(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 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 3)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 3)
(s275 1)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 7)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 10)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/2434 variables, and 50 constraints, problems are : Problem set: 0 solved, 1889 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/573 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1889 constraints, Known Traps: 13/13 constraints]
After SMT, in 68573ms problems are : Problem set: 0 solved, 1889 unsolved
Search for dead transitions found 0 dead transitions in 68590ms
Finished structural reductions in LTL mode , in 1 iterations and 154139 ms. Remains : 573/573 places, 1893/1893 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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 77 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 423 steps (0 resets) in 12 ms. (32 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-06-01 15:52:22] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:52:22] [INFO ] Invariant cache hit.
[2024-06-01 15:52:23] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 15:52:23] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 106 ms returned sat
[2024-06-01 15:52:25] [INFO ] [Real]Absence check using state equation in 1756 ms returned sat
[2024-06-01 15:52:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:52:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 15:52:27] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 585 ms returned sat
[2024-06-01 15:52:32] [INFO ] [Nat]Absence check using state equation in 5314 ms returned sat
[2024-06-01 15:52:32] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:52:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:52:34] [INFO ] [Nat]Added 160 Read/Feed constraints in 2179 ms returned sat
[2024-06-01 15:52:35] [INFO ] Deduced a trap composed of 58 places in 394 ms of which 4 ms to minimize.
[2024-06-01 15:52:35] [INFO ] Deduced a trap composed of 58 places in 379 ms of which 3 ms to minimize.
[2024-06-01 15:52:36] [INFO ] Deduced a trap composed of 58 places in 435 ms of which 3 ms to minimize.
[2024-06-01 15:52:36] [INFO ] Deduced a trap composed of 59 places in 419 ms of which 4 ms to minimize.
[2024-06-01 15:52:37] [INFO ] Deduced a trap composed of 273 places in 468 ms of which 4 ms to minimize.
[2024-06-01 15:52:38] [INFO ] Deduced a trap composed of 19 places in 470 ms of which 4 ms to minimize.
[2024-06-01 15:52:39] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 4947 ms
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 15:52:39] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:52:39] [INFO ] Invariant cache hit.
[2024-06-01 15:52:40] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:52:40] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 197 ms returned sat
[2024-06-01 15:52:42] [INFO ] [Real]Absence check using state equation in 1631 ms returned sat
[2024-06-01 15:52:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:52:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:52:44] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 320 ms returned sat
[2024-06-01 15:52:48] [INFO ] [Nat]Absence check using state equation in 4367 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 7373 reset in 1374 ms.
Product exploration explored 100000 steps with 7348 reset in 1375 ms.
Support contains 35 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1893/1893 transitions.
Applied a total of 0 rules in 20 ms. Remains 573 /573 variables (removed 0) and now considering 1893/1893 (removed 0) transitions.
Running 1889 sub problems to find dead transitions.
[2024-06-01 15:52:51] [INFO ] Flow matrix only has 1861 transitions (discarded 32 similar events)
[2024-06-01 15:52:51] [INFO ] Invariant cache hit.
[2024-06-01 15:52:51] [INFO ] State equation strengthened by 160 read => feed constraints.
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLFireability-00
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLFireability-02
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLFireability-03
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLFireability-04
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLFireability-05
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-LTLFireability-06
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717257650164

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-00
ltl formula formula --ltl=/tmp/2734/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.820 real 0.190 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-01
ltl formula formula --ltl=/tmp/2734/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.750 real 0.160 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_1_
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 4360 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 ~913!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2882
pnml2lts-mc( 0/ 4): unique transitions count: 7029
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: 2886
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2886
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2886 states 7049 transitions, fanout: 2.442
pnml2lts-mc( 0/ 4): Total exploration time 0.410 sec (0.410 sec minimum, 0.410 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7039, Transitions per second: 17193
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 48.7 B/state, compr.: 1.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-LTLFireability-02
ltl formula formula --ltl=/tmp/2734/ltl_2_
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.580 real 0.150 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-03
ltl formula formula --ltl=/tmp/2734/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.790 real 0.130 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 813 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( 2/ 4): ~32 levels ~10000 states ~17744 transitions
pnml2lts-mc( 2/ 4): ~32 levels ~20000 states ~35344 transitions
pnml2lts-mc( 1/ 4): ~32 levels ~40000 states ~70612 transitions
pnml2lts-mc( 1/ 4): ~32 levels ~80000 states ~141764 transitions
pnml2lts-mc( 1/ 4): ~32 levels ~160000 states ~284244 transitions
pnml2lts-mc( 1/ 4): ~32 levels ~320000 states ~568452 transitions
pnml2lts-mc( 1/ 4): ~48 levels ~640000 states ~1491108 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~1280000 states ~3059272 transitions
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-04
ltl formula formula --ltl=/tmp/2734/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 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.150 user 0.200 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_4_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-05
ltl formula formula --ltl=/tmp/2734/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.500 real 0.160 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_5_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-06
ltl formula formula --ltl=/tmp/2734/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 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.490 real 0.160 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_6_
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 4272 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): ~78 levels ~10000 states ~11684 transitions
pnml2lts-mc( 0/ 4): ~78 levels ~20000 states ~23120 transitions
pnml2lts-mc( 1/ 4): ~67 levels ~40000 states ~49760 transitions
pnml2lts-mc( 1/ 4): ~67 levels ~80000 states ~100984 transitions
pnml2lts-mc( 1/ 4): ~67 levels ~160000 states ~206752 transitions
pnml2lts-mc( 1/ 4): ~67 levels ~320000 states ~428828 transitions
pnml2lts-mc( 1/ 4): ~67 levels ~640000 states ~916352 transitions
pnml2lts-mc( 0/ 4): ~78 levels ~1280000 states ~1997208 transitions
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-07
ltl formula formula --ltl=/tmp/2734/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.610 real 0.170 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 813 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4415 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 ~609!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2597
pnml2lts-mc( 0/ 4): unique transitions count: 6367
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: 2601
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2601
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2601 states 6387 transitions, fanout: 2.456
pnml2lts-mc( 0/ 4): Total exploration time 0.370 sec (0.370 sec minimum, 0.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7030, Transitions per second: 17262
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, 45.9 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.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-08
ltl formula formula --ltl=/tmp/2734/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( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.190 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_8_
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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~608!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 355
pnml2lts-mc( 0/ 4): unique states count: 2604
pnml2lts-mc( 0/ 4): unique transitions count: 5846
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 134
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2612
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2260
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2612 states 5891 transitions, fanout: 2.255
pnml2lts-mc( 0/ 4): Total exploration time 0.370 sec (0.370 sec minimum, 0.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7059, Transitions per second: 15922
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.1 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-LTLFireability-09
ltl formula formula --ltl=/tmp/2734/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.470 real 0.160 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 812 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( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~329!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1165
pnml2lts-mc( 0/ 4): unique transitions count: 2919
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: 1169
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1169
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1169 states 2951 transitions, fanout: 2.524
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7306, Transitions per second: 18444
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.7 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-LTLFireability-10
ltl formula formula --ltl=/tmp/2734/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.500 real 0.160 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_10_
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 ~281!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 934
pnml2lts-mc( 0/ 4): unique transitions count: 2521
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: 937
pnml2lts-mc( 0/ 4): - cum. max stack depth: 937
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 937 states 2549 transitions, fanout: 2.720
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6693, Transitions per second: 18207
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 52.6 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-LTLFireability-11
ltl formula formula --ltl=/tmp/2734/ltl_11_
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.530 real 0.180 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_11_
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 4275 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 ~625!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2800
pnml2lts-mc( 0/ 4): unique transitions count: 6885
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: 2804
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2804
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2804 states 6905 transitions, fanout: 2.463
pnml2lts-mc( 0/ 4): Total exploration time 0.350 sec (0.350 sec minimum, 0.350 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8011, Transitions per second: 19729
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 48.5 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-LTLFireability-12
ltl formula formula --ltl=/tmp/2734/ltl_12_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 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.470 real 0.210 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 812 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 793, there are 4291 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 ~562!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2039
pnml2lts-mc( 0/ 4): unique transitions count: 4782
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2043
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2043
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2043 states 4802 transitions, fanout: 2.350
pnml2lts-mc( 0/ 4): Total exploration time 0.250 sec (0.250 sec minimum, 0.250 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8172, Transitions per second: 19208
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 52.0 B/state, compr.: 1.6%
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-LTLFireability-13
ltl formula formula --ltl=/tmp/2734/ltl_13_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 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.510 real 0.190 user 0.130 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_13_
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 4280 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): ~2500 levels ~10000 states ~22024 transitions
pnml2lts-mc( 0/ 4): ~4878 levels ~20000 states ~47440 transitions
pnml2lts-mc( 0/ 4): ~9635 levels ~40000 states ~93896 transitions
pnml2lts-mc( 0/ 4): ~19403 levels ~80000 states ~201736 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~24456!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 90
pnml2lts-mc( 0/ 4): unique states count: 98677
pnml2lts-mc( 0/ 4): unique transitions count: 237546
pnml2lts-mc( 0/ 4): - self-loop count: 6
pnml2lts-mc( 0/ 4): - claim dead count: 13
pnml2lts-mc( 0/ 4): - claim found count: 10443
pnml2lts-mc( 0/ 4): - claim success count: 98685
pnml2lts-mc( 0/ 4): - cum. max stack depth: 94827
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 98685 states 237578 transitions, fanout: 2.407
pnml2lts-mc( 0/ 4): Total exploration time 9.940 sec (9.940 sec minimum, 9.940 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9928, Transitions per second: 23901
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 6.1MB, 29.3 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/6.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: 6.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J06T08-LTLFireability-14
ltl formula formula --ltl=/tmp/2734/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.550 real 0.180 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 7 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~361!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 102
pnml2lts-mc( 0/ 4): unique states count: 1370
pnml2lts-mc( 0/ 4): unique transitions count: 3227
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 49
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1375
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1277
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1375 states 3251 transitions, fanout: 2.364
pnml2lts-mc( 0/ 4): Total exploration time 0.200 sec (0.200 sec minimum, 0.200 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6875, Transitions per second: 16255
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, 50.4 B/state, compr.: 1.6%
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-LTLFireability-15
ltl formula formula --ltl=/tmp/2734/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.600 real 0.200 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2734/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2734/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2734/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2734/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 812 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~667!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19
pnml2lts-mc( 0/ 4): unique states count: 3124
pnml2lts-mc( 0/ 4): unique transitions count: 6184
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 19
pnml2lts-mc( 0/ 4): - claim success count: 3131
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3034
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3131 states 6225 transitions, fanout: 1.988
pnml2lts-mc( 0/ 4): Total exploration time 0.410 sec (0.410 sec minimum, 0.410 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7637, Transitions per second: 15183
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, 45.7 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.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S04J06T08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446800300"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;