Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445600275.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 21K Apr 11 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 11 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 780K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.3M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716863905612

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:38:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 02:38:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:38:27] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2024-05-28 02:38:27] [INFO ] Transformed 712 places.
[2024-05-28 02:38:27] [INFO ] Transformed 4012 transitions.
[2024-05-28 02:38:27] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 171 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 701 transition count 1837
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 701 transition count 1837
Applied a total of 18 rules in 118 ms. Remains 701 /712 variables (removed 11) and now considering 1837/1844 (removed 7) transitions.
Running 1833 sub problems to find dead transitions.
[2024-05-28 02:38:27] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 701 cols
[2024-05-28 02:38:27] [INFO ] Computed 50 invariants in 102 ms
[2024-05-28 02:38:27] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
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 697/2506 variables, and 46 constraints, problems are : Problem set: 0 solved, 1833 unsolved in 20089 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/701 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1833/1833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 75 places in 508 ms of which 22 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 3 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 3 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 1 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 1 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-05-28 02:39:05] [INFO ] Deduced a trap composed of 370 places in 483 ms of which 5 ms to minimize.
[2024-05-28 02:39:05] [INFO ] Deduced a trap composed of 356 places in 426 ms of which 5 ms to minimize.
[2024-05-28 02:39:05] [INFO ] Deduced a trap composed of 362 places in 465 ms of which 5 ms to minimize.
[2024-05-28 02:39:06] [INFO ] Deduced a trap composed of 343 places in 390 ms of which 4 ms to minimize.
[2024-05-28 02:39:06] [INFO ] Deduced a trap composed of 376 places in 415 ms of which 5 ms to minimize.
[2024-05-28 02:39:07] [INFO ] Deduced a trap composed of 390 places in 395 ms of which 5 ms to minimize.
[2024-05-28 02:39:07] [INFO ] Deduced a trap composed of 368 places in 391 ms of which 4 ms to minimize.
[2024-05-28 02:39:08] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 3 ms to minimize.
[2024-05-28 02:39:11] [INFO ] Deduced a trap composed of 382 places in 554 ms of which 6 ms to minimize.
[2024-05-28 02:39:11] [INFO ] Deduced a trap composed of 54 places in 531 ms of which 5 ms to minimize.
[2024-05-28 02:39:14] [INFO ] Deduced a trap composed of 49 places in 348 ms of which 7 ms to minimize.
[2024-05-28 02:39:15] [INFO ] Deduced a trap composed of 353 places in 416 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/697 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/2506 variables, and 66 constraints, problems are : Problem set: 0 solved, 1833 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/701 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1833 constraints, Known Traps: 20/20 constraints]
After SMT, in 49236ms problems are : Problem set: 0 solved, 1833 unsolved
Search for dead transitions found 0 dead transitions in 49288ms
[2024-05-28 02:39:17] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
[2024-05-28 02:39:17] [INFO ] Invariant cache hit.
[2024-05-28 02:39:17] [INFO ] Implicit Places using invariants in 542 ms returned [142, 229, 252, 352, 475, 540, 553, 680]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 555 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 693/712 places, 1837/1844 transitions.
Applied a total of 0 rules in 26 ms. Remains 693 /693 variables (removed 0) and now considering 1837/1837 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50041 ms. Remains : 693/712 places, 1837/1844 transitions.
Support contains 171 out of 693 places after structural reductions.
[2024-05-28 02:39:18] [INFO ] Flatten gal took : 196 ms
[2024-05-28 02:39:18] [INFO ] Flatten gal took : 114 ms
[2024-05-28 02:39:18] [INFO ] Input system was already deterministic with 1837 transitions.
Support contains 124 out of 693 places (down from 171) after GAL structural reductions.
RANDOM walk for 40002 steps (10 resets) in 1910 ms. (20 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40001 steps (10 resets) in 357 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 330 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
[2024-05-28 02:39:19] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 693 cols
[2024-05-28 02:39:19] [INFO ] Computed 42 invariants in 61 ms
[2024-05-28 02:39:19] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/68 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/76 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 116/192 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 7 (OVERLAPS) 473/665 variables, 17/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 9 (OVERLAPS) 14/679 variables, 7/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 0/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 693/2498 variables, and 42 constraints, problems are : Problem set: 6 solved, 0 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/693 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 693 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 1837/1837 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 685 transition count 1829
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 685 transition count 1829
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 684 transition count 1828
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 684 transition count 1828
Applied a total of 18 rules in 52 ms. Remains 684 /693 variables (removed 9) and now considering 1828/1837 (removed 9) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:39:20] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 02:39:20] [INFO ] Computed 42 invariants in 44 ms
[2024-05-28 02:39:20] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:39:45] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-05-28 02:39:46] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:39:46] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2024-05-28 02:39:46] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:39:46] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:39:46] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:39:46] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:39:47] [INFO ] Deduced a trap composed of 61 places in 217 ms of which 3 ms to minimize.
[2024-05-28 02:39:48] [INFO ] Deduced a trap composed of 54 places in 509 ms of which 5 ms to minimize.
[2024-05-28 02:39:48] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-05-28 02:39:48] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 3 ms to minimize.
[2024-05-28 02:39:49] [INFO ] Deduced a trap composed of 342 places in 469 ms of which 5 ms to minimize.
[2024-05-28 02:39:49] [INFO ] Deduced a trap composed of 81 places in 352 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:40:05] [INFO ] Deduced a trap composed of 175 places in 366 ms of which 5 ms to minimize.
[2024-05-28 02:40:05] [INFO ] Deduced a trap composed of 410 places in 463 ms of which 7 ms to minimize.
[2024-05-28 02:40:06] [INFO ] Deduced a trap composed of 385 places in 410 ms of which 4 ms to minimize.
[2024-05-28 02:40:06] [INFO ] Deduced a trap composed of 335 places in 324 ms of which 3 ms to minimize.
[2024-05-28 02:40:09] [INFO ] Deduced a trap composed of 353 places in 264 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 56 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 18/18 constraints]
After SMT, in 49453ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 49471ms
[2024-05-28 02:40:09] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:40:09] [INFO ] Invariant cache hit.
[2024-05-28 02:40:10] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-28 02:40:10] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:40:10] [INFO ] Invariant cache hit.
[2024-05-28 02:40:11] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:40:41] [INFO ] Performed 579/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 02:40:47] [INFO ] Implicit Places using invariants and state equation in 36780 ms returned []
Implicit Place search using SMT with State Equation took 37688 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:40:47] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:40:47] [INFO ] Invariant cache hit.
[2024-05-28 02:40:47] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:41:12] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-28 02:41:13] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 6 ms to minimize.
[2024-05-28 02:41:13] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:41:13] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:41:13] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 0 ms to minimize.
[2024-05-28 02:41:13] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:41:13] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:41:13] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 4 ms to minimize.
[2024-05-28 02:41:13] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:41:14] [INFO ] Deduced a trap composed of 341 places in 386 ms of which 4 ms to minimize.
[2024-05-28 02:41:15] [INFO ] Deduced a trap composed of 407 places in 348 ms of which 4 ms to minimize.
[2024-05-28 02:41:16] [INFO ] Deduced a trap composed of 347 places in 438 ms of which 5 ms to minimize.
[2024-05-28 02:41:17] [INFO ] Deduced a trap composed of 186 places in 450 ms of which 9 ms to minimize.
[2024-05-28 02:41:17] [INFO ] Deduced a trap composed of 212 places in 379 ms of which 4 ms to minimize.
[2024-05-28 02:41:18] [INFO ] Deduced a trap composed of 201 places in 365 ms of which 4 ms to minimize.
[2024-05-28 02:41:18] [INFO ] Deduced a trap composed of 201 places in 374 ms of which 4 ms to minimize.
[2024-05-28 02:41:22] [INFO ] Deduced a trap composed of 381 places in 520 ms of which 5 ms to minimize.
[2024-05-28 02:41:22] [INFO ] Deduced a trap composed of 81 places in 291 ms of which 5 ms to minimize.
[2024-05-28 02:41:23] [INFO ] Deduced a trap composed of 342 places in 478 ms of which 6 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 57 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 57 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 19/19 constraints]
After SMT, in 69472ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 69489ms
Starting structural reductions in LTL mode, iteration 1 : 684/693 places, 1828/1837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156713 ms. Remains : 684/693 places, 1828/1837 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 1083 ms.
Product exploration explored 100000 steps with 25000 reset in 1045 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 125 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 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 334 steps (0 resets) in 5 ms. (55 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 164 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 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 20 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:42:00] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:42:00] [INFO ] Invariant cache hit.
[2024-05-28 02:42:00] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:42:28] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:42:28] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:42:28] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-05-28 02:42:28] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 19 places in 393 ms of which 4 ms to minimize.
SMT process timed out in 29511ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 29541ms
[2024-05-28 02:42:29] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:42:29] [INFO ] Invariant cache hit.
[2024-05-28 02:42:30] [INFO ] Implicit Places using invariants in 789 ms returned []
[2024-05-28 02:42:30] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:42:30] [INFO ] Invariant cache hit.
[2024-05-28 02:42:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:43:01] [INFO ] Performed 589/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 02:43:06] [INFO ] Implicit Places using invariants and state equation in 35612 ms returned []
Implicit Place search using SMT with State Equation took 36406 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:43:06] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:43:06] [INFO ] Invariant cache hit.
[2024-05-28 02:43:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:43:31] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-05-28 02:43:31] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:43:31] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:43:31] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:43:31] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 2 ms to minimize.
[2024-05-28 02:43:31] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-28 02:43:32] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:43:32] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 3 ms to minimize.
[2024-05-28 02:43:32] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 2 ms to minimize.
[2024-05-28 02:43:33] [INFO ] Deduced a trap composed of 341 places in 456 ms of which 6 ms to minimize.
[2024-05-28 02:43:34] [INFO ] Deduced a trap composed of 407 places in 437 ms of which 5 ms to minimize.
[2024-05-28 02:43:35] [INFO ] Deduced a trap composed of 347 places in 492 ms of which 5 ms to minimize.
[2024-05-28 02:43:37] [INFO ] Deduced a trap composed of 186 places in 469 ms of which 5 ms to minimize.
[2024-05-28 02:43:37] [INFO ] Deduced a trap composed of 212 places in 467 ms of which 5 ms to minimize.
[2024-05-28 02:43:37] [INFO ] Deduced a trap composed of 201 places in 401 ms of which 4 ms to minimize.
[2024-05-28 02:43:38] [INFO ] Deduced a trap composed of 201 places in 391 ms of which 3 ms to minimize.
[2024-05-28 02:43:40] [INFO ] Deduced a trap composed of 381 places in 570 ms of which 5 ms to minimize.
[2024-05-28 02:43:40] [INFO ] Deduced a trap composed of 81 places in 297 ms of which 3 ms to minimize.
[2024-05-28 02:43:41] [INFO ] Deduced a trap composed of 342 places in 457 ms of which 5 ms to minimize.
[2024-05-28 02:43:43] [INFO ] Deduced a trap composed of 398 places in 378 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 58 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 385 places in 471 ms of which 7 ms to minimize.
[2024-05-28 02:44:11] [INFO ] Deduced a trap composed of 54 places in 479 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 60 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 22/22 constraints]
After SMT, in 68276ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68292ms
Finished structural reductions in LTL mode , in 1 iterations and 134273 ms. Remains : 684/684 places, 1828/1828 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 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 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 235 steps (0 resets) in 6 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 71 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 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1068 ms.
Product exploration explored 100000 steps with 25000 reset in 975 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 684 transition count 1828
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 48 place count 684 transition count 1892
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 684 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 112 place count 668 transition count 1876
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 128 place count 668 transition count 1876
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 3 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 248 place count 668 transition count 1876
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 279 place count 637 transition count 1845
Deduced a syphon composed of 176 places in 3 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 310 place count 637 transition count 1845
Deduced a syphon composed of 176 places in 3 ms
Applied a total of 310 rules in 328 ms. Remains 637 /684 variables (removed 47) and now considering 1845/1828 (removed -17) transitions.
Running 1841 sub problems to find dead transitions.
[2024-05-28 02:44:18] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
// Phase 1: matrix 1813 rows 637 cols
[2024-05-28 02:44:18] [INFO ] Computed 42 invariants in 39 ms
[2024-05-28 02:44:18] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-05-28 02:44:41] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:44:42] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-28 02:44:43] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-28 02:44:43] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD266 is UNSAT
[2024-05-28 02:44:44] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD291 is UNSAT
[2024-05-28 02:44:45] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
Problem TDEAD300 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD431 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.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 2.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 4.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 timeout
0.0)
(s48 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/2450 variables, and 39 constraints, problems are : Problem set: 15 solved, 1826 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/637 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1841/1841 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 15 solved, 1826 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 10/10 constraints. Problems are: Problem set: 15 solved, 1826 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 9/19 constraints. Problems are: Problem set: 15 solved, 1826 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 6/25 constraints. Problems are: Problem set: 15 solved, 1826 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 1826 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
At refinement iteration 4 (OVERLAPS) 10/628 variables, 5/30 constraints. Problems are: Problem set: 263 solved, 1578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 5/35 constraints. Problems are: Problem set: 263 solved, 1578 unsolved
[2024-05-28 02:45:04] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
[2024-05-28 02:45:05] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD276 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/2450 variables, and 37 constraints, problems are : Problem set: 279 solved, 1562 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 14/27 constraints, State Equation: 0/637 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/1841 constraints, Known Traps: 8/8 constraints]
After SMT, in 49102ms problems are : Problem set: 279 solved, 1562 unsolved
Search for dead transitions found 279 dead transitions in 49131ms
Found 279 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 279 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 279 transitions.
[2024-05-28 02:45:07] [INFO ] Redundant transitions in 92 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 637/684 places, 1566/1828 transitions.
Graph (complete) has 3780 edges and 637 vertex of which 601 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Discarding 36 places :
Also discarding 0 output transitions
Deduced a syphon composed of 140 places in 1 ms
Applied a total of 1 rules in 49 ms. Remains 601 /637 variables (removed 36) and now considering 1566/1566 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 601/684 places, 1566/1828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49619 ms. Remains : 601/684 places, 1566/1828 transitions.
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 13 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:45:07] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 02:45:07] [INFO ] Computed 42 invariants in 66 ms
[2024-05-28 02:45:07] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:45:33] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:45:33] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-28 02:45:33] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:45:33] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:45:33] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 0 ms to minimize.
[2024-05-28 02:45:33] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:45:33] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:45:34] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 3 ms to minimize.
[2024-05-28 02:45:35] [INFO ] Deduced a trap composed of 54 places in 497 ms of which 5 ms to minimize.
[2024-05-28 02:45:35] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-28 02:45:36] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 49 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:45:53] [INFO ] Deduced a trap composed of 390 places in 514 ms of which 5 ms to minimize.
[2024-05-28 02:45:54] [INFO ] Deduced a trap composed of 342 places in 326 ms of which 4 ms to minimize.
[2024-05-28 02:45:55] [INFO ] Deduced a trap composed of 187 places in 408 ms of which 5 ms to minimize.
[2024-05-28 02:45:55] [INFO ] Deduced a trap composed of 411 places in 320 ms of which 4 ms to minimize.
[2024-05-28 02:45:56] [INFO ] Deduced a trap composed of 410 places in 460 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 54 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 16/16 constraints]
After SMT, in 48912ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48935ms
[2024-05-28 02:45:56] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:45:56] [INFO ] Invariant cache hit.
[2024-05-28 02:45:57] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-28 02:45:57] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:45:57] [INFO ] Invariant cache hit.
[2024-05-28 02:45:58] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:46:28] [INFO ] Performed 593/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 02:46:32] [INFO ] Implicit Places using invariants and state equation in 34924 ms returned []
Implicit Place search using SMT with State Equation took 35685 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:46:32] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:46:32] [INFO ] Invariant cache hit.
[2024-05-28 02:46:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:46:57] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:46:57] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-28 02:46:57] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-28 02:46:57] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:46:57] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 1 ms to minimize.
[2024-05-28 02:46:57] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-28 02:46:58] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-05-28 02:46:58] [INFO ] Deduced a trap composed of 19 places in 336 ms of which 4 ms to minimize.
[2024-05-28 02:46:58] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:46:59] [INFO ] Deduced a trap composed of 341 places in 508 ms of which 5 ms to minimize.
[2024-05-28 02:47:00] [INFO ] Deduced a trap composed of 407 places in 422 ms of which 4 ms to minimize.
[2024-05-28 02:47:01] [INFO ] Deduced a trap composed of 347 places in 461 ms of which 5 ms to minimize.
[2024-05-28 02:47:02] [INFO ] Deduced a trap composed of 186 places in 477 ms of which 5 ms to minimize.
[2024-05-28 02:47:03] [INFO ] Deduced a trap composed of 212 places in 365 ms of which 4 ms to minimize.
[2024-05-28 02:47:03] [INFO ] Deduced a trap composed of 201 places in 336 ms of which 3 ms to minimize.
[2024-05-28 02:47:03] [INFO ] Deduced a trap composed of 201 places in 349 ms of which 4 ms to minimize.
[2024-05-28 02:47:05] [INFO ] Deduced a trap composed of 381 places in 479 ms of which 5 ms to minimize.
[2024-05-28 02:47:06] [INFO ] Deduced a trap composed of 81 places in 256 ms of which 3 ms to minimize.
[2024-05-28 02:47:06] [INFO ] Deduced a trap composed of 342 places in 393 ms of which 4 ms to minimize.
[2024-05-28 02:47:09] [INFO ] Deduced a trap composed of 398 places in 440 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 58 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:47:36] [INFO ] Deduced a trap composed of 385 places in 328 ms of which 3 ms to minimize.
[2024-05-28 02:47:38] [INFO ] Deduced a trap composed of 54 places in 438 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 60 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 22/22 constraints]
After SMT, in 69803ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 69821ms
Finished structural reductions in LTL mode , in 1 iterations and 154466 ms. Remains : 684/684 places, 1828/1828 transitions.
Treatment of property PolyORBLF-PT-S04J04T08-LTLCardinality-02 finished in 502160 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(G((p0||X(((p1||F(G(p0))) U (p0&&(p1||F(G(p0))))))))))'
Support contains 32 out of 693 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 1837/1837 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 692 transition count 1836
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 692 transition count 1836
Applied a total of 2 rules in 28 ms. Remains 692 /693 variables (removed 1) and now considering 1836/1837 (removed 1) transitions.
Running 1832 sub problems to find dead transitions.
[2024-05-28 02:47:42] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 692 cols
[2024-05-28 02:47:42] [INFO ] Computed 42 invariants in 65 ms
[2024-05-28 02:47:42] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 02:48:08] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 34 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 02:48:14] [INFO ] Deduced a trap composed of 76 places in 403 ms of which 4 ms to minimize.
[2024-05-28 02:48:14] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:48:15] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-28 02:48:15] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:48:16] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-28 02:48:22] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-05-28 02:48:22] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-28 02:48:22] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2024-05-28 02:48:23] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-28 02:48:27] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 44 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 11/11 constraints]
After SMT, in 49239ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 49258ms
[2024-05-28 02:48:31] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 02:48:31] [INFO ] Invariant cache hit.
[2024-05-28 02:48:32] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-28 02:48:32] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 02:48:32] [INFO ] Invariant cache hit.
[2024-05-28 02:48:33] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:49:03] [INFO ] Performed 486/692 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 02:49:12] [INFO ] Implicit Places using invariants and state equation in 39783 ms returned []
Implicit Place search using SMT with State Equation took 40400 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-05-28 02:49:12] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 02:49:12] [INFO ] Invariant cache hit.
[2024-05-28 02:49:12] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 02:49:37] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:49:37] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2024-05-28 02:49:44] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 36 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 75 places in 319 ms of which 3 ms to minimize.
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:49:56] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-28 02:49:57] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:49:57] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:49:58] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 2 ms to minimize.
[2024-05-28 02:49:58] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2024-05-28 02:50:14] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
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 688/2496 variables, and 47 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 14/14 constraints]
After SMT, in 69586ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 69615ms
Starting structural reductions in LTL mode, iteration 1 : 692/693 places, 1836/1837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159309 ms. Remains : 692/693 places, 1836/1837 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLCardinality-03
Product exploration explored 100000 steps with 600 reset in 454 ms.
Product exploration explored 100000 steps with 562 reset in 497 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 p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 487 steps (0 resets) in 15 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Applied a total of 0 rules in 11 ms. Remains 692 /692 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
Running 1832 sub problems to find dead transitions.
[2024-05-28 02:50:23] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 02:50:23] [INFO ] Invariant cache hit.
[2024-05-28 02:50:23] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 35 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 02:50:58] [INFO ] Deduced a trap composed of 75 places in 313 ms of which 3 ms to minimize.
[2024-05-28 02:50:58] [INFO ] Deduced a trap composed of 75 places in 318 ms of which 3 ms to minimize.
[2024-05-28 02:50:58] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 1 ms to minimize.
[2024-05-28 02:50:58] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-28 02:50:59] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2024-05-28 02:50:59] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:51:03] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 2 ms to minimize.
[2024-05-28 02:51:04] [INFO ] Deduced a trap composed of 75 places in 288 ms of which 3 ms to minimize.
[2024-05-28 02:51:04] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 3 ms to minimize.
[2024-05-28 02:51:05] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 3 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 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 2)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 45 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 12/12 constraints]
After SMT, in 48735ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 48755ms
[2024-05-28 02:51:12] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 02:51:12] [INFO ] Invariant cache hit.
[2024-05-28 02:51:12] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-28 02:51:12] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 02:51:12] [INFO ] Invariant cache hit.
[2024-05-28 02:51:14] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:51:44] [INFO ] Performed 527/692 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 02:51:51] [INFO ] Implicit Places using invariants and state equation in 38658 ms returned []
Implicit Place search using SMT with State Equation took 39266 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-05-28 02:51:51] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-28 02:51:51] [INFO ] Invariant cache hit.
[2024-05-28 02:51:51] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 02:52:17] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 5 ms to minimize.
[2024-05-28 02:52:17] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-28 02:52:24] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 36 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-28 02:52:33] [INFO ] Deduced a trap composed of 75 places in 327 ms of which 3 ms to minimize.
[2024-05-28 02:52:34] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:52:34] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-28 02:52:34] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:52:34] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:52:36] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-28 02:52:37] [INFO ] Deduced a trap composed of 41 places in 304 ms of which 3 ms to minimize.
[2024-05-28 02:52:37] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:52:38] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-05-28 02:52:38] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-05-28 02:52:55] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1832 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 Int declared 688/2496 variables, and 47 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 14/14 constraints]
After SMT, in 69529ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 69545ms
Finished structural reductions in LTL mode , in 1 iterations and 157590 ms. Remains : 692/692 places, 1836/1836 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 p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 690 steps (0 resets) in 14 ms. (46 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 571 reset in 443 ms.
Product exploration explored 100000 steps with 582 reset in 455 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 692 transition count 1836
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 44 place count 692 transition count 1900
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 92 place count 692 transition count 1900
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 112 place count 672 transition count 1880
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 132 place count 672 transition count 1880
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 196 places in 1 ms
Iterating global reduction 1 with 124 rules applied. Total rules applied 256 place count 672 transition count 1880
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 283 place count 645 transition count 1853
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 310 place count 645 transition count 1853
Deduced a syphon composed of 176 places in 1 ms
Applied a total of 310 rules in 169 ms. Remains 645 /692 variables (removed 47) and now considering 1853/1836 (removed -17) transitions.
Running 1849 sub problems to find dead transitions.
[2024-05-28 02:53:03] [INFO ] Flow matrix only has 1821 transitions (discarded 32 similar events)
// Phase 1: matrix 1821 rows 645 cols
[2024-05-28 02:53:03] [INFO ] Computed 42 invariants in 26 ms
[2024-05-28 02:53:03] [INFO ] State equation strengthened by 224 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 712
TRANSITIONS: 4012
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.232s, Sys 0.009s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.027s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1652
MODEL NAME: /home/mcc/execution/model
712 places, 4012 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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