fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950500500
Last Updated
May 14, 2023

About the Execution of LTSMin+red for PolyORBLF-PT-S02J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
503.823 66866.00 80445.00 678.80 FFTTTFFFFFTTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950500500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950500500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 15K Feb 26 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 13:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K Feb 26 13:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Feb 26 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 235K Feb 26 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 63K Feb 26 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 346K Feb 26 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 717K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679542893353

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 03:41:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 03:41:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 03:41:35] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-23 03:41:35] [INFO ] Transformed 614 places.
[2023-03-23 03:41:35] [INFO ] Transformed 1242 transitions.
[2023-03-23 03:41:35] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
[2023-03-23 03:41:35] [INFO ] Reduced 8 identical enabling conditions.
[2023-03-23 03:41:35] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 605 transition count 1107
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 605 transition count 1107
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 598 transition count 1100
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 598 transition count 1100
Applied a total of 30 rules in 114 ms. Remains 598 /614 variables (removed 16) and now considering 1100/1114 (removed 14) transitions.
[2023-03-23 03:41:35] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
// Phase 1: matrix 1084 rows 598 cols
[2023-03-23 03:41:35] [INFO ] Computed 48 place invariants in 75 ms
[2023-03-23 03:41:37] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
[2023-03-23 03:41:37] [INFO ] Flow matrix only has 996 transitions (discarded 16 similar events)
// Phase 1: matrix 996 rows 598 cols
[2023-03-23 03:41:37] [INFO ] Computed 48 place invariants in 31 ms
[2023-03-23 03:41:37] [INFO ] Implicit Places using invariants in 478 ms returned [108, 181, 287, 299, 420, 488, 516, 528]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 482 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 590/614 places, 1012/1114 transitions.
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 589 transition count 996
Reduce places removed 7 places and 16 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 8 place count 582 transition count 980
Deduced a syphon composed of 10 places in 2 ms
Applied a total of 8 rules in 21 ms. Remains 582 /590 variables (removed 8) and now considering 980/1012 (removed 32) transitions.
[2023-03-23 03:41:37] [INFO ] Flow matrix only has 964 transitions (discarded 16 similar events)
// Phase 1: matrix 964 rows 582 cols
[2023-03-23 03:41:37] [INFO ] Computed 50 place invariants in 21 ms
[2023-03-23 03:41:38] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-23 03:41:38] [INFO ] Flow matrix only has 964 transitions (discarded 16 similar events)
[2023-03-23 03:41:38] [INFO ] Invariant cache hit.
[2023-03-23 03:41:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 03:41:44] [INFO ] Implicit Places using invariants and state equation in 6438 ms returned []
Implicit Place search using SMT with State Equation took 6876 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 582/614 places, 980/1114 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8921 ms. Remains : 582/614 places, 980/1114 transitions.
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Support contains 74 out of 572 places after structural reductions.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 03:41:44] [INFO ] Flatten gal took : 109 ms
[2023-03-23 03:41:44] [INFO ] Flatten gal took : 73 ms
[2023-03-23 03:41:45] [INFO ] Input system was already deterministic with 980 transitions.
Support contains 73 out of 572 places (down from 74) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 03:41:45] [INFO ] Flow matrix only has 964 transitions (discarded 16 similar events)
// Phase 1: matrix 964 rows 572 cols
[2023-03-23 03:41:45] [INFO ] Computed 40 place invariants in 18 ms
[2023-03-23 03:41:45] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-23 03:41:45] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-23 03:41:45] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 26 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 980/980 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 572 transition count 922
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 514 transition count 922
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 116 place count 514 transition count 874
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 212 place count 466 transition count 874
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 213 place count 465 transition count 873
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 465 transition count 873
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 326 place count 409 transition count 817
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 331 place count 404 transition count 812
Iterating global reduction 2 with 5 rules applied. Total rules applied 336 place count 404 transition count 812
Applied a total of 336 rules in 126 ms. Remains 404 /572 variables (removed 168) and now considering 812/980 (removed 168) transitions.
[2023-03-23 03:41:45] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2023-03-23 03:41:45] [INFO ] Computed 40 place invariants in 13 ms
[2023-03-23 03:41:46] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
[2023-03-23 03:41:46] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2023-03-23 03:41:46] [INFO ] Invariant cache hit.
[2023-03-23 03:41:47] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-23 03:41:47] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2023-03-23 03:41:47] [INFO ] Invariant cache hit.
[2023-03-23 03:41:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 03:41:51] [INFO ] Implicit Places using invariants and state equation in 4313 ms returned []
Implicit Place search using SMT with State Equation took 4715 ms to find 0 implicit places.
[2023-03-23 03:41:51] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-23 03:41:51] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2023-03-23 03:41:51] [INFO ] Invariant cache hit.
[2023-03-23 03:41:52] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/572 places, 812/980 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6316 ms. Remains : 404/572 places, 812/980 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s175 1) (LT s397 1) (LT s235 1) (LT s96 1) (LT s22 1) (LT s219 1) (LT s260 1) (LT s318 1)), p1:(AND (OR (LT s138 1) (LT s162 1) (LT s353 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 319 reset in 657 ms.
Stack based approach found an accepted trace after 631 steps with 7 reset with depth 223 and stack size 223 in 11 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-00 finished in 7326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 980/980 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 572 transition count 938
Reduce places removed 42 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 50 rules applied. Total rules applied 92 place count 530 transition count 930
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 522 transition count 930
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 100 place count 522 transition count 866
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 228 place count 458 transition count 866
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 308 place count 418 transition count 826
Applied a total of 308 rules in 74 ms. Remains 418 /572 variables (removed 154) and now considering 826/980 (removed 154) transitions.
[2023-03-23 03:41:53] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2023-03-23 03:41:53] [INFO ] Computed 40 place invariants in 9 ms
[2023-03-23 03:41:53] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
[2023-03-23 03:41:53] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
[2023-03-23 03:41:53] [INFO ] Invariant cache hit.
[2023-03-23 03:41:54] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-23 03:41:54] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
[2023-03-23 03:41:54] [INFO ] Invariant cache hit.
[2023-03-23 03:41:54] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 03:41:58] [INFO ] Implicit Places using invariants and state equation in 4233 ms returned []
Implicit Place search using SMT with State Equation took 4641 ms to find 0 implicit places.
[2023-03-23 03:41:58] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 03:41:58] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
[2023-03-23 03:41:58] [INFO ] Invariant cache hit.
[2023-03-23 03:41:59] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/572 places, 826/980 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5969 ms. Remains : 418/572 places, 826/980 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s295 1) (LT s308 1)) (OR (LT s128 1) (LT s308 1)) (OR (LT s173 1) (LT s308 1)) (OR (LT s40 1) (LT s308 1)) (OR (LT s179 1) (LT s308 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33 reset in 457 ms.
Stack based approach found an accepted trace after 1980 steps with 0 reset with depth 1981 and stack size 1981 in 11 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-01 finished in 6491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 980/980 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 570 transition count 978
Applied a total of 4 rules in 30 ms. Remains 570 /572 variables (removed 2) and now considering 978/980 (removed 2) transitions.
[2023-03-23 03:41:59] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2023-03-23 03:41:59] [INFO ] Computed 40 place invariants in 21 ms
[2023-03-23 03:42:00] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
[2023-03-23 03:42:00] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:00] [INFO ] Invariant cache hit.
[2023-03-23 03:42:01] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-23 03:42:01] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:01] [INFO ] Invariant cache hit.
[2023-03-23 03:42:01] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 03:42:07] [INFO ] Implicit Places using invariants and state equation in 6530 ms returned []
Implicit Place search using SMT with State Equation took 7055 ms to find 0 implicit places.
[2023-03-23 03:42:07] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:07] [INFO ] Invariant cache hit.
[2023-03-23 03:42:08] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/572 places, 978/980 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9043 ms. Remains : 570/572 places, 978/980 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s232 1) (GEQ s373 1) (GEQ s551 1)) (AND (GEQ s232 1) (GEQ s328 1) (GEQ s373 1)) (AND (GEQ s4 1) (GEQ s232 1) (GEQ s373 1)) (AND (GEQ s232...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-05 finished in 9162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(p0)))))))'
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 980/980 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 570 transition count 978
Applied a total of 4 rules in 21 ms. Remains 570 /572 variables (removed 2) and now considering 978/980 (removed 2) transitions.
[2023-03-23 03:42:08] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:08] [INFO ] Invariant cache hit.
[2023-03-23 03:42:09] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
[2023-03-23 03:42:09] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:09] [INFO ] Invariant cache hit.
[2023-03-23 03:42:10] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-23 03:42:10] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:10] [INFO ] Invariant cache hit.
[2023-03-23 03:42:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 03:42:17] [INFO ] Implicit Places using invariants and state equation in 6996 ms returned []
Implicit Place search using SMT with State Equation took 7484 ms to find 0 implicit places.
[2023-03-23 03:42:17] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:17] [INFO ] Invariant cache hit.
[2023-03-23 03:42:18] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/572 places, 978/980 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9470 ms. Remains : 570/572 places, 978/980 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=7, aps=[p0:(OR (AND (GEQ s19 8) (GEQ s257 2) (GEQ s343 1)) (AND (GEQ s19 8) (GEQ s209 2) (GEQ s422 1)) (AND (GEQ s19 8) (GEQ s159 1) (GEQ s209 2)) (AND (GEQ s19 8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-07 finished in 9832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 980/980 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 570 transition count 978
Applied a total of 4 rules in 30 ms. Remains 570 /572 variables (removed 2) and now considering 978/980 (removed 2) transitions.
[2023-03-23 03:42:18] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:18] [INFO ] Invariant cache hit.
[2023-03-23 03:42:19] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
[2023-03-23 03:42:19] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:19] [INFO ] Invariant cache hit.
[2023-03-23 03:42:20] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-23 03:42:20] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:20] [INFO ] Invariant cache hit.
[2023-03-23 03:42:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 03:42:27] [INFO ] Implicit Places using invariants and state equation in 7316 ms returned []
Implicit Place search using SMT with State Equation took 7796 ms to find 0 implicit places.
[2023-03-23 03:42:27] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:27] [INFO ] Invariant cache hit.
[2023-03-23 03:42:28] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/572 places, 978/980 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9770 ms. Remains : 570/572 places, 978/980 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s139 1) (GEQ s562 1)) (AND (GEQ s154 1) (GEQ s534 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12305 steps with 13 reset in 41 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-08 finished in 9896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1&&X((p1 U (!p2||G(p1)))))||p0))))'
Support contains 6 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 980/980 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 570 transition count 978
Applied a total of 4 rules in 35 ms. Remains 570 /572 variables (removed 2) and now considering 978/980 (removed 2) transitions.
[2023-03-23 03:42:28] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:28] [INFO ] Invariant cache hit.
[2023-03-23 03:42:29] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
[2023-03-23 03:42:29] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:29] [INFO ] Invariant cache hit.
[2023-03-23 03:42:30] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-23 03:42:30] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:30] [INFO ] Invariant cache hit.
[2023-03-23 03:42:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 03:42:36] [INFO ] Implicit Places using invariants and state equation in 6695 ms returned []
Implicit Place search using SMT with State Equation took 7162 ms to find 0 implicit places.
[2023-03-23 03:42:36] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-23 03:42:36] [INFO ] Invariant cache hit.
[2023-03-23 03:42:37] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/572 places, 978/980 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9197 ms. Remains : 570/572 places, 978/980 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s271 1) (LT s562 1)), p1:(OR (LT s475 1) (LT s544 2)), p2:(AND (GEQ s183 1) (GEQ s491 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 614 ms.
Product exploration explored 100000 steps with 50000 reset in 618 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p2))
Knowledge based reduction with 7 factoid took 235 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-13 finished in 10827 ms.
All properties solved by simple procedures.
Total runtime 63997 ms.
ITS solved all properties within timeout

BK_STOP 1679542960219

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J04T08, 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 r297-tall-167873950500500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 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 ;