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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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-COL-S04J06T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716852522889

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:28:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 23:28:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:28:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 23:28:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:28:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 764 ms
[2024-05-27 23:28:45] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:28:45] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 23:28:45] [INFO ] Skeletonized 13 HLPN properties in 3 ms. Removed 2 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 63 to 61
RANDOM walk for 40000 steps (13 resets) in 2248 ms. (17 steps per ms) remains 9/61 properties
BEST_FIRST walk for 40002 steps (8 resets) in 318 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (12 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (10 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (11 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 136 ms. (291 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 9/9 properties
[2024-05-27 23:28:46] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 23:28:46] [INFO ] Computed 26 invariants in 6 ms
[2024-05-27 23:28:46] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 9 solved, 0 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
[2024-05-27 23:28:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-27 23:28:47] [INFO ] Flatten gal took : 26 ms
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:28:47] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 23:28:47] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 89 ms.
[2024-05-27 23:28:47] [INFO ] Unfolded 13 HLPN properties in 2 ms.
[2024-05-27 23:28:47] [INFO ] Reduced 48 identical enabling conditions.
[2024-05-27 23:28:47] [INFO ] Reduced 352 identical enabling conditions.
[2024-05-27 23:28:47] [INFO ] Reduced 1768 identical enabling conditions.
[2024-05-27 23:28:47] [INFO ] Reduced 352 identical enabling conditions.
[2024-05-27 23:28:47] [INFO ] Reduced 1768 identical enabling conditions.
[2024-05-27 23:28:47] [INFO ] Reduced 1768 identical enabling conditions.
[2024-05-27 23:28:47] [INFO ] Reduced 352 identical enabling conditions.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 734 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Applied a total of 0 rules in 34 ms. Remains 792 /792 variables (removed 0) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-05-27 23:28:47] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2024-05-27 23:28:47] [INFO ] Computed 58 invariants in 98 ms
[2024-05-27 23:28:47] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 28781ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 28829ms
[2024-05-27 23:29:16] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-27 23:29:16] [INFO ] Invariant cache hit.
[2024-05-27 23:29:16] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-27 23:29:16] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-27 23:29:16] [INFO ] Invariant cache hit.
[2024-05-27 23:29:17] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:29:23] [INFO ] Implicit Places using invariants and state equation in 7365 ms returned []
Implicit Place search using SMT with State Equation took 7596 ms to find 0 implicit places.
Running 2096 sub problems to find dead transitions.
[2024-05-27 23:29:23] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-27 23:29:23] [INFO ] Invariant cache hit.
[2024-05-27 23:29:23] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-27 23:29:58] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 12 ms to minimize.
[2024-05-27 23:30:02] [INFO ] Deduced a trap composed of 49 places in 416 ms of which 5 ms to minimize.
[2024-05-27 23:30:02] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 2 ms to minimize.
[2024-05-27 23:30:02] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:30:02] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-27 23:30:02] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:30:02] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:30:02] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/2860 variables, and 58 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-27 23:30:05] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:30:07] [INFO ] Deduced a trap composed of 164 places in 482 ms of which 10 ms to minimize.
[2024-05-27 23:30:07] [INFO ] Deduced a trap composed of 215 places in 410 ms of which 5 ms to minimize.
[2024-05-27 23:30:07] [INFO ] Deduced a trap composed of 222 places in 388 ms of which 4 ms to minimize.
[2024-05-27 23:30:08] [INFO ] Deduced a trap composed of 207 places in 385 ms of which 5 ms to minimize.
[2024-05-27 23:30:09] [INFO ] Deduced a trap composed of 396 places in 496 ms of which 5 ms to minimize.
[2024-05-27 23:30:10] [INFO ] Deduced a trap composed of 456 places in 435 ms of which 4 ms to minimize.
[2024-05-27 23:30:23] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
[2024-05-27 23:30:25] [INFO ] Deduced a trap composed of 425 places in 576 ms of which 5 ms to minimize.
[2024-05-27 23:30:25] [INFO ] Deduced a trap composed of 426 places in 499 ms of which 4 ms to minimize.
[2024-05-27 23:30:26] [INFO ] Deduced a trap composed of 391 places in 481 ms of which 5 ms to minimize.
[2024-05-27 23:30:26] [INFO ] Deduced a trap composed of 407 places in 520 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/2860 variables, and 70 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 20/20 constraints]
After SMT, in 69660ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 69691ms
Finished structural reductions in LTL mode , in 1 iterations and 106197 ms. Remains : 792/792 places, 2100/2100 transitions.
Support contains 734 out of 792 places after structural reductions.
[2024-05-27 23:30:33] [INFO ] Flatten gal took : 215 ms
[2024-05-27 23:30:34] [INFO ] Flatten gal took : 175 ms
[2024-05-27 23:30:35] [INFO ] Input system was already deterministic with 2100 transitions.
Support contains 726 out of 792 places (down from 734) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 62 to 61
RANDOM walk for 40001 steps (8 resets) in 934 ms. (42 steps per ms) remains 7/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1489 ms. (26 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 721 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 774 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 640 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 703 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 445 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 267 ms. (149 steps per ms) remains 7/7 properties
[2024-05-27 23:30:36] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-27 23:30:36] [INFO ] Invariant cache hit.
[2024-05-27 23:30:36] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 98/409 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 12/421 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 6 (OVERLAPS) 355/776 variables, 34/47 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/47 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/780 variables, 4/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 0/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
After SMT solving in domain Real declared 792/2860 variables, and 58 constraints, problems are : Problem set: 7 solved, 0 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3408ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2024-05-27 23:30:40] [INFO ] Flatten gal took : 103 ms
[2024-05-27 23:30:40] [INFO ] Flatten gal took : 121 ms
[2024-05-27 23:30:41] [INFO ] Input system was already deterministic with 2100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 772 transition count 2084
Applied a total of 36 rules in 110 ms. Remains 772 /792 variables (removed 20) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:30:41] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-05-27 23:30:41] [INFO ] Computed 54 invariants in 83 ms
[2024-05-27 23:30:41] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 45 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-27 23:31:13] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 4 ms to minimize.
[2024-05-27 23:31:21] [INFO ] Deduced a trap composed of 82 places in 482 ms of which 5 ms to minimize.
[2024-05-27 23:31:21] [INFO ] Deduced a trap composed of 82 places in 300 ms of which 5 ms to minimize.
[2024-05-27 23:31:22] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 5 ms to minimize.
[2024-05-27 23:31:22] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 4 ms to minimize.
[2024-05-27 23:31:22] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2024-05-27 23:31:22] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-05-27 23:31:23] [INFO ] Deduced a trap composed of 41 places in 453 ms of which 3 ms to minimize.
[2024-05-27 23:31:23] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-27 23:31:23] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 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 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 9)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 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 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 1)
(s386 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 55 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 10/10 constraints]
After SMT, in 49644ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49665ms
Finished structural reductions in LTL mode , in 1 iterations and 49780 ms. Remains : 772/792 places, 2084/2100 transitions.
[2024-05-27 23:31:31] [INFO ] Flatten gal took : 131 ms
[2024-05-27 23:31:31] [INFO ] Flatten gal took : 109 ms
[2024-05-27 23:31:31] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 716 transition count 2028
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 144 place count 716 transition count 1988
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 224 place count 676 transition count 1988
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 384 place count 596 transition count 1908
Applied a total of 384 rules in 342 ms. Remains 596 /792 variables (removed 196) and now considering 1908/2100 (removed 192) transitions.
Running 1904 sub problems to find dead transitions.
[2024-05-27 23:31:31] [INFO ] Flow matrix only has 1876 transitions (discarded 32 similar events)
// Phase 1: matrix 1876 rows 596 cols
[2024-05-27 23:31:31] [INFO ] Computed 54 invariants in 65 ms
[2024-05-27 23:31:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-05-27 23:31:55] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-27 23:31:55] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:31:55] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-27 23:31:55] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-27 23:31:56] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 3 ms to minimize.
[2024-05-27 23:31:56] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-27 23:31:56] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 2 ms to minimize.
[2024-05-27 23:31:56] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2024-05-27 23:31:56] [INFO ] Deduced a trap composed of 285 places in 453 ms of which 4 ms to minimize.
[2024-05-27 23:31:57] [INFO ] Deduced a trap composed of 316 places in 426 ms of which 5 ms to minimize.
[2024-05-27 23:31:57] [INFO ] Deduced a trap composed of 390 places in 445 ms of which 4 ms to minimize.
[2024-05-27 23:31:58] [INFO ] Deduced a trap composed of 299 places in 426 ms of which 3 ms to minimize.
[2024-05-27 23:31:58] [INFO ] Deduced a trap composed of 271 places in 432 ms of which 4 ms to minimize.
[2024-05-27 23:31:59] [INFO ] Deduced a trap composed of 275 places in 448 ms of which 5 ms to minimize.
[2024-05-27 23:32:01] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 3 ms to minimize.
SMT process timed out in 29178ms, After SMT, problems are : Problem set: 0 solved, 1904 unsolved
Search for dead transitions found 0 dead transitions in 29199ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 29546 ms. Remains : 596/792 places, 1908/2100 transitions.
[2024-05-27 23:32:01] [INFO ] Flatten gal took : 99 ms
[2024-05-27 23:32:01] [INFO ] Flatten gal took : 111 ms
[2024-05-27 23:32:01] [INFO ] Input system was already deterministic with 1908 transitions.
RANDOM walk for 139 steps (0 resets) in 8 ms. (15 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Applied a total of 20 rules in 39 ms. Remains 780 /792 variables (removed 12) and now considering 2092/2100 (removed 8) transitions.
Running 2088 sub problems to find dead transitions.
[2024-05-27 23:32:01] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 780 cols
[2024-05-27 23:32:01] [INFO ] Computed 54 invariants in 62 ms
[2024-05-27 23:32:01] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 10.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s391 0.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.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 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 9.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 2.0)
(s553 2.0)
(s554 2.0)
(s555 2.0)
(s556 2.0)
(s557 2.0)
(s558 2.0)
(s559 2.0)
(s560 3.0)
(s561 3.0)
(s562 3.0)
(s563 3.0)
(s564 3.0)
(s565 3.0)
(s566 3.0)
(s567 3.0)
(s568 4.0)
(s569 4.0)
(s570 4.0)
(s571 4.0)
(s572 4.0)
(s573 4.0)
(s574 4.0)
(s575 4.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 4.0)
(s609 4.0)
(s610 4.0)
(s611 4.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)timeout

(s617 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
SMT process timed out in 30188ms, After SMT, problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 30215ms
Finished structural reductions in LTL mode , in 1 iterations and 30261 ms. Remains : 780/792 places, 2092/2100 transitions.
[2024-05-27 23:32:31] [INFO ] Flatten gal took : 68 ms
[2024-05-27 23:32:31] [INFO ] Flatten gal took : 74 ms
[2024-05-27 23:32:31] [INFO ] Input system was already deterministic with 2092 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 788 transition count 2068
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 756 transition count 2060
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 80 place count 748 transition count 2060
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 80 place count 748 transition count 1980
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 240 place count 668 transition count 1980
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 248 place count 660 transition count 1972
Iterating global reduction 3 with 8 rules applied. Total rules applied 256 place count 660 transition count 1972
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 352 place count 612 transition count 1924
Applied a total of 352 rules in 110 ms. Remains 612 /792 variables (removed 180) and now considering 1924/2100 (removed 176) transitions.
Running 1920 sub problems to find dead transitions.
[2024-05-27 23:32:32] [INFO ] Flow matrix only has 1892 transitions (discarded 32 similar events)
// Phase 1: matrix 1892 rows 612 cols
[2024-05-27 23:32:32] [INFO ] Computed 54 invariants in 31 ms
[2024-05-27 23:32:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
[2024-05-27 23:32:57] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-05-27 23:32:58] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:32:58] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:32:58] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:32:58] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-05-27 23:32:58] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:32:58] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2504 variables, and 57 constraints, problems are : Problem set: 0 solved, 1920 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/612 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1920/1920 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
[2024-05-27 23:33:03] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:33:04] [INFO ] Deduced a trap composed of 293 places in 466 ms of which 4 ms to minimize.
[2024-05-27 23:33:04] [INFO ] Deduced a trap composed of 323 places in 454 ms of which 5 ms to minimize.
[2024-05-27 23:33:05] [INFO ] Deduced a trap composed of 304 places in 400 ms of which 4 ms to minimize.
[2024-05-27 23:33:05] [INFO ] Deduced a trap composed of 300 places in 344 ms of which 3 ms to minimize.
[2024-05-27 23:33:06] [INFO ] Deduced a trap composed of 330 places in 391 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2504 variables, and 63 constraints, problems are : Problem set: 0 solved, 1920 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/612 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1920 constraints, Known Traps: 13/13 constraints]
After SMT, in 49153ms problems are : Problem set: 0 solved, 1920 unsolved
Search for dead transitions found 0 dead transitions in 49171ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 49285 ms. Remains : 612/792 places, 1924/2100 transitions.
[2024-05-27 23:33:21] [INFO ] Flatten gal took : 108 ms
[2024-05-27 23:33:21] [INFO ] Flatten gal took : 114 ms
[2024-05-27 23:33:21] [INFO ] Input system was already deterministic with 1924 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 772 transition count 2084
Applied a total of 36 rules in 40 ms. Remains 772 /792 variables (removed 20) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:33:21] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-05-27 23:33:21] [INFO ] Computed 54 invariants in 46 ms
[2024-05-27 23:33:21] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 29693ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 29716ms
Finished structural reductions in LTL mode , in 1 iterations and 29763 ms. Remains : 772/792 places, 2084/2100 transitions.
[2024-05-27 23:33:51] [INFO ] Flatten gal took : 73 ms
[2024-05-27 23:33:51] [INFO ] Flatten gal took : 79 ms
[2024-05-27 23:33:51] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Applied a total of 4 rules in 13 ms. Remains 788 /792 variables (removed 4) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-05-27 23:33:51] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 788 cols
[2024-05-27 23:33:51] [INFO ] Computed 54 invariants in 53 ms
[2024-05-27 23:33:51] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 29240ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 29258ms
Finished structural reductions in LTL mode , in 1 iterations and 29275 ms. Remains : 788/792 places, 2100/2100 transitions.
[2024-05-27 23:34:21] [INFO ] Flatten gal took : 88 ms
[2024-05-27 23:34:21] [INFO ] Flatten gal took : 107 ms
[2024-05-27 23:34:21] [INFO ] Input system was already deterministic with 2100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 772 transition count 2084
Applied a total of 36 rules in 42 ms. Remains 772 /792 variables (removed 20) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:34:21] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-05-27 23:34:21] [INFO ] Computed 54 invariants in 37 ms
[2024-05-27 23:34:21] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 31438ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 31466ms
Finished structural reductions in LTL mode , in 1 iterations and 31514 ms. Remains : 772/792 places, 2084/2100 transitions.
[2024-05-27 23:34:53] [INFO ] Flatten gal took : 85 ms
[2024-05-27 23:34:53] [INFO ] Flatten gal took : 117 ms
[2024-05-27 23:34:53] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 788 transition count 2036
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 724 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 128 place count 724 transition count 1940
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 320 place count 628 transition count 1940
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 464 place count 556 transition count 1868
Applied a total of 464 rules in 90 ms. Remains 556 /792 variables (removed 236) and now considering 1868/2100 (removed 232) transitions.
Running 1864 sub problems to find dead transitions.
[2024-05-27 23:34:53] [INFO ] Flow matrix only has 1836 transitions (discarded 32 similar events)
// Phase 1: matrix 1836 rows 556 cols
[2024-05-27 23:34:53] [INFO ] Computed 54 invariants in 24 ms
[2024-05-27 23:34:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
[2024-05-27 23:35:20] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 4 ms to minimize.
[2024-05-27 23:35:21] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 3 ms to minimize.
[2024-05-27 23:35:21] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 2 ms to minimize.
[2024-05-27 23:35:21] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 2 ms to minimize.
[2024-05-27 23:35:21] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-27 23:35:21] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-27 23:35:21] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 0 ms to minimize.
[2024-05-27 23:35:22] [INFO ] Deduced a trap composed of 256 places in 382 ms of which 3 ms to minimize.
[2024-05-27 23:35:22] [INFO ] Deduced a trap composed of 227 places in 410 ms of which 3 ms to minimize.
[2024-05-27 23:35:23] [INFO ] Deduced a trap composed of 272 places in 491 ms of which 3 ms to minimize.
[2024-05-27 23:35:23] [INFO ] Deduced a trap composed of 229 places in 444 ms of which 4 ms to minimize.
[2024-05-27 23:35:24] [INFO ] Deduced a trap composed of 261 places in 416 ms of which 4 ms to minimize.
[2024-05-27 23:35:24] [INFO ] Deduced a trap composed of 241 places in 362 ms of which 3 ms to minimize.
[2024-05-27 23:35:24] [INFO ] Deduced a trap composed of 248 places in 351 ms of which 7 ms to minimize.
[2024-05-27 23:35:25] [INFO ] Deduced a trap composed of 243 places in 339 ms of which 4 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 552/2392 variables, and 65 constraints, problems are : Problem set: 0 solved, 1864 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/556 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1864/1864 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/2392 variables, and 65 constraints, problems are : Problem set: 0 solved, 1864 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/556 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1864 constraints, Known Traps: 15/15 constraints]
After SMT, in 52078ms problems are : Problem set: 0 solved, 1864 unsolved
Search for dead transitions found 0 dead transitions in 52110ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 52204 ms. Remains : 556/792 places, 1868/2100 transitions.
[2024-05-27 23:35:45] [INFO ] Flatten gal took : 68 ms
[2024-05-27 23:35:45] [INFO ] Flatten gal took : 81 ms
[2024-05-27 23:35:46] [INFO ] Input system was already deterministic with 1868 transitions.
RANDOM walk for 105 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 788 transition count 2044
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 732 transition count 2036
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 724 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 128 place count 724 transition count 1940
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 320 place count 628 transition count 1940
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 480 place count 548 transition count 1860
Applied a total of 480 rules in 87 ms. Remains 548 /792 variables (removed 244) and now considering 1860/2100 (removed 240) transitions.
Running 1856 sub problems to find dead transitions.
[2024-05-27 23:35:46] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
// Phase 1: matrix 1828 rows 548 cols
[2024-05-27 23:35:46] [INFO ] Computed 54 invariants in 37 ms
[2024-05-27 23:35:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-27 23:36:10] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-27 23:36:10] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-27 23:36:10] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:36:10] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:36:10] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 0 ms to minimize.
[2024-05-27 23:36:10] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-27 23:36:10] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 0 ms to minimize.
[2024-05-27 23:36:10] [INFO ] Deduced a trap composed of 229 places in 311 ms of which 4 ms to minimize.
[2024-05-27 23:36:11] [INFO ] Deduced a trap composed of 238 places in 321 ms of which 3 ms to minimize.
[2024-05-27 23:36:11] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
[2024-05-27 23:36:13] [INFO ] Deduced a trap composed of 80 places in 261 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 544/2376 variables, and 61 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/548 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1856/1856 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-27 23:36:19] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-27 23:36:25] [INFO ] Deduced a trap composed of 292 places in 301 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/2376 variables, and 63 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/548 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1856 constraints, Known Traps: 13/13 constraints]
After SMT, in 49641ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 49661ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 49753 ms. Remains : 548/792 places, 1860/2100 transitions.
[2024-05-27 23:36:35] [INFO ] Flatten gal took : 96 ms
[2024-05-27 23:36:36] [INFO ] Flatten gal took : 119 ms
[2024-05-27 23:36:36] [INFO ] Input system was already deterministic with 1860 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 788 transition count 2044
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 732 transition count 2036
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 724 transition count 2036
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 128 place count 724 transition count 1932
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 336 place count 620 transition count 1932
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 448 place count 564 transition count 1876
Applied a total of 448 rules in 96 ms. Remains 564 /792 variables (removed 228) and now considering 1876/2100 (removed 224) transitions.
Running 1872 sub problems to find dead transitions.
[2024-05-27 23:36:36] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
// Phase 1: matrix 1844 rows 564 cols
[2024-05-27 23:36:36] [INFO ] Computed 54 invariants in 31 ms
[2024-05-27 23:36:36] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:37:03] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
[2024-05-27 23:37:03] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:37:03] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-27 23:37:03] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:37:03] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2024-05-27 23:37:03] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-27 23:37:03] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2024-05-27 23:37:04] [INFO ] Deduced a trap composed of 247 places in 369 ms of which 3 ms to minimize.
[2024-05-27 23:37:04] [INFO ] Deduced a trap composed of 267 places in 362 ms of which 4 ms to minimize.
[2024-05-27 23:37:05] [INFO ] Deduced a trap composed of 259 places in 448 ms of which 4 ms to minimize.
[2024-05-27 23:37:05] [INFO ] Deduced a trap composed of 254 places in 351 ms of which 3 ms to minimize.
[2024-05-27 23:37:06] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 62 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:37:16] [INFO ] Deduced a trap composed of 336 places in 400 ms of which 5 ms to minimize.
[2024-05-27 23:37:17] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 64 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 14/14 constraints]
After SMT, in 50403ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 50423ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 50525 ms. Remains : 564/792 places, 1876/2100 transitions.
[2024-05-27 23:37:26] [INFO ] Flatten gal took : 78 ms
[2024-05-27 23:37:27] [INFO ] Flatten gal took : 85 ms
[2024-05-27 23:37:27] [INFO ] Input system was already deterministic with 1876 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 772 transition count 2084
Applied a total of 36 rules in 40 ms. Remains 772 /792 variables (removed 20) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:37:27] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-05-27 23:37:27] [INFO ] Computed 54 invariants in 46 ms
[2024-05-27 23:37:27] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 31028ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 31050ms
Finished structural reductions in LTL mode , in 1 iterations and 31095 ms. Remains : 772/792 places, 2084/2100 transitions.
[2024-05-27 23:37:58] [INFO ] Flatten gal took : 73 ms
[2024-05-27 23:37:58] [INFO ] Flatten gal took : 72 ms
[2024-05-27 23:37:58] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 772 transition count 2084
Applied a total of 36 rules in 27 ms. Remains 772 /792 variables (removed 20) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:37:58] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:37:58] [INFO ] Invariant cache hit.
[2024-05-27 23:37:58] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 30258ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 30279ms
Finished structural reductions in LTL mode , in 1 iterations and 30311 ms. Remains : 772/792 places, 2084/2100 transitions.
[2024-05-27 23:38:29] [INFO ] Flatten gal took : 64 ms
[2024-05-27 23:38:29] [INFO ] Flatten gal took : 69 ms
[2024-05-27 23:38:29] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Applied a total of 4 rules in 12 ms. Remains 788 /792 variables (removed 4) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-05-27 23:38:29] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 788 cols
[2024-05-27 23:38:29] [INFO ] Computed 54 invariants in 38 ms
[2024-05-27 23:38:29] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 29829ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 29846ms
Finished structural reductions in LTL mode , in 1 iterations and 29862 ms. Remains : 788/792 places, 2100/2100 transitions.
[2024-05-27 23:38:59] [INFO ] Flatten gal took : 97 ms
[2024-05-27 23:38:59] [INFO ] Flatten gal took : 78 ms
[2024-05-27 23:38:59] [INFO ] Input system was already deterministic with 2100 transitions.
[2024-05-27 23:38:59] [INFO ] Flatten gal took : 99 ms
[2024-05-27 23:38:59] [INFO ] Flatten gal took : 103 ms
[2024-05-27 23:39:00] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 22 ms.
[2024-05-27 23:39:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 792 places, 2100 transitions and 10488 arcs took 10 ms.
Total runtime 615892 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J06T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 792
TRANSITIONS: 2100
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.085s, Sys 0.002s]


SAVING FILE /home/mcc/execution/415/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: 1030
MODEL NAME: /home/mcc/execution/415/model
792 places, 2100 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 CTLFireability -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-COL-S04J06T08"
export BK_EXAMINATION="CTLFireability"
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-COL-S04J06T08, examination is CTLFireability"
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-171654445300154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T08.tgz
mv PolyORBLF-COL-S04J06T08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;