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

About the Execution of ITS-Tools for PolyORBLF-COL-S06J06T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 319241.00 0.00 0.00 TFF?F?????F????? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446600196.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S06J06T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 12K Apr 11 17:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 17:22 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.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716911357286

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 15:49:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:49:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:49:18] [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-28 15:49:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:49:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2024-05-28 15:49:19] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:49:19] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 15:49:19] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S06J06T04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 28 to 25
RANDOM walk for 40009 steps (3877 resets) in 1441 ms. (27 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4002 steps (9 resets) in 36 ms. (108 steps per ms) remains 3/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 55 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000 steps (12 resets) in 51 ms. (76 steps per ms) remains 2/3 properties
[2024-05-28 15:49:20] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:49:20] [INFO ] Computed 26 invariants in 13 ms
[2024-05-28 15:49:20] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/51 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 75/145 variables, and 22 constraints, problems are : Problem set: 2 solved, 0 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 13/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-05-28 15:49:20] [INFO ] Flatten gal took : 23 ms
[2024-05-28 15:49:20] [INFO ] Flatten gal took : 11 ms
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
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 15:49:20] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 151 ms.
[2024-05-28 15:49:20] [INFO ] Unfolded 14 HLPN properties in 4 ms.
[2024-05-28 15:49:20] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 15:49:20] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 15:49:20] [INFO ] Reduced 640 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 265 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 502 transition count 1770
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 502 transition count 1770
Applied a total of 8 rules in 79 ms. Remains 502 /506 variables (removed 4) and now considering 1770/1774 (removed 4) transitions.
Running 1764 sub problems to find dead transitions.
[2024-05-28 15:49:20] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
// Phase 1: matrix 1746 rows 502 cols
[2024-05-28 15:49:21] [INFO ] Computed 54 invariants in 80 ms
[2024-05-28 15:49:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
[2024-05-28 15:49:48] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 25 ms to minimize.
[2024-05-28 15:49:48] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:49:48] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:49:49] [INFO ] Deduced a trap composed of 281 places in 354 ms of which 3 ms to minimize.
[2024-05-28 15:49:49] [INFO ] Deduced a trap composed of 135 places in 310 ms of which 3 ms to minimize.
[2024-05-28 15:49:49] [INFO ] Deduced a trap composed of 126 places in 379 ms of which 4 ms to minimize.
[2024-05-28 15:49:50] [INFO ] Deduced a trap composed of 103 places in 296 ms of which 2 ms to minimize.
[2024-05-28 15:49:51] [INFO ] Deduced a trap composed of 237 places in 309 ms of which 3 ms to minimize.
[2024-05-28 15:49:52] [INFO ] Deduced a trap composed of 260 places in 435 ms of which 4 ms to minimize.
[2024-05-28 15:49:52] [INFO ] Deduced a trap composed of 258 places in 438 ms of which 2 ms to minimize.
[2024-05-28 15:49:53] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/2248 variables, and 53 constraints, problems are : Problem set: 0 solved, 1764 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1764/1764 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
[2024-05-28 15:50:03] [INFO ] Deduced a trap composed of 262 places in 367 ms of which 3 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 254 places in 321 ms of which 4 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 270 places in 346 ms of which 3 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 194 places in 185 ms of which 2 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/2248 variables, and 59 constraints, problems are : Problem set: 0 solved, 1764 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1764 constraints, Known Traps: 17/17 constraints]
After SMT, in 55202ms problems are : Problem set: 0 solved, 1764 unsolved
Search for dead transitions found 0 dead transitions in 55233ms
[2024-05-28 15:50:16] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
[2024-05-28 15:50:16] [INFO ] Invariant cache hit.
[2024-05-28 15:50:16] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-28 15:50:16] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
[2024-05-28 15:50:16] [INFO ] Invariant cache hit.
[2024-05-28 15:50:17] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:50:22] [INFO ] Implicit Places using invariants and state equation in 6090 ms returned []
Implicit Place search using SMT with State Equation took 6348 ms to find 0 implicit places.
Running 1764 sub problems to find dead transitions.
[2024-05-28 15:50:22] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
[2024-05-28 15:50:22] [INFO ] Invariant cache hit.
[2024-05-28 15:50:22] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
[2024-05-28 15:50:48] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:50:48] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:50:48] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:50:48] [INFO ] Deduced a trap composed of 248 places in 334 ms of which 4 ms to minimize.
[2024-05-28 15:50:49] [INFO ] Deduced a trap composed of 78 places in 328 ms of which 3 ms to minimize.
[2024-05-28 15:50:49] [INFO ] Deduced a trap composed of 125 places in 289 ms of which 3 ms to minimize.
[2024-05-28 15:50:49] [INFO ] Deduced a trap composed of 134 places in 285 ms of which 3 ms to minimize.
[2024-05-28 15:50:50] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:50:50] [INFO ] Deduced a trap composed of 261 places in 339 ms of which 4 ms to minimize.
[2024-05-28 15:50:51] [INFO ] Deduced a trap composed of 263 places in 368 ms of which 4 ms to minimize.
[2024-05-28 15:50:52] [INFO ] Deduced a trap composed of 311 places in 443 ms of which 4 ms to minimize.
[2024-05-28 15:50:53] [INFO ] Deduced a trap composed of 282 places in 409 ms of which 3 ms to minimize.
[2024-05-28 15:50:53] [INFO ] Deduced a trap composed of 254 places in 367 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/2248 variables, and 55 constraints, problems are : Problem set: 0 solved, 1764 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1764/1764 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
[2024-05-28 15:51:11] [INFO ] Deduced a trap composed of 244 places in 414 ms of which 3 ms to minimize.
[2024-05-28 15:51:15] [INFO ] Deduced a trap composed of 257 places in 339 ms of which 4 ms to minimize.
[2024-05-28 15:51:16] [INFO ] Deduced a trap composed of 262 places in 391 ms of which 4 ms to minimize.
[2024-05-28 15:51:16] [INFO ] Deduced a trap composed of 257 places in 383 ms of which 4 ms to minimize.
[2024-05-28 15:51:16] [INFO ] Deduced a trap composed of 262 places in 351 ms of which 6 ms to minimize.
[2024-05-28 15:51:17] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/2248 variables, and 61 constraints, problems are : Problem set: 0 solved, 1764 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1764 constraints, Known Traps: 19/19 constraints]
After SMT, in 75308ms problems are : Problem set: 0 solved, 1764 unsolved
Search for dead transitions found 0 dead transitions in 75347ms
Starting structural reductions in LTL mode, iteration 1 : 502/506 places, 1770/1774 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137038 ms. Remains : 502/506 places, 1770/1774 transitions.
Support contains 265 out of 502 places after structural reductions.
[2024-05-28 15:51:38] [INFO ] Flatten gal took : 240 ms
[2024-05-28 15:51:38] [INFO ] Flatten gal took : 143 ms
[2024-05-28 15:51:38] [INFO ] Input system was already deterministic with 1770 transitions.
Support contains 257 out of 502 places (down from 265) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40001 steps (168 resets) in 737 ms. (54 steps per ms) remains 2/25 properties
BEST_FIRST walk for 40003 steps (60 resets) in 308 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (81 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
[2024-05-28 15:51:39] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
[2024-05-28 15:51:39] [INFO ] Invariant cache hit.
[2024-05-28 15:51:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/210 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 271/481 variables, 26/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/488 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 500/2248 variables, and 53 constraints, problems are : Problem set: 2 solved, 0 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S06J06T04-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 33 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 1770/1770 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 496 transition count 1750
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 476 transition count 1750
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 40 place count 476 transition count 1694
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 152 place count 420 transition count 1694
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 256 place count 368 transition count 1642
Applied a total of 256 rules in 148 ms. Remains 368 /502 variables (removed 134) and now considering 1642/1770 (removed 128) transitions.
Running 1636 sub problems to find dead transitions.
[2024-05-28 15:51:40] [INFO ] Flow matrix only has 1618 transitions (discarded 24 similar events)
// Phase 1: matrix 1618 rows 368 cols
[2024-05-28 15:51:40] [INFO ] Computed 48 invariants in 70 ms
[2024-05-28 15:51:40] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
[2024-05-28 15:52:04] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:52:04] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:52:04] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 162 places in 438 ms of which 4 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 158 places in 385 ms of which 3 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 158 places in 360 ms of which 3 ms to minimize.
[2024-05-28 15:52:06] [INFO ] Deduced a trap composed of 38 places in 326 ms of which 2 ms to minimize.
[2024-05-28 15:52:06] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 2 ms to minimize.
[2024-05-28 15:52:06] [INFO ] Deduced a trap composed of 147 places in 330 ms of which 2 ms to minimize.
[2024-05-28 15:52:07] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.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 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.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 9.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.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 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.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 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 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 362/1986 variables, and 52 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/368 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
[2024-05-28 15:52:17] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 1 ms to minimize.
[2024-05-28 15:52:19] [INFO ] Deduced a trap composed of 108 places in 332 ms of which 3 ms to minimize.
[2024-05-28 15:52:19] [INFO ] Deduced a trap composed of 156 places in 331 ms of which 3 ms to minimize.
[2024-05-28 15:52:20] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2024-05-28 15:52:20] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 7)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 9)
(s87 1)
(s88 0)
(s89 timeout
1)
(s90 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/1986 variables, and 57 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/368 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1636 constraints, Known Traps: 15/15 constraints]
After SMT, in 55070ms problems are : Problem set: 0 solved, 1636 unsolved
Search for dead transitions found 0 dead transitions in 55086ms
[2024-05-28 15:52:35] [INFO ] Flow matrix only has 1618 transitions (discarded 24 similar events)
[2024-05-28 15:52:35] [INFO ] Invariant cache hit.
[2024-05-28 15:52:35] [INFO ] Implicit Places using invariants in 371 ms returned [314, 315, 316, 317]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 378 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/502 places, 1642/1770 transitions.
Applied a total of 0 rules in 33 ms. Remains 364 /364 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55649 ms. Remains : 364/502 places, 1642/1770 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J06T04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 81 steps with 0 reset in 7 ms.
FORMULA PolyORBLF-COL-S06J06T04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T04-LTLFireability-01 finished in 55898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 11 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 1770/1770 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 496 transition count 1770
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 492 transition count 1766
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 492 transition count 1766
Applied a total of 14 rules in 28 ms. Remains 492 /502 variables (removed 10) and now considering 1766/1770 (removed 4) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 15:52:36] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 492 cols
[2024-05-28 15:52:36] [INFO ] Computed 48 invariants in 41 ms
[2024-05-28 15:52:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 15:53:02] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2234 variables, and 38 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 26/33 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 15:53:25] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:53:25] [INFO ] Deduced a trap composed of 199 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2234 variables, and 40 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 26/33 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 3/3 constraints]
After SMT, in 54238ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 54262ms
[2024-05-28 15:53:30] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 15:53:30] [INFO ] Invariant cache hit.
[2024-05-28 15:53:30] [INFO ] Implicit Places using invariants in 281 ms returned [398, 399, 400, 401]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 285 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/502 places, 1766/1770 transitions.
Applied a total of 0 rules in 11 ms. Remains 488 /488 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54592 ms. Remains : 488/502 places, 1766/1770 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 13 ms.
FORMULA PolyORBLF-COL-S06J06T04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T04-LTLFireability-02 finished in 54753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 1770/1770 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 496 transition count 1742
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 468 transition count 1742
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 56 place count 468 transition count 1686
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 168 place count 412 transition count 1686
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 264 place count 364 transition count 1638
Applied a total of 264 rules in 106 ms. Remains 364 /502 variables (removed 138) and now considering 1638/1770 (removed 132) transitions.
Running 1632 sub problems to find dead transitions.
[2024-05-28 15:53:30] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
// Phase 1: matrix 1614 rows 364 cols
[2024-05-28 15:53:30] [INFO ] Computed 48 invariants in 29 ms
[2024-05-28 15:53:30] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-05-28 15:53:54] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 2 ms to minimize.
[2024-05-28 15:53:54] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:53:54] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 3 ms to minimize.
[2024-05-28 15:53:55] [INFO ] Deduced a trap composed of 147 places in 402 ms of which 3 ms to minimize.
[2024-05-28 15:53:55] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:53:56] [INFO ] Deduced a trap composed of 152 places in 311 ms of which 2 ms to minimize.
[2024-05-28 15:53:57] [INFO ] Deduced a trap composed of 150 places in 404 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1978 variables, and 49 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-05-28 15:54:09] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:54:12] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1978 variables, and 51 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1632 constraints, Known Traps: 9/9 constraints]
After SMT, in 55287ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 55303ms
[2024-05-28 15:54:26] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
[2024-05-28 15:54:26] [INFO ] Invariant cache hit.
[2024-05-28 15:54:26] [INFO ] Implicit Places using invariants in 358 ms returned [314, 315, 316, 317]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 363 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/502 places, 1638/1770 transitions.
Applied a total of 0 rules in 23 ms. Remains 360 /360 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55799 ms. Remains : 360/502 places, 1638/1770 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T04-LTLFireability-03
Product exploration explored 100000 steps with 878 reset in 593 ms.
Product exploration explored 100000 steps with 910 reset in 444 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 239 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 1638/1638 transitions.
Applied a total of 0 rules in 21 ms. Remains 360 /360 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
Running 1632 sub problems to find dead transitions.
[2024-05-28 15:54:27] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
// Phase 1: matrix 1614 rows 360 cols
[2024-05-28 15:54:27] [INFO ] Computed 44 invariants in 39 ms
[2024-05-28 15:54:27] [INFO ] State equation strengthened by 112 read => feed constraints.

BK_STOP 1716911676527

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J06T04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446600196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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