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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716864108352

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:41:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 02:41:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:41:51] [INFO ] Load time of PNML (sax parser for PT used): 463 ms
[2024-05-28 02:41:51] [INFO ] Transformed 712 places.
[2024-05-28 02:41:51] [INFO ] Transformed 4012 transitions.
[2024-05-28 02:41:51] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 767 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 93 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 218 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 190 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 02:41:52] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-28 02:41:52] [INFO ] Computed 50 invariants in 194 ms
[2024-05-28 02:41:52] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 02:42:20] [INFO ] Deduced a trap composed of 147 places in 369 ms of which 49 ms to minimize.
[2024-05-28 02:42:22] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 42 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20092 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 02:42:28] [INFO ] Deduced a trap composed of 5 places in 429 ms of which 5 ms to minimize.
[2024-05-28 02:42:28] [INFO ] Deduced a trap composed of 76 places in 378 ms of which 4 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 2 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 2 ms to minimize.
[2024-05-28 02:42:29] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 1 ms to minimize.
[2024-05-28 02:42:38] [INFO ] Deduced a trap composed of 146 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 50 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 10/10 constraints]
After SMT, in 51137ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 51275ms
[2024-05-28 02:42:43] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 02:42:43] [INFO ] Invariant cache hit.
[2024-05-28 02:42:44] [INFO ] Implicit Places using invariants in 750 ms returned [142, 228, 251, 352, 479, 545, 558, 687]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 767 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 700/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 31 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52371 ms. Remains : 700/712 places, 1844/1844 transitions.
Support contains 218 out of 700 places after structural reductions.
[2024-05-28 02:42:45] [INFO ] Flatten gal took : 255 ms
[2024-05-28 02:42:45] [INFO ] Flatten gal took : 165 ms
[2024-05-28 02:42:45] [INFO ] Input system was already deterministic with 1844 transitions.
RANDOM walk for 40000 steps (9 resets) in 1706 ms. (23 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
[2024-05-28 02:42:46] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 700 cols
[2024-05-28 02:42:46] [INFO ] Computed 42 invariants in 65 ms
[2024-05-28 02:42:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/119 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/131 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 70/201 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 681/2512 variables, and 27 constraints, problems are : Problem set: 1 solved, 0 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 15/25 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 700 transition count 1780
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 136 place count 636 transition count 1772
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 304 place count 548 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 311 place count 541 transition count 1685
Iterating global reduction 3 with 7 rules applied. Total rules applied 318 place count 541 transition count 1685
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 462 place count 469 transition count 1613
Applied a total of 462 rules in 200 ms. Remains 469 /700 variables (removed 231) and now considering 1613/1844 (removed 231) transitions.
Running 1609 sub problems to find dead transitions.
[2024-05-28 02:42:46] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
// Phase 1: matrix 1581 rows 469 cols
[2024-05-28 02:42:47] [INFO ] Computed 42 invariants in 26 ms
[2024-05-28 02:42:47] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:43:08] [INFO ] Deduced a trap composed of 195 places in 384 ms of which 3 ms to minimize.
[2024-05-28 02:43:08] [INFO ] Deduced a trap composed of 168 places in 363 ms of which 4 ms to minimize.
[2024-05-28 02:43:08] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-05-28 02:43:09] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:43:09] [INFO ] Deduced a trap composed of 158 places in 335 ms of which 4 ms to minimize.
[2024-05-28 02:43:10] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 3 ms to minimize.
[2024-05-28 02:43:12] [INFO ] Deduced a trap composed of 40 places in 376 ms of which 4 ms to minimize.
[2024-05-28 02:43:13] [INFO ] Deduced a trap composed of 76 places in 369 ms of which 3 ms to minimize.
[2024-05-28 02:43:16] [INFO ] Deduced a trap composed of 272 places in 361 ms of which 3 ms to minimize.
[2024-05-28 02:43:16] [INFO ] Deduced a trap composed of 252 places in 332 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/2050 variables, and 55 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1609/1609 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:43:36] [INFO ] Deduced a trap composed of 206 places in 428 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/2050 variables, and 56 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1609 constraints, Known Traps: 18/18 constraints]
After SMT, in 49716ms problems are : Problem set: 0 solved, 1609 unsolved
Search for dead transitions found 0 dead transitions in 49731ms
[2024-05-28 02:43:36] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 02:43:36] [INFO ] Invariant cache hit.
[2024-05-28 02:43:37] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-28 02:43:37] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 02:43:37] [INFO ] Invariant cache hit.
[2024-05-28 02:43:38] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:44:00] [INFO ] Implicit Places using invariants and state equation in 23588 ms returned []
Implicit Place search using SMT with State Equation took 24214 ms to find 0 implicit places.
[2024-05-28 02:44:01] [INFO ] Redundant transitions in 121 ms returned []
Running 1609 sub problems to find dead transitions.
[2024-05-28 02:44:01] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 02:44:01] [INFO ] Invariant cache hit.
[2024-05-28 02:44:01] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 1 ms to minimize.
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 1 ms to minimize.
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 4 ms to minimize.
[2024-05-28 02:44:21] [INFO ] Deduced a trap composed of 192 places in 366 ms of which 3 ms to minimize.
[2024-05-28 02:44:21] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2024-05-28 02:44:21] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:44:22] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2024-05-28 02:44:22] [INFO ] Deduced a trap composed of 158 places in 266 ms of which 3 ms to minimize.
[2024-05-28 02:44:24] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 3 ms to minimize.
[2024-05-28 02:44:24] [INFO ] Deduced a trap composed of 73 places in 262 ms of which 3 ms to minimize.
[2024-05-28 02:44:33] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 2 ms to minimize.
[2024-05-28 02:44:35] [INFO ] Deduced a trap composed of 213 places in 263 ms of which 3 ms to minimize.
[2024-05-28 02:44:36] [INFO ] Deduced a trap composed of 203 places in 388 ms of which 3 ms to minimize.
[2024-05-28 02:44:36] [INFO ] Deduced a trap composed of 123 places in 318 ms of which 3 ms to minimize.
[2024-05-28 02:44:36] [INFO ] Deduced a trap composed of 199 places in 271 ms of which 3 ms to minimize.
[2024-05-28 02:44:37] [INFO ] Deduced a trap composed of 202 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/2050 variables, and 58 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1609/1609 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/2050 variables, and 58 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1609 constraints, Known Traps: 20/20 constraints]
After SMT, in 68861ms problems are : Problem set: 0 solved, 1609 unsolved
Search for dead transitions found 0 dead transitions in 68879ms
Starting structural reductions in SI_LTL mode, iteration 1 : 469/700 places, 1613/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143170 ms. Remains : 469/700 places, 1613/1844 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLFireability-00
Stuttering criterion allowed to conclude after 32212 steps with 0 reset in 282 ms.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T08-LTLFireability-00 finished in 143773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 700 transition count 1788
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 644 transition count 1788
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 112 place count 644 transition count 1700
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 288 place count 556 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 296 place count 548 transition count 1692
Iterating global reduction 2 with 8 rules applied. Total rules applied 304 place count 548 transition count 1692
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 448 place count 476 transition count 1620
Applied a total of 448 rules in 125 ms. Remains 476 /700 variables (removed 224) and now considering 1620/1844 (removed 224) transitions.
Running 1616 sub problems to find dead transitions.
[2024-05-28 02:45:10] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
// Phase 1: matrix 1588 rows 476 cols
[2024-05-28 02:45:10] [INFO ] Computed 42 invariants in 49 ms
[2024-05-28 02:45:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 02:45:30] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-28 02:45:32] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
[2024-05-28 02:45:36] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2064 variables, and 36 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 02:45:42] [INFO ] Deduced a trap composed of 48 places in 339 ms of which 2 ms to minimize.
[2024-05-28 02:45:42] [INFO ] Deduced a trap composed of 48 places in 344 ms of which 2 ms to minimize.
[2024-05-28 02:45:42] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2024-05-28 02:45:43] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-05-28 02:45:43] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:45:43] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 22 ms to minimize.
[2024-05-28 02:45:44] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 2 ms to minimize.
[2024-05-28 02:45:44] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-05-28 02:45:51] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 02:45:59] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2064 variables, and 46 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 13/13 constraints]
After SMT, in 49537ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 49553ms
[2024-05-28 02:46:00] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 02:46:00] [INFO ] Invariant cache hit.
[2024-05-28 02:46:00] [INFO ] Implicit Places using invariants in 733 ms returned []
[2024-05-28 02:46:00] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 02:46:00] [INFO ] Invariant cache hit.
[2024-05-28 02:46:02] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:46:22] [INFO ] Implicit Places using invariants and state equation in 21609 ms returned []
Implicit Place search using SMT with State Equation took 22346 ms to find 0 implicit places.
[2024-05-28 02:46:22] [INFO ] Redundant transitions in 129 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-05-28 02:46:22] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 02:46:22] [INFO ] Invariant cache hit.
[2024-05-28 02:46:22] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 02:46:42] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2064 variables, and 34 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-05-28 02:47:04] [INFO ] Deduced a trap composed of 48 places in 345 ms of which 3 ms to minimize.
[2024-05-28 02:47:04] [INFO ] Deduced a trap composed of 33 places in 354 ms of which 4 ms to minimize.
[2024-05-28 02:47:04] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-28 02:47:04] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:47:04] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-05-28 02:47:05] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:47:05] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:47:05] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:47:07] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 2 ms to minimize.
[2024-05-28 02:47:08] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2064 variables, and 44 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 11/11 constraints]
After SMT, in 69503ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69529ms
Starting structural reductions in SI_LTL mode, iteration 1 : 476/700 places, 1620/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141710 ms. Remains : 476/700 places, 1620/1844 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLFireability-01
Stuttering criterion allowed to conclude after 12413 steps with 0 reset in 80 ms.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T08-LTLFireability-01 finished in 141873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p1)) U !p2)||p0)))'
Support contains 25 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 54 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:47:32] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 02:47:32] [INFO ] Computed 42 invariants in 67 ms
[2024-05-28 02:47:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:47:59] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 5 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 680/2480 variables, and 34 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:48:10] [INFO ] Deduced a trap composed of 74 places in 553 ms of which 9 ms to minimize.
[2024-05-28 02:48:10] [INFO ] Deduced a trap composed of 74 places in 316 ms of which 4 ms to minimize.
[2024-05-28 02:48:11] [INFO ] Deduced a trap composed of 74 places in 321 ms of which 3 ms to minimize.
[2024-05-28 02:48:11] [INFO ] Deduced a trap composed of 49 places in 302 ms of which 2 ms to minimize.
[2024-05-28 02:48:11] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:48:15] [INFO ] Deduced a trap composed of 130 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 40 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 7/7 constraints]
After SMT, in 49755ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 49781ms
[2024-05-28 02:48:22] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:48:22] [INFO ] Invariant cache hit.
[2024-05-28 02:48:23] [INFO ] Implicit Places using invariants in 787 ms returned []
[2024-05-28 02:48:23] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:48:23] [INFO ] Invariant cache hit.
[2024-05-28 02:48:25] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:48:55] [INFO ] Performed 550/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 02:48:58] [INFO ] Implicit Places using invariants and state equation in 35084 ms returned []
Implicit Place search using SMT with State Equation took 35876 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:48:58] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:48:58] [INFO ] Invariant cache hit.
[2024-05-28 02:48:58] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:49:24] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 7 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 680/2480 variables, and 34 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:49:46] [INFO ] Deduced a trap composed of 74 places in 405 ms of which 5 ms to minimize.
[2024-05-28 02:49:46] [INFO ] Deduced a trap composed of 103 places in 377 ms of which 4 ms to minimize.
[2024-05-28 02:49:47] [INFO ] Deduced a trap composed of 74 places in 310 ms of which 3 ms to minimize.
[2024-05-28 02:49:47] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 4 ms to minimize.
[2024-05-28 02:49:47] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-28 02:49:47] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:49:47] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:49:48] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-28 02:49:49] [INFO ] Deduced a trap composed of 61 places in 299 ms of which 4 ms to minimize.
[2024-05-28 02:49:50] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 3 ms to minimize.
[2024-05-28 02:49:55] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 2 ms to minimize.
[2024-05-28 02:50:01] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:50:01] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/680 variables, 13/47 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 47 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 14/14 constraints]
After SMT, in 69260ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 69285ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155010 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 857 ms.
Product exploration explored 100000 steps with 50000 reset in 1069 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 58 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J04T08-LTLFireability-02 finished in 157326 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) U X(G((F(p2)||p1)))))'
Support contains 58 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 48 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:50:09] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:50:09] [INFO ] Invariant cache hit.
[2024-05-28 02:50:09] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:50:33] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 34 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:50:47] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 5 ms to minimize.
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 103 places in 376 ms of which 3 ms to minimize.
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 74 places in 421 ms of which 4 ms to minimize.
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 3 ms to minimize.
[2024-05-28 02:50:48] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-28 02:50:49] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:50:49] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:50:49] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:50:50] [INFO ] Deduced a trap composed of 61 places in 279 ms of which 3 ms to minimize.
[2024-05-28 02:50:51] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 3 ms to minimize.
[2024-05-28 02:50:56] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 45 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 12/12 constraints]
After SMT, in 48542ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48571ms
[2024-05-28 02:50:58] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:50:58] [INFO ] Invariant cache hit.
[2024-05-28 02:50:59] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-05-28 02:50:59] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:50:59] [INFO ] Invariant cache hit.
[2024-05-28 02:51:01] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:51:31] [INFO ] Performed 585/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 02:51:37] [INFO ] Implicit Places using invariants and state equation in 38837 ms returned []
Implicit Place search using SMT with State Equation took 39610 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:51:37] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:51:37] [INFO ] Invariant cache hit.
[2024-05-28 02:51:37] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:52:03] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 34 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-28 02:52:25] [INFO ] Deduced a trap composed of 74 places in 426 ms of which 5 ms to minimize.
[2024-05-28 02:52:26] [INFO ] Deduced a trap composed of 103 places in 401 ms of which 4 ms to minimize.
[2024-05-28 02:52:26] [INFO ] Deduced a trap composed of 74 places in 405 ms of which 4 ms to minimize.
[2024-05-28 02:52:26] [INFO ] Deduced a trap composed of 41 places in 409 ms of which 4 ms to minimize.
[2024-05-28 02:52:26] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:52:27] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-28 02:52:27] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:52:27] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:52:29] [INFO ] Deduced a trap composed of 61 places in 290 ms of which 2 ms to minimize.
[2024-05-28 02:52:29] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 3 ms to minimize.
[2024-05-28 02:52:35] [INFO ] Deduced a trap composed of 130 places in 193 ms of which 3 ms to minimize.
[2024-05-28 02:52:42] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-28 02:52:42] [INFO ] Deduced a trap composed of 74 places in 66 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 1)
(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 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(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 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 2)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 3)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 4)
(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 0)
(s189 0)
(s190 0)
(s191 0)
(s192 2)
(s193 0)
(s194 0)
(s195 4)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(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 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 8)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 4)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(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)
(s334 0)
(s335 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 47 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 14/14 constraints]
After SMT, in 68425ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68446ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156688 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLFireability-03
Product exploration explored 100000 steps with 10044 reset in 824 ms.
Product exploration explored 100000 steps with 10012 reset in 1227 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 108 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 203 steps (0 resets) in 13 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 20 factoid took 288 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
[2024-05-28 02:52:49] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:52:49] [INFO ] Invariant cache hit.
[2024-05-28 02:52:50] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 02:52:51] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 97 ms returned sat
[2024-05-28 02:52:53] [INFO ] [Real]Absence check using state equation in 2098 ms returned sat
[2024-05-28 02:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:52:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 02:52:54] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 108 ms returned sat
[2024-05-28 02:52:58] [INFO ] [Nat]Absence check using state equation in 4235 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 50 out of 684 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 684 transition count 1780
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 636 transition count 1772
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 112 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 272 place count 548 transition count 1692
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 416 place count 476 transition count 1620
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 423 place count 469 transition count 1613
Iterating global reduction 3 with 7 rules applied. Total rules applied 430 place count 469 transition count 1613
Applied a total of 430 rules in 100 ms. Remains 469 /684 variables (removed 215) and now considering 1613/1828 (removed 215) transitions.
Running 1609 sub problems to find dead transitions.
[2024-05-28 02:52:58] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
// Phase 1: matrix 1581 rows 469 cols
[2024-05-28 02:52:58] [INFO ] Computed 42 invariants in 33 ms
[2024-05-28 02:52:58] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:53:18] [INFO ] Deduced a trap composed of 3 places in 78 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 465/2050 variables, and 34 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1609/1609 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:53:29] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 3 ms to minimize.
[2024-05-28 02:53:29] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:53:29] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-28 02:53:29] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-05-28 02:53:29] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-05-28 02:53:37] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 3 ms to minimize.
[2024-05-28 02:53:38] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 3 ms to minimize.
[2024-05-28 02:53:38] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-28 02:53:38] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 02:53:38] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:53:39] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:53:45] [INFO ] Deduced a trap composed of 47 places in 60 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 465/2050 variables, and 46 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1609 constraints, Known Traps: 13/13 constraints]
After SMT, in 48691ms problems are : Problem set: 0 solved, 1609 unsolved
Search for dead transitions found 0 dead transitions in 48706ms
[2024-05-28 02:53:47] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 02:53:47] [INFO ] Invariant cache hit.
[2024-05-28 02:53:48] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-28 02:53:48] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 02:53:48] [INFO ] Invariant cache hit.
[2024-05-28 02:53:48] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:54:06] [INFO ] Implicit Places using invariants and state equation in 17947 ms returned []
Implicit Place search using SMT with State Equation took 18410 ms to find 0 implicit places.
[2024-05-28 02:54:06] [INFO ] Redundant transitions in 30 ms returned []
Running 1609 sub problems to find dead transitions.
[2024-05-28 02:54:06] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 02:54:06] [INFO ] Invariant cache hit.
[2024-05-28 02:54:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:54:26] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-28 02:54:26] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1609 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 465/2050 variables, and 35 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1609/1609 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:54:48] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 2 ms to minimize.
[2024-05-28 02:54:48] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 2 ms to minimize.
[2024-05-28 02:54:48] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-28 02:54:48] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-28 02:54:48] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:54:48] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:54:49] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-05-28 02:54:49] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-28 02:54:51] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1609 unsolved
[2024-05-28 02:55:06] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 1 ms to minimize.
[2024-05-28 02:55:07] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 1 ms to minimize.
[2024-05-28 02:55:11] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 3 ms to minimize.
[2024-05-28 02:55:12] [INFO ] Deduced a trap composed of 83 places in 299 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/2050 variables, and 48 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1609 constraints, Known Traps: 15/15 constraints]
After SMT, in 70225ms problems are : Problem set: 0 solved, 1609 unsolved
Search for dead transitions found 0 dead transitions in 70247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 469/684 places, 1613/1828 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137508 ms. Remains : 469/684 places, 1613/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 : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 126 steps (0 resets) in 9 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
[2024-05-28 02:55:16] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 02:55:16] [INFO ] Invariant cache hit.
[2024-05-28 02:55:17] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:55:17] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 93 ms returned sat
[2024-05-28 02:55:20] [INFO ] [Real]Absence check using state equation in 2152 ms returned sat
[2024-05-28 02:55:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:55:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 02:55:21] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 384 ms returned sat
[2024-05-28 02:55:24] [INFO ] [Nat]Absence check using state equation in 3061 ms returned sat
[2024-05-28 02:55:24] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:55:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:55:26] [INFO ] [Nat]Added 160 Read/Feed constraints in 2289 ms returned sat
[2024-05-28 02:55:27] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 1 ms to minimize.
[2024-05-28 02:55:28] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1703 ms
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 10255 reset in 1032 ms.
Product exploration explored 100000 steps with 10317 reset in 861 ms.
Support contains 50 out of 469 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 469/469 places, 1613/1613 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 461 transition count 1605
Applied a total of 16 rules in 92 ms. Remains 461 /469 variables (removed 8) and now considering 1605/1613 (removed 8) transitions.
Running 1601 sub problems to find dead transitions.
[2024-05-28 02:55:30] [INFO ] Flow matrix only has 1573 transitions (discarded 32 similar events)
// Phase 1: matrix 1573 rows 461 cols
[2024-05-28 02:55:30] [INFO ] Computed 42 invariants in 57 ms
[2024-05-28 02:55:30] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
[2024-05-28 02:55:50] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-28 02:55:52] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1601 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/461 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1601/1601 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/457 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
[2024-05-28 02:56:02] [INFO ] Deduced a trap composed of 47 places in 350 ms of which 3 ms to minimize.
[2024-05-28 02:56:02] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 2 ms to minimize.
[2024-05-28 02:56:02] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 2 ms to minimize.
[2024-05-28 02:56:02] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 2 ms to minimize.
[2024-05-28 02:56:03] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 2 ms to minimize.
[2024-05-28 02:56:03] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:56:03] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:56:03] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2024-05-28 02:56:04] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 02:56:04] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:56:04] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/2034 variables, and 46 constraints, problems are : Problem set: 0 solved, 1601 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/461 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1601 constraints, Known Traps: 13/13 constraints]
After SMT, in 49629ms problems are : Problem set: 0 solved, 1601 unsolved
Search for dead transitions found 0 dead transitions in 49655ms
[2024-05-28 02:56:20] [INFO ] Flow matrix only has 1573 transitions (discarded 32 similar events)
[2024-05-28 02:56:20] [INFO ] Invariant cache hit.
[2024-05-28 02:56:20] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-28 02:56:20] [INFO ] Flow matrix only has 1573 transitions (discarded 32 similar events)
[2024-05-28 02:56:20] [INFO ] Invariant cache hit.
[2024-05-28 02:56:22] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:56:43] [INFO ] Implicit Places using invariants and state equation in 22614 ms returned []
Implicit Place search using SMT with State Equation took 23133 ms to find 0 implicit places.
[2024-05-28 02:56:43] [INFO ] Redundant transitions in 30 ms returned []
Running 1601 sub problems to find dead transitions.
[2024-05-28 02:56:43] [INFO ] Flow matrix only has 1573 transitions (discarded 32 similar events)
[2024-05-28 02:56:43] [INFO ] Invariant cache hit.
[2024-05-28 02:56:43] [INFO ] State equation strengthened by 160 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.163s, Sys 0.009s]


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


----------------------------------------------------------------------
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: 1421
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LTLFireability"
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 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 r289-tajo-171654445600276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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