fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r021-smll-171620127900107
Last Updated
July 7, 2024

About the Execution of 2023-gold for AirplaneLD-COL-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
438.527 16913.00 28048.00 603.60 FTFTFTTFFFTFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620127900107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AirplaneLD-COL-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127900107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.1K Apr 12 03:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 12 03:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 03:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 03:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 03:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 03:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 03:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K May 18 16:42 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-COL-0010-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716496354949

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-0010
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-23 20:32:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:32:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:32:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-23 20:32:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-23 20:32:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1172 ms
[2024-05-23 20:32:39] [INFO ] Detected 3 constant HL places corresponding to 32 PT places.
[2024-05-23 20:32:39] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 89 PT places and 132.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2024-05-23 20:32:39] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 7 ms.
[2024-05-23 20:32:39] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA AirplaneLD-COL-0010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0010-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0010-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0010-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0010-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1249 resets, run finished after 679 ms. (steps per millisecond=14 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 336 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 399 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 385 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 329 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 347 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 14 rows 17 cols
[2024-05-23 20:32:40] [INFO ] Computed 3 invariants in 5 ms
[2024-05-23 20:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-23 20:32:40] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 20:32:40] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA AirplaneLD-COL-0010-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0010-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0010-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 20:32:40] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-23 20:32:40] [INFO ] Flatten gal took : 29 ms
FORMULA AirplaneLD-COL-0010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0010-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 20:32:40] [INFO ] Flatten gal took : 9 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:20) in guard (OR (GEQ $A 9) (EQ $A 19))introduces in Altitude(20) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:20) in guard (AND (LT $A 9) (NEQ $A 19))introduces in Altitude(20) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 20 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 9) (EQ $A 19)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 9) (NEQ $A 19)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:10) in guard (OR (LEQ $S 4) (EQ $S 9))introduces in Speed(10) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:10) in guard (AND (GT $S 4) (NEQ $S 9))introduces in Speed(10) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:10) in guard (OR (LEQ $S 4) (EQ $S 9))introduces in Speed(10) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:10) in guard (AND (GT $S 4) (NEQ $S 9))introduces in Speed(10) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 10 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 4) (EQ $S 9)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 4) (NEQ $S 9)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 4) (EQ $S 9)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 4) (NEQ $S 9)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2024-05-23 20:32:40] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 19 ms.
[2024-05-23 20:32:40] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 17 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 10 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-23 20:32:41] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 20:32:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 20:32:41] [INFO ] Invariant cache hit.
[2024-05-23 20:32:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-23 20:32:41] [INFO ] Invariant cache hit.
[2024-05-23 20:32:41] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 22/23 places, 20/20 transitions.
Support contains 17 out of 22 places after structural reductions.
[2024-05-23 20:32:41] [INFO ] Flatten gal took : 5 ms
[2024-05-23 20:32:41] [INFO ] Flatten gal took : 5 ms
[2024-05-23 20:32:41] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10000 steps, including 231 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:32:41] [INFO ] Invariant cache hit.
[2024-05-23 20:32:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 20:32:41] [INFO ] After 67ms 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.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Graph (complete) has 30 edges and 22 vertex of which 9 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 9
Applied a total of 2 rules in 6 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-23 20:32:41] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 20:32:41] [INFO ] Implicit Places using invariants in 36 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 9/20 transitions.
Graph (complete) has 5 edges and 8 vertex of which 7 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 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 7
Applied a total of 3 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-23 20:32:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 20:32:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 20:32:41] [INFO ] Invariant cache hit.
[2024-05-23 20:32:41] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/22 places, 7/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 6/22 places, 7/20 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 225 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLCardinality-04 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 s0 (ADD s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA AirplaneLD-COL-0010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLCardinality-04 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 3 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 20:32:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:32:41] [INFO ] Implicit Places using invariants in 37 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 18/20 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 42 ms. Remains : 18/22 places, 18/20 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s4 (ADD s9 s10))], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLCardinality-07 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Graph (complete) has 30 edges and 22 vertex of which 20 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 20:32:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:32:42] [INFO ] Implicit Places using invariants in 38 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/22 places, 20/20 transitions.
Graph (complete) has 17 edges and 19 vertex of which 18 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
Applied a total of 1 rules in 5 ms. Remains 18 /19 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 18 cols
[2024-05-23 20:32:42] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 20:32:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 20:32:42] [INFO ] Invariant cache hit.
[2024-05-23 20:32:42] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/22 places, 19/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 18/22 places, 19/20 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 s5) (LEQ s8 (ADD s16 s17)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13664 reset in 584 ms.
Product exploration explored 100000 steps with 13727 reset in 334 ms.
Computed a total of 18 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 19
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, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Finished random walk after 91 steps, including 12 resets, run visited all 1 properties in 6 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-05-23 20:32:44] [INFO ] Invariant cache hit.
[2024-05-23 20:32:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 20:32:44] [INFO ] Invariant cache hit.
[2024-05-23 20:32:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-23 20:32:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:32:44] [INFO ] Invariant cache hit.
[2024-05-23 20:32:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 18/18 places, 19/19 transitions.
Computed a total of 18 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 19
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, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 173 steps, including 24 resets, run visited all 1 properties in 3 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13644 reset in 187 ms.
Product exploration explored 100000 steps with 13678 reset in 544 ms.
Built C files in :
/tmp/ltsmin417816151079612551
[2024-05-23 20:32:45] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2024-05-23 20:32:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:45] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2024-05-23 20:32:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:45] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2024-05-23 20:32:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:45] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin417816151079612551
Running compilation step : cd /tmp/ltsmin417816151079612551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 358 ms.
Running link step : cd /tmp/ltsmin417816151079612551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin417816151079612551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16410902493216781021.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA AirplaneLD-COL-0010-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-COL-0010-LTLCardinality-10 finished in 4194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1||X(G(p1)))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 2 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 20:32:46] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:32:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 20:32:46] [INFO ] Invariant cache hit.
[2024-05-23 20:32:46] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-23 20:32:46] [INFO ] Invariant cache hit.
[2024-05-23 20:32:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/22 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 19/22 places, 18/20 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLCardinality-11 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 1 s9), p1:(GT s4 s0)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0010-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLCardinality-11 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-23 20:32:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 20:32:46] [INFO ] Implicit Places using invariants in 50 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 20/20 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 1 place count 21 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 19
Applied a total of 2 rules in 6 ms. Remains 20 /21 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 20 cols
[2024-05-23 20:32:46] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:32:46] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 20:32:46] [INFO ] Invariant cache hit.
[2024-05-23 20:32:46] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/22 places, 19/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 152 ms. Remains : 20/22 places, 19/20 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s12 s13) (ADD s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14044 reset in 207 ms.
Product exploration explored 100000 steps with 14052 reset in 190 ms.
Computed a total of 20 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 19
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, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 246 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 262 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-05-23 20:32:48] [INFO ] Invariant cache hit.
[2024-05-23 20:32:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-23 20:32:48] [INFO ] Invariant cache hit.
[2024-05-23 20:32:48] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-23 20:32:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:32:48] [INFO ] Invariant cache hit.
[2024-05-23 20:32:48] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 20/20 places, 19/19 transitions.
Computed a total of 20 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 19
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, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 333 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14048 reset in 176 ms.
Product exploration explored 100000 steps with 14038 reset in 185 ms.
Built C files in :
/tmp/ltsmin2603101616836800293
[2024-05-23 20:32:49] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2024-05-23 20:32:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:49] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2024-05-23 20:32:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:49] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2024-05-23 20:32:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2603101616836800293
Running compilation step : cd /tmp/ltsmin2603101616836800293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin2603101616836800293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2603101616836800293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15085207771956217409.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA AirplaneLD-COL-0010-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-COL-0010-LTLCardinality-12 finished in 3458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Graph (complete) has 30 edges and 22 vertex of which 16 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 3 ms. Remains 16 /22 variables (removed 6) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 16 cols
[2024-05-23 20:32:50] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:32:50] [INFO ] Implicit Places using invariants in 51 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 16/20 transitions.
Graph (complete) has 13 edges and 15 vertex of which 14 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 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 5 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 13 cols
[2024-05-23 20:32:50] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 20:32:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 20:32:50] [INFO ] Invariant cache hit.
[2024-05-23 20:32:50] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/22 places, 14/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 13/22 places, 14/20 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0010-LTLCardinality-14 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 (ADD s11 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0010-LTLCardinality-14 finished in 211 ms.
All properties solved by simple procedures.
Total runtime 12281 ms.

BK_STOP 1716496371862

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AirplaneLD-COL-0010, 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 r021-smll-171620127900107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0010.tgz
mv AirplaneLD-COL-0010 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 ;