fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445700323
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S06J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10740.271 3600000.00 9382713.00 588.00 FT?FTTFFFFTFFTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 25K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 329K Apr 11 16:52 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.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 160K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 538K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M 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-S06J04T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716870752063

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:32:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 04:32:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:32:34] [INFO ] Load time of PNML (sax parser for PT used): 647 ms
[2024-05-28 04:32:34] [INFO ] Transformed 632 places.
[2024-05-28 04:32:34] [INFO ] Transformed 10500 transitions.
[2024-05-28 04:32:34] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 958 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 55 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 98 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 358 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:32:35] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-05-28 04:32:36] [INFO ] Computed 48 invariants in 138 ms
[2024-05-28 04:32:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 37 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20121 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:33:21] [INFO ] Deduced a trap composed of 111 places in 324 ms of which 41 ms to minimize.
[2024-05-28 04:33:23] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 18 ms to minimize.
[2024-05-28 04:33:25] [INFO ] Deduced a trap composed of 84 places in 491 ms of which 4 ms to minimize.
[2024-05-28 04:33:25] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2024-05-28 04:33:25] [INFO ] Deduced a trap composed of 98 places in 440 ms of which 3 ms to minimize.
[2024-05-28 04:33:26] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-28 04:33:26] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 6 ms to minimize.
[2024-05-28 04:33:27] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-28 04:33:28] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 2 ms to minimize.
[2024-05-28 04:33:28] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 63427ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 63522ms
[2024-05-28 04:33:39] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:33:39] [INFO ] Invariant cache hit.
[2024-05-28 04:33:40] [INFO ] Implicit Places using invariants in 706 ms returned [86, 222, 347, 422, 509, 580]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 722 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/632 places, 2418/2430 transitions.
Applied a total of 0 rules in 29 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65084 ms. Remains : 608/632 places, 2418/2430 transitions.
Support contains 98 out of 608 places after structural reductions.
[2024-05-28 04:33:40] [INFO ] Flatten gal took : 321 ms
[2024-05-28 04:33:41] [INFO ] Flatten gal took : 189 ms
[2024-05-28 04:33:41] [INFO ] Input system was already deterministic with 2418 transitions.
RANDOM walk for 40000 steps (280 resets) in 3162 ms. (12 steps per ms) remains 11/27 properties
BEST_FIRST walk for 40004 steps (98 resets) in 397 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (102 resets) in 297 ms. (134 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (148 resets) in 497 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (120 resets) in 297 ms. (134 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (102 resets) in 405 ms. (98 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (110 resets) in 240 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (130 resets) in 700 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (135 resets) in 284 ms. (140 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (112 resets) in 179 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (115 resets) in 247 ms. (161 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (120 resets) in 342 ms. (116 steps per ms) remains 11/11 properties
[2024-05-28 04:33:44] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 04:33:44] [INFO ] Computed 42 invariants in 100 ms
[2024-05-28 04:33:44] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 193/249 variables, 12/12 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 2/14 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 5/254 variables, 2/16 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 1/17 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 7 (OVERLAPS) 343/597 variables, 17/34 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/599 variables, 2/36 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 11 (OVERLAPS) 9/608 variables, 6/42 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/42 constraints. Problems are: Problem set: 10 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2990/2990 variables, and 650 constraints, problems are : Problem set: 10 solved, 1 unsolved in 2419 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 608/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 508/521 variables, 12/13 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/572 variables, 14/27 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/27 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/606 variables, 14/41 constraints. Problems are: Problem set: 10 solved, 1 unsolved
[2024-05-28 04:33:47] [INFO ] Deduced a trap composed of 84 places in 642 ms of which 5 ms to minimize.
[2024-05-28 04:33:48] [INFO ] Deduced a trap composed of 84 places in 509 ms of which 4 ms to minimize.
[2024-05-28 04:33:48] [INFO ] Deduced a trap composed of 84 places in 594 ms of which 4 ms to minimize.
[2024-05-28 04:33:49] [INFO ] Deduced a trap composed of 110 places in 523 ms of which 4 ms to minimize.
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 606/2990 variables, and 45 constraints, problems are : Problem set: 11 solved, 0 unsolved in 2557 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 4/4 constraints]
After SMT, in 5175ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 6 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 24 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:33:49] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:33:49] [INFO ] Invariant cache hit.
[2024-05-28 04:33:49] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:34:30] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:34:34] [INFO ] Deduced a trap composed of 119 places in 599 ms of which 4 ms to minimize.
[2024-05-28 04:34:34] [INFO ] Deduced a trap composed of 119 places in 338 ms of which 3 ms to minimize.
[2024-05-28 04:34:34] [INFO ] Deduced a trap composed of 110 places in 319 ms of which 4 ms to minimize.
[2024-05-28 04:34:35] [INFO ] Deduced a trap composed of 84 places in 538 ms of which 3 ms to minimize.
[2024-05-28 04:34:35] [INFO ] Deduced a trap composed of 53 places in 477 ms of which 2 ms to minimize.
[2024-05-28 04:34:36] [INFO ] Deduced a trap composed of 66 places in 486 ms of which 3 ms to minimize.
[2024-05-28 04:34:36] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-28 04:34:36] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2024-05-28 04:34:36] [INFO ] Deduced a trap composed of 84 places in 106 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 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 61563ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61588ms
[2024-05-28 04:34:51] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:34:51] [INFO ] Invariant cache hit.
[2024-05-28 04:34:51] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-28 04:34:51] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:34:51] [INFO ] Invariant cache hit.
[2024-05-28 04:34:54] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:35:24] [INFO ] Performed 508/608 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 04:35:27] [INFO ] Implicit Places using invariants and state equation in 35730 ms returned []
Implicit Place search using SMT with State Equation took 36476 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:35:27] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:35:27] [INFO ] Invariant cache hit.
[2024-05-28 04:35:27] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:36:12] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-05-28 04:36:15] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:36:30] [INFO ] Deduced a trap composed of 47 places in 615 ms of which 4 ms to minimize.
[2024-05-28 04:36:31] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 2 ms to minimize.
[2024-05-28 04:36:31] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 2 ms to minimize.
[2024-05-28 04:36:31] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 4 ms to minimize.
[2024-05-28 04:36:31] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
[2024-05-28 04:36:32] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 2 ms to minimize.
[2024-05-28 04:36:39] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-05-28 04:36:50] [INFO ] Deduced a trap composed of 110 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 85429ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 85464ms
Finished structural reductions in LTL mode , in 1 iterations and 183569 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 151 ms :[p0, p0]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 1509 ms.
Product exploration explored 100000 steps with 50000 reset in 1706 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-01 finished in 187075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 608 transition count 2382
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 572 transition count 2376
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 566 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 84 place count 566 transition count 2304
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 228 place count 494 transition count 2304
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 360 place count 428 transition count 2238
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 364 place count 424 transition count 2234
Iterating global reduction 3 with 4 rules applied. Total rules applied 368 place count 424 transition count 2234
Applied a total of 368 rules in 363 ms. Remains 424 /608 variables (removed 184) and now considering 2234/2418 (removed 184) transitions.
Running 2228 sub problems to find dead transitions.
[2024-05-28 04:36:56] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
// Phase 1: matrix 2198 rows 424 cols
[2024-05-28 04:36:57] [INFO ] Computed 42 invariants in 103 ms
[2024-05-28 04:36:57] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:37:38] [INFO ] Deduced a trap composed of 54 places in 404 ms of which 3 ms to minimize.
[2024-05-28 04:37:39] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 2 ms to minimize.
[2024-05-28 04:37:39] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 1 ms to minimize.
[2024-05-28 04:37:39] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 04:37:39] [INFO ] Deduced a trap composed of 114 places in 497 ms of which 3 ms to minimize.
[2024-05-28 04:37:40] [INFO ] Deduced a trap composed of 133 places in 453 ms of which 4 ms to minimize.
[2024-05-28 04:37:40] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-28 04:37:40] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-28 04:37:40] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-28 04:37:41] [INFO ] Deduced a trap composed of 151 places in 488 ms of which 3 ms to minimize.
[2024-05-28 04:37:42] [INFO ] Deduced a trap composed of 139 places in 432 ms of which 3 ms to minimize.
[2024-05-28 04:37:44] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 48 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:37:52] [INFO ] Deduced a trap composed of 201 places in 518 ms of which 3 ms to minimize.
[2024-05-28 04:37:53] [INFO ] Deduced a trap composed of 68 places in 486 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 50 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 14/14 constraints]
After SMT, in 68150ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 68181ms
[2024-05-28 04:38:05] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:38:05] [INFO ] Invariant cache hit.
[2024-05-28 04:38:05] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-28 04:38:05] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:38:05] [INFO ] Invariant cache hit.
[2024-05-28 04:38:06] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:38:28] [INFO ] Implicit Places using invariants and state equation in 23064 ms returned []
Implicit Place search using SMT with State Equation took 23621 ms to find 0 implicit places.
[2024-05-28 04:38:28] [INFO ] Redundant transitions in 150 ms returned []
Running 2228 sub problems to find dead transitions.
[2024-05-28 04:38:28] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:38:28] [INFO ] Invariant cache hit.
[2024-05-28 04:38:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:39:05] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-28 04:39:05] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-28 04:39:06] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-28 04:39:06] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-28 04:39:06] [INFO ] Deduced a trap composed of 164 places in 486 ms of which 3 ms to minimize.
[2024-05-28 04:39:07] [INFO ] Deduced a trap composed of 15 places in 368 ms of which 3 ms to minimize.
[2024-05-28 04:39:07] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-28 04:39:07] [INFO ] Deduced a trap composed of 154 places in 579 ms of which 3 ms to minimize.
[2024-05-28 04:39:08] [INFO ] Deduced a trap composed of 164 places in 485 ms of which 8 ms to minimize.
[2024-05-28 04:39:08] [INFO ] Deduced a trap composed of 153 places in 483 ms of which 3 ms to minimize.
[2024-05-28 04:39:09] [INFO ] Deduced a trap composed of 138 places in 488 ms of which 3 ms to minimize.
[2024-05-28 04:39:09] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-28 04:39:10] [INFO ] Deduced a trap composed of 29 places in 430 ms of which 2 ms to minimize.
[2024-05-28 04:39:13] [INFO ] Deduced a trap composed of 238 places in 408 ms of which 3 ms to minimize.
[2024-05-28 04:39:14] [INFO ] Deduced a trap composed of 184 places in 352 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 51 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:39:30] [INFO ] Deduced a trap composed of 46 places in 395 ms of which 2 ms to minimize.
[2024-05-28 04:39:30] [INFO ] Deduced a trap composed of 86 places in 379 ms of which 2 ms to minimize.
[2024-05-28 04:39:32] [INFO ] Deduced a trap composed of 223 places in 456 ms of which 3 ms to minimize.
[2024-05-28 04:39:32] [INFO ] Deduced a trap composed of 208 places in 438 ms of which 2 ms to minimize.
[2024-05-28 04:39:33] [INFO ] Deduced a trap composed of 231 places in 488 ms of which 3 ms to minimize.
[2024-05-28 04:39:34] [INFO ] Deduced a trap composed of 218 places in 499 ms of which 3 ms to minimize.
[2024-05-28 04:39:34] [INFO ] Deduced a trap composed of 215 places in 492 ms of which 3 ms to minimize.
[2024-05-28 04:39:35] [INFO ] Deduced a trap composed of 193 places in 478 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 59 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 23/23 constraints]
After SMT, in 83944ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 83966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 424/608 places, 2234/2418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176308 ms. Remains : 424/608 places, 2234/2418 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-02
Product exploration explored 100000 steps with 1967 reset in 1157 ms.
Product exploration explored 100000 steps with 1964 reset in 953 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 328 steps (4 resets) in 10 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 2234/2234 transitions.
Applied a total of 0 rules in 49 ms. Remains 424 /424 variables (removed 0) and now considering 2234/2234 (removed 0) transitions.
Running 2228 sub problems to find dead transitions.
[2024-05-28 04:39:55] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:39:55] [INFO ] Invariant cache hit.
[2024-05-28 04:39:55] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:40:30] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-28 04:40:30] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-28 04:40:30] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-28 04:40:30] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2024-05-28 04:40:30] [INFO ] Deduced a trap composed of 164 places in 358 ms of which 2 ms to minimize.
[2024-05-28 04:40:31] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 1 ms to minimize.
[2024-05-28 04:40:31] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-28 04:40:31] [INFO ] Deduced a trap composed of 154 places in 391 ms of which 3 ms to minimize.
[2024-05-28 04:40:32] [INFO ] Deduced a trap composed of 164 places in 359 ms of which 2 ms to minimize.
[2024-05-28 04:40:32] [INFO ] Deduced a trap composed of 153 places in 378 ms of which 2 ms to minimize.
[2024-05-28 04:40:33] [INFO ] Deduced a trap composed of 138 places in 473 ms of which 3 ms to minimize.
[2024-05-28 04:40:33] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-28 04:40:33] [INFO ] Deduced a trap composed of 29 places in 362 ms of which 2 ms to minimize.
[2024-05-28 04:40:37] [INFO ] Deduced a trap composed of 238 places in 306 ms of which 2 ms to minimize.
[2024-05-28 04:40:38] [INFO ] Deduced a trap composed of 184 places in 328 ms of which 2 ms to minimize.
SMT process timed out in 42336ms, After SMT, problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 42360ms
[2024-05-28 04:40:38] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:40:38] [INFO ] Invariant cache hit.
[2024-05-28 04:40:38] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-28 04:40:38] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:40:38] [INFO ] Invariant cache hit.
[2024-05-28 04:40:39] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:41:01] [INFO ] Implicit Places using invariants and state equation in 23230 ms returned []
Implicit Place search using SMT with State Equation took 23773 ms to find 0 implicit places.
[2024-05-28 04:41:01] [INFO ] Redundant transitions in 74 ms returned []
Running 2228 sub problems to find dead transitions.
[2024-05-28 04:41:01] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:41:01] [INFO ] Invariant cache hit.
[2024-05-28 04:41:01] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:41:35] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-05-28 04:41:35] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-28 04:41:35] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-28 04:41:35] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-28 04:41:36] [INFO ] Deduced a trap composed of 164 places in 411 ms of which 3 ms to minimize.
[2024-05-28 04:41:36] [INFO ] Deduced a trap composed of 15 places in 338 ms of which 2 ms to minimize.
[2024-05-28 04:41:36] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-28 04:41:37] [INFO ] Deduced a trap composed of 154 places in 433 ms of which 2 ms to minimize.
[2024-05-28 04:41:37] [INFO ] Deduced a trap composed of 164 places in 444 ms of which 2 ms to minimize.
[2024-05-28 04:41:37] [INFO ] Deduced a trap composed of 153 places in 498 ms of which 3 ms to minimize.
[2024-05-28 04:41:38] [INFO ] Deduced a trap composed of 138 places in 427 ms of which 3 ms to minimize.
[2024-05-28 04:41:38] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-28 04:41:39] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 2 ms to minimize.
[2024-05-28 04:41:43] [INFO ] Deduced a trap composed of 238 places in 380 ms of which 3 ms to minimize.
[2024-05-28 04:41:43] [INFO ] Deduced a trap composed of 184 places in 469 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 51 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:42:00] [INFO ] Deduced a trap composed of 46 places in 454 ms of which 3 ms to minimize.
[2024-05-28 04:42:01] [INFO ] Deduced a trap composed of 86 places in 434 ms of which 3 ms to minimize.
[2024-05-28 04:42:02] [INFO ] Deduced a trap composed of 223 places in 583 ms of which 3 ms to minimize.
[2024-05-28 04:42:03] [INFO ] Deduced a trap composed of 208 places in 617 ms of which 5 ms to minimize.
[2024-05-28 04:42:04] [INFO ] Deduced a trap composed of 231 places in 580 ms of which 3 ms to minimize.
[2024-05-28 04:42:04] [INFO ] Deduced a trap composed of 218 places in 565 ms of which 3 ms to minimize.
[2024-05-28 04:42:05] [INFO ] Deduced a trap composed of 215 places in 487 ms of which 2 ms to minimize.
[2024-05-28 04:42:06] [INFO ] Deduced a trap composed of 193 places in 535 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 59 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 23/23 constraints]
After SMT, in 80451ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 80472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 146766 ms. Remains : 424/424 places, 2234/2234 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 432 steps (7 resets) in 17 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1984 reset in 1035 ms.
Product exploration explored 100000 steps with 1961 reset in 864 ms.
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 2234/2234 transitions.
Applied a total of 0 rules in 45 ms. Remains 424 /424 variables (removed 0) and now considering 2234/2234 (removed 0) transitions.
Running 2228 sub problems to find dead transitions.
[2024-05-28 04:42:24] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:42:24] [INFO ] Invariant cache hit.
[2024-05-28 04:42:24] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:42:59] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-05-28 04:42:59] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-28 04:42:59] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 0 ms to minimize.
[2024-05-28 04:42:59] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-28 04:42:59] [INFO ] Deduced a trap composed of 164 places in 448 ms of which 4 ms to minimize.
[2024-05-28 04:43:00] [INFO ] Deduced a trap composed of 15 places in 320 ms of which 2 ms to minimize.
[2024-05-28 04:43:00] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-05-28 04:43:00] [INFO ] Deduced a trap composed of 154 places in 428 ms of which 3 ms to minimize.
[2024-05-28 04:43:01] [INFO ] Deduced a trap composed of 164 places in 436 ms of which 3 ms to minimize.
[2024-05-28 04:43:01] [INFO ] Deduced a trap composed of 153 places in 381 ms of which 2 ms to minimize.
[2024-05-28 04:43:02] [INFO ] Deduced a trap composed of 138 places in 388 ms of which 2 ms to minimize.
[2024-05-28 04:43:02] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-28 04:43:02] [INFO ] Deduced a trap composed of 29 places in 305 ms of which 2 ms to minimize.
[2024-05-28 04:43:06] [INFO ] Deduced a trap composed of 238 places in 411 ms of which 3 ms to minimize.
SMT process timed out in 41359ms, After SMT, problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 41391ms
[2024-05-28 04:43:06] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:43:06] [INFO ] Invariant cache hit.
[2024-05-28 04:43:06] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-28 04:43:06] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:43:06] [INFO ] Invariant cache hit.
[2024-05-28 04:43:07] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:43:30] [INFO ] Implicit Places using invariants and state equation in 23582 ms returned []
Implicit Place search using SMT with State Equation took 24082 ms to find 0 implicit places.
[2024-05-28 04:43:30] [INFO ] Redundant transitions in 233 ms returned []
Running 2228 sub problems to find dead transitions.
[2024-05-28 04:43:30] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-05-28 04:43:30] [INFO ] Invariant cache hit.
[2024-05-28 04:43:30] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:44:02] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-28 04:44:02] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-28 04:44:02] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-28 04:44:02] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-28 04:44:02] [INFO ] Deduced a trap composed of 164 places in 464 ms of which 3 ms to minimize.
[2024-05-28 04:44:03] [INFO ] Deduced a trap composed of 15 places in 396 ms of which 2 ms to minimize.
[2024-05-28 04:44:03] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2024-05-28 04:44:03] [INFO ] Deduced a trap composed of 154 places in 509 ms of which 3 ms to minimize.
[2024-05-28 04:44:04] [INFO ] Deduced a trap composed of 164 places in 461 ms of which 4 ms to minimize.
[2024-05-28 04:44:04] [INFO ] Deduced a trap composed of 153 places in 505 ms of which 4 ms to minimize.
[2024-05-28 04:44:05] [INFO ] Deduced a trap composed of 138 places in 418 ms of which 2 ms to minimize.
[2024-05-28 04:44:05] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-05-28 04:44:06] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 2 ms to minimize.
[2024-05-28 04:44:09] [INFO ] Deduced a trap composed of 238 places in 397 ms of which 3 ms to minimize.
[2024-05-28 04:44:09] [INFO ] Deduced a trap composed of 184 places in 380 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 51 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-05-28 04:44:28] [INFO ] Deduced a trap composed of 46 places in 406 ms of which 5 ms to minimize.
[2024-05-28 04:44:28] [INFO ] Deduced a trap composed of 86 places in 375 ms of which 3 ms to minimize.
[2024-05-28 04:44:30] [INFO ] Deduced a trap composed of 223 places in 621 ms of which 4 ms to minimize.
[2024-05-28 04:44:30] [INFO ] Deduced a trap composed of 208 places in 645 ms of which 3 ms to minimize.
[2024-05-28 04:44:32] [INFO ] Deduced a trap composed of 231 places in 632 ms of which 4 ms to minimize.
[2024-05-28 04:44:32] [INFO ] Deduced a trap composed of 218 places in 518 ms of which 2 ms to minimize.
[2024-05-28 04:44:33] [INFO ] Deduced a trap composed of 215 places in 486 ms of which 3 ms to minimize.
[2024-05-28 04:44:34] [INFO ] Deduced a trap composed of 193 places in 507 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 59 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 23/23 constraints]
After SMT, in 79609ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 79634ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 145408 ms. Remains : 424/424 places, 2234/2234 transitions.
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-02 finished in 474022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 37 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 34 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:44:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 04:44:50] [INFO ] Computed 42 invariants in 81 ms
[2024-05-28 04:44:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:45:29] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 3 ms to minimize.
[2024-05-28 04:45:30] [INFO ] Deduced a trap composed of 3 places in 125 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 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:45:40] [INFO ] Deduced a trap composed of 84 places in 538 ms of which 4 ms to minimize.
[2024-05-28 04:45:40] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 0 ms to minimize.
[2024-05-28 04:45:40] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2024-05-28 04:45:44] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-28 04:45:44] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-05-28 04:45:44] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-05-28 04:45:46] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 4)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 3)
(s142 2)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 9)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 4)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(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 4)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 4)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 1)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 timeout
0)
(s350 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60514ms
[2024-05-28 04:45:51] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:45:51] [INFO ] Invariant cache hit.
[2024-05-28 04:45:52] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-28 04:45:52] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:45:52] [INFO ] Invariant cache hit.
[2024-05-28 04:45:54] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:46:16] [INFO ] Implicit Places using invariants and state equation in 24568 ms returned []
Implicit Place search using SMT with State Equation took 25420 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:46:16] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:46:16] [INFO ] Invariant cache hit.
[2024-05-28 04:46:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:47:03] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 3 ms to minimize.
[2024-05-28 04:47:07] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:47:23] [INFO ] Deduced a trap composed of 47 places in 613 ms of which 4 ms to minimize.
[2024-05-28 04:47:23] [INFO ] Deduced a trap composed of 84 places in 231 ms of which 2 ms to minimize.
[2024-05-28 04:47:23] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 2 ms to minimize.
[2024-05-28 04:47:23] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 1 ms to minimize.
[2024-05-28 04:47:23] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-05-28 04:47:24] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-28 04:47:32] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 87193ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 87225ms
Finished structural reductions in LTL mode , in 1 iterations and 173207 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-07
Stuttering criterion allowed to conclude after 454 steps with 5 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-07 finished in 173452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 4 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 23 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:47:44] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:47:44] [INFO ] Invariant cache hit.
[2024-05-28 04:47:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 31 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:48:29] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-05-28 04:48:29] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-28 04:48:30] [INFO ] Deduced a trap composed of 35 places in 613 ms of which 4 ms to minimize.
[2024-05-28 04:48:31] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 2 ms to minimize.
[2024-05-28 04:48:31] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 1 ms to minimize.
[2024-05-28 04:48:31] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-05-28 04:48:35] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 3)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 4)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 3)
(s142 2)
(s143 2)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 4)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 9)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 4)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 2)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 3)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 6)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 2)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 1)
(s276 1)
(s277 1)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 4)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s300 timeout
0)
(s301 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 7/7 constraints]
After SMT, in 64197ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 64221ms
[2024-05-28 04:48:48] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:48:48] [INFO ] Invariant cache hit.
[2024-05-28 04:48:49] [INFO ] Implicit Places using invariants in 918 ms returned []
[2024-05-28 04:48:49] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:48:49] [INFO ] Invariant cache hit.
[2024-05-28 04:48:51] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:49:21] [INFO ] Implicit Places using invariants and state equation in 32205 ms returned []
Implicit Place search using SMT with State Equation took 33128 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:49:21] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:49:21] [INFO ] Invariant cache hit.
[2024-05-28 04:49:21] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:50:05] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 3 ms to minimize.
[2024-05-28 04:50:10] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 3.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 9.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 4.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 4.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 3.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 4.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 3.0)
(s142 2.0)
(s143 2.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 4.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 9.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 4.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 2.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 3.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 6.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 2.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 4.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 2.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 2.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 4.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 2.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 2.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 3.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 2.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 1.0)
(s464 2.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 3.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 4.0)
(s503 0.0)
(s504 4.0)
(s505 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:50:23] [INFO ] Deduced a trap composed of 47 places in 676 ms of which 4 ms to minimize.
[2024-05-28 04:50:23] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 3 ms to minimize.
[2024-05-28 04:50:23] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2024-05-28 04:50:24] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-28 04:50:24] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-28 04:50:24] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-05-28 04:50:32] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-05-28 04:50:43] [INFO ] Deduced a trap composed of 110 places in 195 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 83338ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 83371ms
Finished structural reductions in LTL mode , in 1 iterations and 180765 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 978 steps with 12 reset in 15 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-08 finished in 180979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(!p0))))'
Support contains 1 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 32 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:50:45] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:50:45] [INFO ] Invariant cache hit.
[2024-05-28 04:50:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:51:30] [INFO ] Deduced a trap composed of 3 places in 125 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 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:51:33] [INFO ] Deduced a trap composed of 119 places in 606 ms of which 4 ms to minimize.
[2024-05-28 04:51:33] [INFO ] Deduced a trap composed of 119 places in 412 ms of which 4 ms to minimize.
[2024-05-28 04:51:34] [INFO ] Deduced a trap composed of 110 places in 371 ms of which 4 ms to minimize.
[2024-05-28 04:51:34] [INFO ] Deduced a trap composed of 84 places in 559 ms of which 3 ms to minimize.
[2024-05-28 04:51:35] [INFO ] Deduced a trap composed of 53 places in 467 ms of which 2 ms to minimize.
[2024-05-28 04:51:35] [INFO ] Deduced a trap composed of 66 places in 424 ms of which 2 ms to minimize.
[2024-05-28 04:51:35] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-05-28 04:51:36] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
[2024-05-28 04:51:36] [INFO ] Deduced a trap composed of 84 places in 87 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 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 65679ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 65718ms
[2024-05-28 04:51:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:51:50] [INFO ] Invariant cache hit.
[2024-05-28 04:51:51] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-28 04:51:51] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:51:51] [INFO ] Invariant cache hit.
[2024-05-28 04:51:53] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:52:10] [INFO ] Implicit Places using invariants and state equation in 19256 ms returned []
Implicit Place search using SMT with State Equation took 19958 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:52:10] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:52:10] [INFO ] Invariant cache hit.
[2024-05-28 04:52:10] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:52:52] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-28 04:52:55] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:53:11] [INFO ] Deduced a trap composed of 47 places in 588 ms of which 3 ms to minimize.
[2024-05-28 04:53:11] [INFO ] Deduced a trap composed of 84 places in 254 ms of which 3 ms to minimize.
[2024-05-28 04:53:11] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 3 ms to minimize.
[2024-05-28 04:53:11] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-28 04:53:12] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 1 ms to minimize.
[2024-05-28 04:53:12] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-05-28 04:53:20] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 1 ms to minimize.
[2024-05-28 04:53:31] [INFO ] Deduced a trap composed of 110 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 82151ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 82193ms
Finished structural reductions in LTL mode , in 1 iterations and 167923 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), false, false, false, p0]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-09 finished in 168137 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)||G(p1))))'
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 608 transition count 2376
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 566 transition count 2376
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 84 place count 566 transition count 2305
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 226 place count 495 transition count 2305
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 370 place count 423 transition count 2233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 374 place count 419 transition count 2229
Iterating global reduction 2 with 4 rules applied. Total rules applied 378 place count 419 transition count 2229
Applied a total of 378 rules in 231 ms. Remains 419 /608 variables (removed 189) and now considering 2229/2418 (removed 189) transitions.
Running 2223 sub problems to find dead transitions.
[2024-05-28 04:53:33] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
// Phase 1: matrix 2193 rows 419 cols
[2024-05-28 04:53:33] [INFO ] Computed 42 invariants in 78 ms
[2024-05-28 04:53:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 04:54:08] [INFO ] Deduced a trap composed of 107 places in 313 ms of which 2 ms to minimize.
[2024-05-28 04:54:08] [INFO ] Deduced a trap composed of 139 places in 395 ms of which 3 ms to minimize.
[2024-05-28 04:54:09] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 1 ms to minimize.
[2024-05-28 04:54:11] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 1 ms to minimize.
[2024-05-28 04:54:11] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 1 ms to minimize.
[2024-05-28 04:54:13] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 41 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 04:54:22] [INFO ] Deduced a trap composed of 55 places in 284 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 42 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 7/7 constraints]
After SMT, in 62109ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 62143ms
[2024-05-28 04:54:35] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 04:54:35] [INFO ] Invariant cache hit.
[2024-05-28 04:54:36] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-05-28 04:54:36] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 04:54:36] [INFO ] Invariant cache hit.
[2024-05-28 04:54:37] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:54:53] [INFO ] Implicit Places using invariants and state equation in 17226 ms returned []
Implicit Place search using SMT with State Equation took 17932 ms to find 0 implicit places.
[2024-05-28 04:54:53] [INFO ] Redundant transitions in 137 ms returned []
Running 2223 sub problems to find dead transitions.
[2024-05-28 04:54:53] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-05-28 04:54:53] [INFO ] Invariant cache hit.
[2024-05-28 04:54:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 04:55:26] [INFO ] Deduced a trap composed of 113 places in 389 ms of which 3 ms to minimize.
[2024-05-28 04:55:27] [INFO ] Deduced a trap composed of 137 places in 370 ms of which 2 ms to minimize.
[2024-05-28 04:55:27] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 1 ms to minimize.
[2024-05-28 04:55:27] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 1 ms to minimize.
[2024-05-28 04:55:28] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 1 ms to minimize.
[2024-05-28 04:55:28] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 41 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-05-28 04:55:48] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-28 04:55:48] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-28 04:55:48] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-28 04:55:52] [INFO ] Deduced a trap composed of 133 places in 236 ms of which 2 ms to minimize.
[2024-05-28 04:56:12] [INFO ] Deduced a trap composed of 78 places in 239 ms of which 2 ms to minimize.
[2024-05-28 04:56:12] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 2 ms to minimize.
[2024-05-28 04:56:12] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 48 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 13/13 constraints]
After SMT, in 80718ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 80743ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/608 places, 2229/2418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161217 ms. Remains : 419/608 places, 2229/2418 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-12
Stuttering criterion allowed to conclude after 3705 steps with 32 reset in 54 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-12 finished in 161387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G((p1&&F(p0)))))))'
Support contains 4 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 34 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:56:14] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 04:56:14] [INFO ] Computed 42 invariants in 47 ms
[2024-05-28 04:56:14] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:56:53] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 2 ms to minimize.
[2024-05-28 04:56:55] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:57:04] [INFO ] Deduced a trap composed of 84 places in 427 ms of which 3 ms to minimize.
[2024-05-28 04:57:05] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-05-28 04:57:05] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2024-05-28 04:57:08] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 1 ms to minimize.
[2024-05-28 04:57:08] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 0 ms to minimize.
[2024-05-28 04:57:08] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-05-28 04:57:11] [INFO ] Deduced a trap composed of 15 places in 116 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 Int declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 61058ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61083ms
[2024-05-28 04:57:15] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:57:15] [INFO ] Invariant cache hit.
[2024-05-28 04:57:16] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-28 04:57:16] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:57:16] [INFO ] Invariant cache hit.
[2024-05-28 04:57:18] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 04:57:41] [INFO ] Implicit Places using invariants and state equation in 24845 ms returned []
Implicit Place search using SMT with State Equation took 25568 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:57:41] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:57:41] [INFO ] Invariant cache hit.
[2024-05-28 04:57:41] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:58:19] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-28 04:58:22] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:58:38] [INFO ] Deduced a trap composed of 47 places in 456 ms of which 2 ms to minimize.
[2024-05-28 04:58:38] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 7 ms to minimize.
[2024-05-28 04:58:38] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 1 ms to minimize.
[2024-05-28 04:58:38] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 1 ms to minimize.
[2024-05-28 04:58:39] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-05-28 04:58:39] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-28 04:58:46] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-05-28 04:58:56] [INFO ] Deduced a trap composed of 110 places in 146 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 Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 79828ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 79852ms
Finished structural reductions in LTL mode , in 1 iterations and 166549 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 1566 ms.
Product exploration explored 100000 steps with 50000 reset in 1415 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 49 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-13 finished in 169806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 18 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 04:59:04] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 04:59:04] [INFO ] Invariant cache hit.
[2024-05-28 04:59:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:59:43] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 04:59:46] [INFO ] Deduced a trap composed of 119 places in 521 ms of which 4 ms to minimize.
[2024-05-28 04:59:47] [INFO ] Deduced a trap composed of 119 places in 325 ms of which 4 ms to minimize.
[2024-05-28 04:59:47] [INFO ] Deduced a trap composed of 110 places in 278 ms of which 3 ms to minimize.
[2024-05-28 04:59:47] [INFO ] Deduced a trap composed of 84 places in 457 ms of which 2 ms to minimize.
[2024-05-28 04:59:48] [INFO ] Deduced a trap composed of 53 places in 417 ms of which 2 ms to minimize.
[2024-05-28 04:59:48] [INFO ] Deduced a trap composed of 66 places in 407 ms of which 2 ms to minimize.
[2024-05-28 04:59:48] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-05-28 04:59:48] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 13 ms to minimize.
[2024-05-28 04:59:49] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 59899ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59921ms
[2024-05-28 05:00:04] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 05:00:04] [INFO ] Invariant cache hit.
[2024-05-28 05:00:04] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-28 05:00:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 05:00:05] [INFO ] Invariant cache hit.
[2024-05-28 05:00:07] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:00:35] [INFO ] Implicit Places using invariants and state equation in 30760 ms returned []
Implicit Place search using SMT with State Equation took 31446 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 05:00:35] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 05:00:35] [INFO ] Invariant cache hit.
[2024-05-28 05:00:35] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 05:01:15] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-28 05:01:18] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 05:01:33] [INFO ] Deduced a trap composed of 47 places in 485 ms of which 2 ms to minimize.
[2024-05-28 05:01:33] [INFO ] Deduced a trap composed of 84 places in 181 ms of which 3 ms to minimize.
[2024-05-28 05:01:33] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 26 ms to minimize.
[2024-05-28 05:01:34] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-28 05:01:34] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-05-28 05:01:34] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-28 05:01:41] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 0 ms to minimize.
[2024-05-28 05:01:52] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 79559ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 79721ms
Finished structural reductions in LTL mode , in 1 iterations and 171125 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 1512 ms.
Product exploration explored 100000 steps with 50000 reset in 1405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 39 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-14 finished in 174217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 05:01:58] [INFO ] Flatten gal took : 142 ms
[2024-05-28 05:01:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 05:01:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 608 places, 2418 transitions and 14802 arcs took 43 ms.
Total runtime 1765383 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J04T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 608
TRANSITIONS: 2418
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.086s, Sys 0.010s]


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


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

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

Process ID: 1891
MODEL NAME: /home/mcc/execution/419/model
608 places, 2418 transitions.

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..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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