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

About the Execution of GreatSPN+red for PolyORBLF-COL-S04J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15261.195 3600000.00 13589207.00 170.10 ?FFT?FF?FFTFFF?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445300137.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-S04J04T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445300137
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:10:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 23:10:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:10:41] [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:10:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:10:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 646 ms
[2024-05-27 23:10:42] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2024-05-27 23:10:42] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 23:10:42] [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 (9 resets) in 3514 ms. (11 steps per ms) remains 75/112 properties
BEST_FIRST walk for 4002 steps (8 resets) in 158 ms. (25 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 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 28 ms. (138 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 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 4002 steps (8 resets) in 40 ms. (97 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 4003 steps (8 resets) in 47 ms. (83 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 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 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 4000 steps (8 resets) in 30 ms. (129 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 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 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 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 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 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 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 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 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 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 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 4003 steps (8 resets) in 22 ms. (174 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 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 75/75 properties
[2024-05-27 23:10:43] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 23:10:43] [INFO ] Computed 26 invariants in 16 ms
[2024-05-27 23:10:43] [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-05-27 23:10:44] [INFO ] Deduced a trap composed of 3 places in 36 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 703 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 781ms 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-05-27 23:10:44] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-27 23:10:44] [INFO ] Flatten gal took : 29 ms
[2024-05-27 23:10:44] [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-05-27 23:10:44] [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:10:44] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 114 ms.
[2024-05-27 23:10:44] [INFO ] Unfolded 4 HLPN properties in 0 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 85 ms. Remains 870 /870 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-05-27 23:10:45] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2024-05-27 23:10:45] [INFO ] Computed 58 invariants in 113 ms
[2024-05-27 23:10:45] [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 33440ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 33478ms
[2024-05-27 23:11:18] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:11:18] [INFO ] Invariant cache hit.
[2024-05-27 23:11:19] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-05-27 23:11:19] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:11:19] [INFO ] Invariant cache hit.
[2024-05-27 23:11:20] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 23:11:39] [INFO ] Implicit Places using invariants and state equation in 20469 ms returned []
Implicit Place search using SMT with State Equation took 21165 ms to find 0 implicit places.
Running 2320 sub problems to find dead transitions.
[2024-05-27 23:11:39] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:11:39] [INFO ] Invariant cache hit.
[2024-05-27 23:11:39] [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-05-27 23:12:23] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-05-27 23:12:23] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 3 ms to minimize.
[2024-05-27 23:12:23] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-27 23:12:23] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-27 23:12:23] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 1 ms to minimize.
[2024-05-27 23:12:23] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 862/3154 variables, and 56 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: 6/6 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, 6/56 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-05-27 23:12:26] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 2 ms to minimize.
[2024-05-27 23:12:26] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-27 23:12:26] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-27 23:12:26] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:12:28] [INFO ] Deduced a trap composed of 260 places in 549 ms of which 7 ms to minimize.
[2024-05-27 23:12:30] [INFO ] Deduced a trap composed of 442 places in 568 ms of which 7 ms to minimize.
[2024-05-27 23:12:41] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 3 ms to minimize.
[2024-05-27 23:12:42] [INFO ] Deduced a trap composed of 94 places in 205 ms of which 3 ms to minimize.
[2024-05-27 23:12:42] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 4 ms to minimize.
[2024-05-27 23:12:50] [INFO ] Deduced a trap composed of 530 places in 542 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/3154 variables, and 66 constraints, problems are : Problem set: 0 solved, 2320 unsolved in 30053 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: 16/16 constraints]
After SMT, in 74195ms problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 74221ms
Finished structural reductions in LTL mode , in 1 iterations and 129002 ms. Remains : 870/870 places, 2324/2324 transitions.
Support contains 295 out of 870 places after structural reductions.
[2024-05-27 23:12:54] [INFO ] Flatten gal took : 276 ms
[2024-05-27 23:12:54] [INFO ] Flatten gal took : 201 ms
[2024-05-27 23:12:54] [INFO ] Input system was already deterministic with 2324 transitions.
RANDOM walk for 40000 steps (10 resets) in 1307 ms. (30 steps per ms) remains 18/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 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 4002 steps (8 resets) in 63 ms. (62 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 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 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 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 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 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
[2024-05-27 23:12:55] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-27 23:12:55] [INFO ] Invariant cache hit.
[2024-05-27 23:12:55] [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 376 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 474ms 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-05-27 23:12:56] [INFO ] Flatten gal took : 123 ms
[2024-05-27 23:12:56] [INFO ] Flatten gal took : 132 ms
[2024-05-27 23:12:56] [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 120 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:12:57] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-05-27 23:12:57] [INFO ] Computed 54 invariants in 125 ms
[2024-05-27 23:12:57] [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 33360ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33382ms
Finished structural reductions in LTL mode , in 1 iterations and 33509 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-05-27 23:13:30] [INFO ] Flatten gal took : 83 ms
[2024-05-27 23:13:30] [INFO ] Flatten gal took : 89 ms
[2024-05-27 23:13:30] [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 1 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 187 ms. Remains 646 /870 variables (removed 224) and now considering 2104/2324 (removed 220) transitions.
Running 2100 sub problems to find dead transitions.
[2024-05-27 23:13:30] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
// Phase 1: matrix 2064 rows 646 cols
[2024-05-27 23:13:31] [INFO ] Computed 54 invariants in 44 ms
[2024-05-27 23:13:31] [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-05-27 23:14:01] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 2 ms to minimize.
[2024-05-27 23:14:01] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2024-05-27 23:14:01] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-27 23:14:01] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:14:01] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-27 23:14:01] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-27 23:14:01] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-27 23:14:02] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 0 ms to minimize.
[2024-05-27 23:14:02] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 2 ms to minimize.
[2024-05-27 23:14:02] [INFO ] Deduced a trap composed of 301 places in 418 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2710 variables, and 60 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: 2100/2100 constraints, Known Traps: 10/10 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, 10/60 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-05-27 23:14:05] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-27 23:14:06] [INFO ] Deduced a trap composed of 23 places in 506 ms of which 4 ms to minimize.
[2024-05-27 23:14:07] [INFO ] Deduced a trap composed of 310 places in 519 ms of which 4 ms to minimize.
[2024-05-27 23:14:16] [INFO ] Deduced a trap composed of 59 places in 308 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2710 variables, and 64 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20033 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 52400ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 52421ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 52613 ms. Remains : 646/870 places, 2104/2324 transitions.
[2024-05-27 23:14:23] [INFO ] Flatten gal took : 99 ms
[2024-05-27 23:14:23] [INFO ] Flatten gal took : 110 ms
[2024-05-27 23:14:23] [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 60 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:14:23] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-05-27 23:14:23] [INFO ] Computed 54 invariants in 39 ms
[2024-05-27 23:14:23] [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 35032ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35066ms
Finished structural reductions in LTL mode , in 1 iterations and 35132 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-05-27 23:14:59] [INFO ] Flatten gal took : 121 ms
[2024-05-27 23:14:59] [INFO ] Flatten gal took : 145 ms
[2024-05-27 23:14:59] [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 77 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-27 23:14:59] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-27 23:14:59] [INFO ] Invariant cache hit.
[2024-05-27 23:14:59] [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 35407ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35435ms
Finished structural reductions in LTL mode , in 1 iterations and 35517 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-05-27 23:15:35] [INFO ] Flatten gal took : 89 ms
[2024-05-27 23:15:35] [INFO ] Flatten gal took : 93 ms
[2024-05-27 23:15:35] [INFO ] Input system was already deterministic with 2304 transitions.
[2024-05-27 23:15:35] [INFO ] Flatten gal took : 90 ms
[2024-05-27 23:15:35] [INFO ] Flatten gal took : 94 ms
[2024-05-27 23:15:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-27 23:15:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 870 places, 2324 transitions and 11844 arcs took 20 ms.
Total runtime 294286 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J04T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 870
TRANSITIONS: 2324
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.082s, Sys 0.019s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.010s, 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: 716
MODEL NAME: /home/mcc/execution/418/model
870 places, 2324 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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

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="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-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 r289-tajo-171654445300137"
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 ;