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

About the Execution of LoLa+red for AirplaneLD-PT-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
405.300 10746.00 23997.00 47.50 TTTTFFTFFTTFTTFF 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.r007-oct2-167813595200267.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is AirplaneLD-PT-0100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595200267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 37K Feb 26 11:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 11:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 55K Feb 26 11:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 325K Feb 26 11:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 39K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 200K Feb 26 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 806K Feb 26 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 89K Feb 26 11:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 542K Feb 26 11:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 433K Mar 5 18:22 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 AirplaneLD-PT-0100-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678345229936

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:00:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 07:00:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:00:32] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-09 07:00:32] [INFO ] Transformed 719 places.
[2023-03-09 07:00:32] [INFO ] Transformed 808 transitions.
[2023-03-09 07:00:32] [INFO ] Parsed PT model containing 719 places and 808 transitions and 3078 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 302 places and 0 transitions.
FORMULA AirplaneLD-PT-0100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 318 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 808/808 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 321 transition count 712
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 321 transition count 712
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 288 place count 321 transition count 616
Applied a total of 288 rules in 22 ms. Remains 321 /417 variables (removed 96) and now considering 616/808 (removed 192) transitions.
// Phase 1: matrix 616 rows 321 cols
[2023-03-09 07:00:33] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-09 07:00:33] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 07:00:33] [INFO ] Invariant cache hit.
[2023-03-09 07:00:33] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-03-09 07:00:33] [INFO ] Invariant cache hit.
[2023-03-09 07:00:33] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 321/417 places, 616/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 962 ms. Remains : 321/417 places, 616/808 transitions.
Support contains 318 out of 321 places after structural reductions.
[2023-03-09 07:00:34] [INFO ] Flatten gal took : 81 ms
[2023-03-09 07:00:34] [INFO ] Flatten gal took : 31 ms
[2023-03-09 07:00:34] [INFO ] Input system was already deterministic with 616 transitions.
Support contains 317 out of 321 places (down from 318) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-09 07:00:35] [INFO ] Invariant cache hit.
[2023-03-09 07:00:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 07:00:35] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:00:35] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA AirplaneLD-PT-0100-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 321 stabilizing places and 616 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 321 transition count 616
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA AirplaneLD-PT-0100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 616/616 transitions.
Graph (complete) has 834 edges and 321 vertex of which 1 are kept as prefixes of interest. Removing 320 places using SCC suffix rule.5 ms
Discarding 320 places :
Also discarding 416 output transitions
Drop transitions removed 416 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 1 transition count 1
Applied a total of 200 rules in 19 ms. Remains 1 /321 variables (removed 320) and now considering 1/616 (removed 615) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-09 07:00:35] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 07:00:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 07:00:36] [INFO ] Invariant cache hit.
[2023-03-09 07:00:36] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-09 07:00:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 07:00:36] [INFO ] Invariant cache hit.
[2023-03-09 07:00:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/321 places, 1/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 1/321 places, 1/616 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-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:(GT 1 s0)], 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 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLCardinality-01 finished in 1073 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||G(p1)))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 616/616 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 318 transition count 616
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 302 place count 19 transition count 317
Iterating global reduction 1 with 299 rules applied. Total rules applied 601 place count 19 transition count 317
Ensure Unique test removed 299 transitions
Reduce isomorphic transitions removed 299 transitions.
Iterating post reduction 1 with 299 rules applied. Total rules applied 900 place count 19 transition count 18
Applied a total of 900 rules in 40 ms. Remains 19 /321 variables (removed 302) and now considering 18/616 (removed 598) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 07:00:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:00:37] [INFO ] Implicit Places using invariants in 51 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/321 places, 18/616 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 18/321 places, 18/616 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT s2 (ADD s3 s4)), p0:(GT s13 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-07 finished in 276 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((X(p0)||G(p1)))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 616/616 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 318 transition count 616
Discarding 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 300 place count 21 transition count 319
Iterating global reduction 1 with 297 rules applied. Total rules applied 597 place count 21 transition count 319
Ensure Unique test removed 297 transitions
Reduce isomorphic transitions removed 297 transitions.
Iterating post reduction 1 with 297 rules applied. Total rules applied 894 place count 21 transition count 22
Applied a total of 894 rules in 12 ms. Remains 21 /321 variables (removed 300) and now considering 22/616 (removed 594) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-09 07:00:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:00:37] [INFO ] Implicit Places using invariants in 63 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/321 places, 22/616 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 20/321 places, 22/616 transitions.
Stuttering acceptance computed with spot in 425 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(GT s12 s15), p1:(GT s10 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-08 finished in 546 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(F(p0)))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 616/616 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 318 transition count 616
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 302 place count 19 transition count 317
Iterating global reduction 1 with 299 rules applied. Total rules applied 601 place count 19 transition count 317
Ensure Unique test removed 299 transitions
Reduce isomorphic transitions removed 299 transitions.
Iterating post reduction 1 with 299 rules applied. Total rules applied 900 place count 19 transition count 18
Applied a total of 900 rules in 17 ms. Remains 19 /321 variables (removed 302) and now considering 18/616 (removed 598) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 07:00:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:00:37] [INFO ] Implicit Places using invariants in 56 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/321 places, 18/616 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 18/321 places, 18/616 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s14 s17)], 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22288 reset in 248 ms.
Product exploration explored 100000 steps with 22336 reset in 118 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLCardinality-10 finished in 897 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(p0))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 616/616 transitions.
Graph (complete) has 834 edges and 321 vertex of which 210 are kept as prefixes of interest. Removing 111 places using SCC suffix rule.1 ms
Discarding 111 places :
Also discarding 208 output transitions
Drop transitions removed 208 transitions
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 12 transition count 210
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 12 transition count 210
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 place count 12 transition count 12
Applied a total of 595 rules in 8 ms. Remains 12 /321 variables (removed 309) and now considering 12/616 (removed 604) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-09 07:00:38] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:00:38] [INFO ] Implicit Places using invariants in 47 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/321 places, 12/616 transitions.
Graph (complete) has 9 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-09 07:00:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 07:00:38] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 07:00:38] [INFO ] Invariant cache hit.
[2023-03-09 07:00:38] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/321 places, 10/616 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 9/321 places, 10/616 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 32729 reset in 77 ms.
Product exploration explored 100000 steps with 32739 reset in 117 ms.
Computed a total of 9 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLCardinality-12 finished in 752 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))||(G(p1)&&X((p2&&(p3 U p4))))))'
Support contains 7 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 616/616 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 319 transition count 616
Discarding 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 299 place count 22 transition count 319
Iterating global reduction 1 with 297 rules applied. Total rules applied 596 place count 22 transition count 319
Ensure Unique test removed 297 transitions
Reduce isomorphic transitions removed 297 transitions.
Iterating post reduction 1 with 297 rules applied. Total rules applied 893 place count 22 transition count 22
Applied a total of 893 rules in 14 ms. Remains 22 /321 variables (removed 299) and now considering 22/616 (removed 594) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-09 07:00:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:00:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 07:00:39] [INFO ] Invariant cache hit.
[2023-03-09 07:00:39] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-09 07:00:39] [INFO ] Invariant cache hit.
[2023-03-09 07:00:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/321 places, 22/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 22/321 places, 22/616 transitions.
Stuttering acceptance computed with spot in 439 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4))), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0) p2 p4), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0) p2 (NOT p4) p3), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) p4), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p4) p3), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ s2 s3), p0:(GT s21 s14), p2:(LEQ 1 s18), p4:(LEQ 1 s9), p3:(LEQ 1 s0)], 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, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 5 reset in 1 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-14 finished in 701 ms.
All properties solved by simple procedures.
Total runtime 7652 ms.
ITS solved all properties within timeout

BK_STOP 1678345240682

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="AirplaneLD-PT-0100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AirplaneLD-PT-0100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595200267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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