Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446700276.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 itstools
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 r290-tajo-171654446700276
=====================================================================

--------------------
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 1716917870693

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 17:37:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:37:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:37:52] [INFO ] Load time of PNML (sax parser for PT used): 459 ms
[2024-05-28 17:37:53] [INFO ] Transformed 712 places.
[2024-05-28 17:37:53] [INFO ] Transformed 4012 transitions.
[2024-05-28 17:37:53] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 756 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 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 138 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 17:37:53] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-28 17:37:53] [INFO ] Computed 50 invariants in 110 ms
[2024-05-28 17:37:54] [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 17:38:22] [INFO ] Deduced a trap composed of 147 places in 331 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 41 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20094 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: 1/1 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, 1/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 17:38:26] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 3 ms to minimize.
[2024-05-28 17:38:28] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 6 ms to minimize.
[2024-05-28 17:38:28] [INFO ] Deduced a trap composed of 75 places in 610 ms of which 5 ms to minimize.
[2024-05-28 17:38:29] [INFO ] Deduced a trap composed of 76 places in 526 ms of which 3 ms to minimize.
[2024-05-28 17:38:29] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2024-05-28 17:38:29] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-05-28 17:38:30] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:38:30] [INFO ] Deduced a trap composed of 41 places in 386 ms of which 3 ms to minimize.
[2024-05-28 17:38:30] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:38:31] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 51 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20039 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: 11/11 constraints]
After SMT, in 49527ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49628ms
[2024-05-28 17:38:43] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 17:38:43] [INFO ] Invariant cache hit.
[2024-05-28 17:38:43] [INFO ] Implicit Places using invariants in 457 ms returned [142, 228, 251, 352, 479, 545, 558, 687]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 470 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 23 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 50353 ms. Remains : 700/712 places, 1844/1844 transitions.
Support contains 218 out of 700 places after structural reductions.
[2024-05-28 17:38:44] [INFO ] Flatten gal took : 177 ms
[2024-05-28 17:38:44] [INFO ] Flatten gal took : 114 ms
[2024-05-28 17:38:44] [INFO ] Input system was already deterministic with 1844 transitions.
RANDOM walk for 40000 steps (10 resets) in 1902 ms. (21 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 386 ms. (103 steps per ms) remains 1/1 properties
[2024-05-28 17:38:45] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 700 cols
[2024-05-28 17:38:45] [INFO ] Computed 42 invariants in 56 ms
[2024-05-28 17:38:45] [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 158 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 234ms 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 2 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 175 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 17:38:46] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
// Phase 1: matrix 1581 rows 469 cols
[2024-05-28 17:38:46] [INFO ] Computed 42 invariants in 58 ms
[2024-05-28 17:38:46] [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 17:39:06] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-05-28 17:39:06] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:39:06] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:39:06] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:39:06] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:39:06] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:39:06] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:39:07] [INFO ] Deduced a trap composed of 195 places in 359 ms of which 4 ms to minimize.
[2024-05-28 17:39:07] [INFO ] Deduced a trap composed of 168 places in 376 ms of which 4 ms to minimize.
[2024-05-28 17:39:07] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-05-28 17:39:08] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:39:08] [INFO ] Deduced a trap composed of 158 places in 396 ms of which 3 ms to minimize.
[2024-05-28 17:39:09] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 2 ms to minimize.
[2024-05-28 17:39:11] [INFO ] Deduced a trap composed of 40 places in 380 ms of which 4 ms to minimize.
[2024-05-28 17:39:11] [INFO ] Deduced a trap composed of 76 places in 339 ms of which 3 ms to minimize.
[2024-05-28 17:39:14] [INFO ] Deduced a trap composed of 272 places in 397 ms of which 3 ms to minimize.
[2024-05-28 17:39:15] [INFO ] Deduced a trap composed of 252 places in 339 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 20038 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 17:39:33] [INFO ] Deduced a trap composed of 206 places in 456 ms of which 4 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 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: 0/1609 constraints, Known Traps: 18/18 constraints]
After SMT, in 50150ms problems are : Problem set: 0 solved, 1609 unsolved
Search for dead transitions found 0 dead transitions in 50171ms
[2024-05-28 17:39:36] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 17:39:36] [INFO ] Invariant cache hit.
[2024-05-28 17:39:36] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-28 17:39:36] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 17:39:36] [INFO ] Invariant cache hit.
[2024-05-28 17:39:37] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:39:59] [INFO ] Implicit Places using invariants and state equation in 22531 ms returned []
Implicit Place search using SMT with State Equation took 23153 ms to find 0 implicit places.
[2024-05-28 17:39:59] [INFO ] Redundant transitions in 122 ms returned []
Running 1609 sub problems to find dead transitions.
[2024-05-28 17:39:59] [INFO ] Flow matrix only has 1581 transitions (discarded 32 similar events)
[2024-05-28 17:39:59] [INFO ] Invariant cache hit.
[2024-05-28 17:39:59] [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 17:40:20] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:40:20] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:40:20] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:40:20] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2024-05-28 17:40:20] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:40:20] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 4 ms to minimize.
[2024-05-28 17:40:20] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:40:21] [INFO ] Deduced a trap composed of 192 places in 396 ms of which 4 ms to minimize.
[2024-05-28 17:40:21] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:40:21] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 3 ms to minimize.
[2024-05-28 17:40:22] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 3 ms to minimize.
[2024-05-28 17:40:23] [INFO ] Deduced a trap composed of 158 places in 396 ms of which 4 ms to minimize.
[2024-05-28 17:40:25] [INFO ] Deduced a trap composed of 74 places in 346 ms of which 3 ms to minimize.
[2024-05-28 17:40:25] [INFO ] Deduced a trap composed of 73 places in 335 ms of which 3 ms to minimize.
[2024-05-28 17:40:34] [INFO ] Deduced a trap composed of 242 places in 340 ms of which 3 ms to minimize.
[2024-05-28 17:40:37] [INFO ] Deduced a trap composed of 213 places in 342 ms of which 3 ms to minimize.
[2024-05-28 17:40:37] [INFO ] Deduced a trap composed of 203 places in 440 ms of which 4 ms to minimize.
[2024-05-28 17:40:38] [INFO ] Deduced a trap composed of 123 places in 375 ms of which 4 ms to minimize.
[2024-05-28 17:40:38] [INFO ] Deduced a trap composed of 199 places in 358 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/2050 variables, and 57 constraints, problems are : Problem set: 0 solved, 1609 unsolved in 30031 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: 19/19 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, 19/57 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 57 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): 26/29 constraints, State Equation: 0/469 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1609 constraints, Known Traps: 19/19 constraints]
After SMT, in 69817ms problems are : Problem set: 0 solved, 1609 unsolved
Search for dead transitions found 0 dead transitions in 69842ms
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 143494 ms. Remains : 469/700 places, 1613/1844 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLFireability-00
Stuttering criterion allowed to conclude after 31689 steps with 0 reset in 247 ms.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T08-LTLFireability-00 finished in 143981 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 1 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 1 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 110 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 17:41:09] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
// Phase 1: matrix 1588 rows 476 cols
[2024-05-28 17:41:09] [INFO ] Computed 42 invariants in 38 ms
[2024-05-28 17:41:09] [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 17:41:28] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:41:30] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:41:33] [INFO ] Deduced a trap composed of 42 places in 149 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 20032 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 17:41:41] [INFO ] Deduced a trap composed of 48 places in 472 ms of which 3 ms to minimize.
[2024-05-28 17:41:41] [INFO ] Deduced a trap composed of 48 places in 358 ms of which 2 ms to minimize.
[2024-05-28 17:41:41] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2024-05-28 17:41:42] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2024-05-28 17:41:42] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:41:42] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 10 ms to minimize.
[2024-05-28 17:41:42] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 2 ms to minimize.
[2024-05-28 17:41:43] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:41:49] [INFO ] Deduced a trap composed of 48 places in 81 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 17:41:57] [INFO ] Deduced a trap composed of 45 places in 291 ms of which 3 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 20036 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 48949ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 48971ms
[2024-05-28 17:41:58] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 17:41:58] [INFO ] Invariant cache hit.
[2024-05-28 17:41:59] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-05-28 17:41:59] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 17:41:59] [INFO ] Invariant cache hit.
[2024-05-28 17:42:00] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:42:19] [INFO ] Implicit Places using invariants and state equation in 20287 ms returned []
Implicit Place search using SMT with State Equation took 21006 ms to find 0 implicit places.
[2024-05-28 17:42:19] [INFO ] Redundant transitions in 32 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-05-28 17:42:19] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-05-28 17:42:19] [INFO ] Invariant cache hit.
[2024-05-28 17:42:19] [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 17:42:40] [INFO ] Deduced a trap composed of 3 places in 119 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
Error getting values : (error "ParserException while parsing response: (timeout
(s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 2.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 4.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 2.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 2.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 4.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 3.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 2.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 4.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 2.0)
(s131 4.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 9.0)
(s156 1.0)
(s157 1.0)
(s158 3.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 4.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 2.0)
(s184 0.0)
(s185 1.0)
(s186 4.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 3.0)
(s213 2.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 4.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 3.0)
(s240 0.0)
(s241 2.0)
(s242 9.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 2.0)
(s252 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 2.0)
(s260 0.0)
(s261 0.0)
(s262 4.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 3.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 2.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 2.0)
(s304 0.0)
(s305 1.0)
(s306 4.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 4.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 3.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30053 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 17:43:01] [INFO ] Deduced a trap composed of 48 places in 520 ms of which 3 ms to minimize.
[2024-05-28 17:43:02] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 2 ms to minimize.
[2024-05-28 17:43:02] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:43:02] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:43:02] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-05-28 17:43:02] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2024-05-28 17:43:04] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:43:05] [INFO ] Deduced a trap composed of 48 places in 83 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 30043 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 69281ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69316ms
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 139461 ms. Remains : 476/700 places, 1620/1844 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T08-LTLFireability-01
Stuttering criterion allowed to conclude after 6908 steps with 0 reset in 62 ms.
FORMULA PolyORBLF-PT-S04J04T08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T08-LTLFireability-01 finished in 139614 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 95 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 17:43:29] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-28 17:43:29] [INFO ] Computed 42 invariants in 68 ms
[2024-05-28 17:43:29] [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 17:43:55] [INFO ] Deduced a trap composed of 3 places in 69 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 20055 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 17:44:08] [INFO ] Deduced a trap composed of 74 places in 537 ms of which 3 ms to minimize.
[2024-05-28 17:44:08] [INFO ] Deduced a trap composed of 74 places in 371 ms of which 4 ms to minimize.
[2024-05-28 17:44:08] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 3 ms to minimize.
[2024-05-28 17:44:09] [INFO ] Deduced a trap composed of 49 places in 363 ms of which 3 ms to minimize.
[2024-05-28 17:44:09] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:44:12] [INFO ] Deduced a trap composed of 130 places in 217 ms of which 6 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 20040 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 49746ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 49768ms
[2024-05-28 17:44:19] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:44:19] [INFO ] Invariant cache hit.
[2024-05-28 17:44:20] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-28 17:44:20] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:44:20] [INFO ] Invariant cache hit.
[2024-05-28 17:44:22] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:44:52] [INFO ] Performed 549/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 17:44:55] [INFO ] Implicit Places using invariants and state equation in 35361 ms returned []
Implicit Place search using SMT with State Equation took 36086 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-28 17:44:55] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 17:44:55] [INFO ] Invariant cache hit.
[2024-05-28 17:44:55] [INFO ] State equation strengthened by 160 read => feed constraints.

BK_STOP 1716918301391

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r290-tajo-171654446700276"
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 ;