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.r516-tajo-171654446400137.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 ltsminxred
Input is PolyORBLF-COL-S04J04T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 10K Apr 11 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 17:11 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:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 17:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 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-S04J04T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717250061106

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:54:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:54:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:54:22] [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-06-01 13:54:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:54:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2024-06-01 13:54:23] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2024-06-01 13:54:23] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 8 ms.
[2024-06-01 13:54:23] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (15 resets) in 1888 ms. (21 steps per ms) remains 75/112 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (9 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 75/75 properties
[2024-06-01 13:54:24] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:54:24] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 13:54:24] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp92 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 4/4 constraints. Problems are: Problem set: 13 solved, 62 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/8 constraints. Problems are: Problem set: 15 solved, 60 unsolved
[2024-06-01 13:54:25] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/9 constraints. Problems are: Problem set: 15 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 15 solved, 60 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp109 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/71 variables, 7/16 constraints. Problems are: Problem set: 59 solved, 16 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 3/19 constraints. Problems are: Problem set: 65 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 65 solved, 10 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp101 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 27 constraints, problems are : Problem set: 75 solved, 0 unsolved in 717 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: 75/75 constraints, Known Traps: 1/1 constraints]
After SMT, in 782ms problems are : Problem set: 75 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 75 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:54:25] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 13:54:25] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:54:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:54:25] [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-06-01 13:54:25] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 102 ms.
[2024-06-01 13:54:25] [INFO ] Unfolded 4 HLPN properties in 1 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 295 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 71 ms. Remains 870 /870 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 13:54:25] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2024-06-01 13:54:26] [INFO ] Computed 58 invariants in 161 ms
[2024-06-01 13:54:26] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 32507ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 32549ms
[2024-06-01 13:54:58] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:54:58] [INFO ] Invariant cache hit.
[2024-06-01 13:54:59] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-06-01 13:54:59] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:54:59] [INFO ] Invariant cache hit.
[2024-06-01 13:55:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 13:55:17] [INFO ] Implicit Places using invariants and state equation in 18237 ms returned []
Implicit Place search using SMT with State Equation took 18881 ms to find 0 implicit places.
Running 2320 sub problems to find dead transitions.
[2024-06-01 13:55:17] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:55:17] [INFO ] Invariant cache hit.
[2024-06-01 13:55:17] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 5 ms to minimize.
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 1 ms to minimize.
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 261 places in 580 ms of which 10 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 263 places in 510 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 862/3154 variables, and 61 constraints, problems are : Problem set: 0 solved, 2320 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2320/2320 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 13:56:02] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 405 places in 584 ms of which 8 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 79 places in 331 ms of which 3 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:56:21] [INFO ] Deduced a trap composed of 480 places in 614 ms of which 6 ms to minimize.
[2024-06-01 13:56:21] [INFO ] Deduced a trap composed of 536 places in 568 ms of which 6 ms to minimize.
[2024-06-01 13:56:22] [INFO ] Deduced a trap composed of 513 places in 623 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/3154 variables, and 68 constraints, problems are : Problem set: 0 solved, 2320 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2320 constraints, Known Traps: 18/18 constraints]
After SMT, in 72897ms problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 72929ms
Finished structural reductions in LTL mode , in 1 iterations and 124464 ms. Remains : 870/870 places, 2324/2324 transitions.
Support contains 295 out of 870 places after structural reductions.
[2024-06-01 13:56:30] [INFO ] Flatten gal took : 241 ms
[2024-06-01 13:56:30] [INFO ] Flatten gal took : 175 ms
[2024-06-01 13:56:31] [INFO ] Input system was already deterministic with 2324 transitions.
RANDOM walk for 40000 steps (9 resets) in 1005 ms. (39 steps per ms) remains 18/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
[2024-06-01 13:56:31] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:56:31] [INFO ] Invariant cache hit.
[2024-06-01 13:56:31] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 367/508 variables, 13/13 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 1/14 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 0/14 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 864/3154 variables, and 53 constraints, problems are : Problem set: 18 solved, 0 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 18 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 18 atomic propositions for a total of 4 simplifications.
[2024-06-01 13:56:32] [INFO ] Flatten gal took : 90 ms
[2024-06-01 13:56:32] [INFO ] Flatten gal took : 94 ms
[2024-06-01 13:56:32] [INFO ] Input system was already deterministic with 2324 transitions.
Support contains 82 out of 870 places (down from 118) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 101 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 13:56:32] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 13:56:32] [INFO ] Computed 54 invariants in 92 ms
[2024-06-01 13:56:32] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 32941ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32966ms
Finished structural reductions in LTL mode , in 1 iterations and 33076 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 13:57:05] [INFO ] Flatten gal took : 85 ms
[2024-06-01 13:57:06] [INFO ] Flatten gal took : 91 ms
[2024-06-01 13:57:06] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 866 transition count 2264
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 806 transition count 2254
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 796 transition count 2254
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 140 place count 796 transition count 2154
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 340 place count 696 transition count 2154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 440 place count 646 transition count 2104
Applied a total of 440 rules in 190 ms. Remains 646 /870 variables (removed 224) and now considering 2104/2324 (removed 220) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 13:57:06] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
// Phase 1: matrix 2064 rows 646 cols
[2024-06-01 13:57:06] [INFO ] Computed 54 invariants in 41 ms
[2024-06-01 13:57:06] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 301 places in 494 ms of which 5 ms to minimize.
[2024-06-01 13:57:38] [INFO ] Deduced a trap composed of 285 places in 494 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 (/ 19.0 2.0))
(s1 (/ 1.0 2.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.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 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2710 variables, and 61 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 13:57:42] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:57:43] [INFO ] Deduced a trap composed of 307 places in 533 ms of which 4 ms to minimize.
[2024-06-01 13:57:43] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2710 variables, and 64 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 14/14 constraints]
After SMT, in 52614ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 52635ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 52830 ms. Remains : 646/870 places, 2104/2324 transitions.
[2024-06-01 13:57:59] [INFO ] Flatten gal took : 89 ms
[2024-06-01 13:57:59] [INFO ] Flatten gal took : 99 ms
[2024-06-01 13:57:59] [INFO ] Input system was already deterministic with 2104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 62 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 13:57:59] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 13:57:59] [INFO ] Computed 54 invariants in 76 ms
[2024-06-01 13:57:59] [INFO ] State equation strengthened by 200 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/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35325ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35355ms
Finished structural reductions in LTL mode , in 1 iterations and 35425 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 13:58:34] [INFO ] Flatten gal took : 85 ms
[2024-06-01 13:58:35] [INFO ] Flatten gal took : 91 ms
[2024-06-01 13:58:35] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 46 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 13:58:35] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 13:58:35] [INFO ] Invariant cache hit.
[2024-06-01 13:58:35] [INFO ] State equation strengthened by 200 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 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.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 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.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 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.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 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 10.0)
(s203 1.0)
(s204 0.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 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.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 1.0)
(s336 1.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 1.0)
(s349 0.0)
(s350 0.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 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.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 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 1.0)
(s413 0.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 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.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 0.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 10.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 0.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 0.0)
(s788 0.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)timeout

(s829 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34370ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34399ms
Finished structural reductions in LTL mode , in 1 iterations and 34452 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 13:59:09] [INFO ] Flatten gal took : 72 ms
[2024-06-01 13:59:09] [INFO ] Flatten gal took : 78 ms
[2024-06-01 13:59:09] [INFO ] Input system was already deterministic with 2304 transitions.
[2024-06-01 13:59:10] [INFO ] Flatten gal took : 73 ms
[2024-06-01 13:59:10] [INFO ] Flatten gal took : 84 ms
[2024-06-01 13:59:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 13:59:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 870 places, 2324 transitions and 11844 arcs took 16 ms.
Total runtime 287744 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLCardinality-2024-14

BK_STOP 1717250350544

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-COL-S04J04T10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/686/ctl_0_
ctl formula name PolyORBLF-COL-S04J04T10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/686/ctl_1_
ctl formula name PolyORBLF-COL-S04J04T10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/686/ctl_2_
ctl formula name PolyORBLF-COL-S04J04T10-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/686/ctl_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S04J04T10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-COL-S04J04T10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446400137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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