fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r197-smll-162089452200325
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for SatelliteMemory-PT-X01500Y0046

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1292.932 45374.00 62393.00 551.00 FFFFTFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r197-smll-162089452200325.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SatelliteMemory-PT-X01500Y0046, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089452200325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 11:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 12 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 5 16:52 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 SatelliteMemory-PT-X01500Y0046-00
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-01
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-02
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-03
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-04
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-05
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-06
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-07
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-08
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-09
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-10
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-11
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-12
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-13
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-14
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-15

=== Now, execution of the tool begins

BK_START 1621120984529

Running Version 0
[2021-05-15 23:23:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 23:23:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 23:23:07] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2021-05-15 23:23:07] [INFO ] Transformed 13 places.
[2021-05-15 23:23:07] [INFO ] Transformed 10 transitions.
[2021-05-15 23:23:07] [INFO ] Parsed PT model containing 13 places and 10 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 23:23:07] [INFO ] Initial state test concluded for 5 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA SatelliteMemory-PT-X01500Y0046-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01500Y0046-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01500Y0046-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01500Y0046-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01500Y0046-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 15 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:08] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-15 23:23:08] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:08] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 23:23:08] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
[2021-05-15 23:23:08] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 23:23:08] [INFO ] Flatten gal took : 22 ms
FORMULA SatelliteMemory-PT-X01500Y0046-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 23:23:08] [INFO ] Flatten gal took : 7 ms
[2021-05-15 23:23:08] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=322 ) properties (out of 17) seen :15
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:09] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-15 23:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:23:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-15 23:23:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:23:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-15 23:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:23:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-15 23:23:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-15 23:23:09] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-15 23:23:09] [INFO ] Added : 4 causal constraints over 1 iterations in 32 ms. Result :sat
[2021-05-15 23:23:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 12 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-15 23:23:09] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 23:23:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-15 23:23:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 23:23:09] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-15 23:23:09] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-15 23:23:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-15 23:23:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-15 23:23:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 23:23:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-00 automaton TGBA [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:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-00 finished in 409 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:09] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:09] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:09] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:09] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2021-05-15 23:23:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:09] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-15 23:23:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-02 automaton TGBA [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=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1408) (GEQ s6 92)), p1:(LT s7 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 1 reset in 370 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-02 finished in 733 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:10] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:10] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 23:23:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:10] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 23:23:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s2 1), p0:(OR (LT s0 1) (LT s8 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 32372 reset in 200 ms.
Product exploration explored 100000 steps with 32133 reset in 200 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 32298 reset in 121 ms.
Product exploration explored 100000 steps with 32054 reset in 217 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:12] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:12] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
[2021-05-15 23:23:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:12] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Product exploration explored 100000 steps with 32108 reset in 451 ms.
Product exploration explored 100000 steps with 32200 reset in 378 ms.
[2021-05-15 23:23:13] [INFO ] Flatten gal took : 5 ms
[2021-05-15 23:23:13] [INFO ] Flatten gal took : 5 ms
[2021-05-15 23:23:13] [INFO ] Time to serialize gal into /tmp/LTL3381606070653394486.gal : 2 ms
[2021-05-15 23:23:13] [INFO ] Time to serialize properties into /tmp/LTL2487696549678813906.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3381606070653394486.gal, -t, CGAL, -LTL, /tmp/LTL2487696549678813906.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3381606070653394486.gal -t CGAL -LTL /tmp/LTL2487696549678813906.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(p11>=1)"))&&("(((p1<1)||(p6<1))||(p5<1))"))))
Formula 0 simplified : !X("(((p1<1)||(p6<1))||(p5<1))" & F"(p11>=1)")
Detected timeout of ITS tools.
[2021-05-15 23:23:28] [INFO ] Flatten gal took : 6 ms
[2021-05-15 23:23:28] [INFO ] Applying decomposition
[2021-05-15 23:23:28] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6222993309759444532.txt, -o, /tmp/graph6222993309759444532.bin, -w, /tmp/graph6222993309759444532.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6222993309759444532.bin, -l, -1, -v, -w, /tmp/graph6222993309759444532.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 23:23:28] [INFO ] Decomposing Gal with order
[2021-05-15 23:23:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 23:23:28] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-15 23:23:28] [INFO ] Flatten gal took : 64 ms
[2021-05-15 23:23:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-15 23:23:28] [INFO ] Time to serialize gal into /tmp/LTL7167547387688334529.gal : 2 ms
[2021-05-15 23:23:28] [INFO ] Time to serialize properties into /tmp/LTL14564185074374567306.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7167547387688334529.gal, -t, CGAL, -LTL, /tmp/LTL14564185074374567306.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7167547387688334529.gal -t CGAL -LTL /tmp/LTL14564185074374567306.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(u0.p11>=1)"))&&("(((i1.u2.p1<1)||(i1.u1.p6<1))||(u0.p5<1))"))))
Formula 0 simplified : !X("(((i1.u2.p1<1)||(i1.u1.p6<1))||(u0.p5<1))" & F"(u0.p11>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15378206756611162077
[2021-05-15 23:23:43] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15378206756611162077
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15378206756611162077]
Compilation finished in 471 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15378206756611162077]
Link finished in 69 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&(LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15378206756611162077]
LTSmin run took 972 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SatelliteMemory-PT-X01500Y0046-05 finished in 34504 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F((G(F(p0))||p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:44] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:45] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:45] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s11 1500), p1:(OR (LT s0 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25036 reset in 143 ms.
Stack based approach found an accepted trace after 10 steps with 1 reset with depth 6 and stack size 6 in 2 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-07 finished in 413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&(X(p1)||F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:45] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-15 23:23:45] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 23:23:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LT s7 1), p2:(OR (LT s3 1408) (LT s5 1408)), p1:(OR (LT s1 1) (LT s3 1) (LT s7 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-09 finished in 377 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(!p0)&&G((p1 U p2))) U G(p3)))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:45] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:45] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-15 23:23:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:45] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p3), true, p0, (NOT p2), (AND (NOT p2) p3), (NOT p3)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-10 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 1}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (LT s7 1) (LT s3 1) (LT s9 1)), p2:(AND (GEQ s3 1) (GEQ s9 1)), p1:(AND (GEQ s3 1408) (GEQ s6 92)), p0:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-10 finished in 419 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((!p0||X(!p1))) U (G((!p0||X(!p1)))&&p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:46] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1, (AND p0 p1), true]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1)), p0:(OR (LT s1 1) (LT s3 1) (LT s7 1) (LT s10 1)), p1:(OR (LT s3 1408) (LT s5 1408))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 2 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-11 finished in 373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:46] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 23:23:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p1:(AND (GEQ s3 1408) (GEQ s6 92))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-12 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 23:23:46] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 23:23:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GEQ s5 1500), p0:(AND (GEQ s3 1408) (GEQ s6 92))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, 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 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-14 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X((p1 U (p2||G(p1))))&&p0) U (G((X((p1 U (p2||G(p1))))&&p3))||(X((p1 U (p2||G(p1))))&&((!p2&&X(!p5)) U ((X(!p5)&&p6)||G((!p2&&X(!p5)))))&&p4))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:47] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 23:23:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 23:23:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 23:23:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Spot run failed in 166 ms. Status :135
Stuttering acceptance computed with spot in 1360 ms :[false, true, p5, (AND (NOT p2) (NOT p1)), (OR (AND p3 (NOT p2) (NOT p1)) (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p5) (NOT p6) p2) (AND (NOT p2) p5) (AND p5 p6)), (OR (AND (NOT p1) (NOT p2) p5) (AND (NOT p3) p5)), (OR (AND (NOT p2) (NOT p3) (NOT p4) p5) (AND p2 (NOT p3) (NOT p5) (NOT p6)) (AND (NOT p3) (NOT p4) p5 p6) (AND p0 (NOT p1) (NOT p2) p5) (AND (NOT p1) (NOT p2) p3 p5)), (OR (AND (NOT p1) (NOT p2) p5) (AND (NOT p3) p5)), (OR (AND p2 (NOT p3) (NOT p5) (NOT p6)) (AND (NOT p2) (NOT p3) p5) (AND (NOT p1) (NOT p2) p5) (AND (NOT p3) p5 p6)), (AND (NOT p2) (NOT p1) p5), (AND (NOT p1) (NOT p2) p5)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-15 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) (NOT p4) p0) (AND (NOT p3) (NOT p6) p2 p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p4) p0) (AND p3 (NOT p6) p2 p0)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p6) p2 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p4 p6 (NOT p0)) (AND (NOT p3) p4 (NOT p2) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR p3 (AND p4 p6) (AND p4 (NOT p2)) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 (NOT p4) (NOT p0)) (AND p3 (NOT p6) p2 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p4 (NOT p6) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p3) p4 p6 p0) (AND (NOT p3) p4 (NOT p2) p0)), acceptance={0, 1} source=0 dest: 6}, { cond=(OR (AND p3 p4 p6 p0) (AND p3 p4 (NOT p2) p0)), acceptance={1} source=0 dest: 6}, { cond=(AND (NOT p3) p4 (NOT p6) (NOT p2) p0), acceptance={0} source=0 dest: 7}, { cond=(AND p3 p4 (NOT p6) (NOT p2) p0), acceptance={} source=0 dest: 7}, { cond=(OR (AND p3 p4 p6 (NOT p0)) (AND p3 p4 (NOT p2) (NOT p0))), acceptance={} source=0 dest: 8}, { cond=(AND p3 p4 (NOT p6) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 9}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=p5, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p3 p2) (AND p3 (NOT p1))), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p6) p2 (NOT p5)), acceptance={} source=5 dest: 1}, { cond=(OR p6 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p6) (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p4) p0 p5) (AND (NOT p3) (NOT p6) p2 p0 p5)), acceptance={0, 1} source=6 dest: 0}, { cond=(OR (AND p3 (NOT p4) p0 p5) (AND p3 (NOT p6) p2 p0 p5)), acceptance={1} source=6 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p0) p5) (AND (NOT p3) (NOT p6) p2 (NOT p0) p5)), acceptance={} source=6 dest: 1}, { cond=(OR (AND (NOT p3) p4 p6 (NOT p0) p5) (AND (NOT p3) p4 (NOT p2) (NOT p0) p5)), acceptance={} source=6 dest: 2}, { cond=(OR (AND p3 p5) (AND p4 p6 p5) (AND p4 (NOT p2) p5) (AND p0 p5)), acceptance={} source=6 dest: 3}, { cond=(OR (AND p3 (NOT p4) (NOT p0) p5) (AND p3 (NOT p6) p2 (NOT p0) p5)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p4 (NOT p6) (NOT p2) (NOT p0) p5), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p3) p4 p6 p0 p5) (AND (NOT p3) p4 (NOT p2) p0 p5)), acceptance={0, 1} source=6 dest: 6}, { cond=(OR (AND p3 p4 p6 p0 p5) (AND p3 p4 (NOT p2) p0 p5)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p3) p4 (NOT p6) (NOT p2) p0 p5), acceptance={0} source=6 dest: 7}, { cond=(AND p3 p4 (NOT p6) (NOT p2) p0 p5), acceptance={} source=6 dest: 7}, { cond=(OR (AND p3 p4 p6 (NOT p0) p5) (AND p3 p4 (NOT p2) (NOT p0) p5)), acceptance={} source=6 dest: 8}, { cond=(AND p3 p4 (NOT p6) (NOT p2) (NOT p0) p5), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p3) (NOT p6) p2 p0 (NOT p5)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p3 (NOT p6) p2 p0 (NOT p5)), acceptance={1} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p6) p2 (NOT p0) (NOT p5)), acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p4) p6 (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p2) (NOT p0)) (AND (NOT p3) p6 (NOT p0) (NOT p5)) (AND (NOT p3) (NOT p2) (NOT p0) (NOT p5))), acceptance={} source=7 dest: 2}, { cond=(OR (AND p3 (NOT p6) p2 (NOT p5)) (AND (NOT p6) p2 p0 (NOT p5))), acceptance={} source=7 dest: 3}, { cond=(AND p3 (NOT p6) p2 (NOT p0) (NOT p5)), acceptance={} source=7 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p6) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p6) (NOT p2) (NOT p0) (NOT p5))), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p4) p6 p0) (AND (NOT p3) (NOT p4) (NOT p2) p0) (AND (NOT p3) p6 p0 (NOT p5)) (AND (NOT p3) (NOT p2) p0 (NOT p5))), acceptance={0, 1} source=7 dest: 6}, { cond=(OR (AND p3 (NOT p4) p6 p0) (AND p3 (NOT p4) (NOT p2) p0) (AND p3 p6 p0 (NOT p5)) (AND p3 (NOT p2) p0 (NOT p5))), acceptance={1} source=7 dest: 6}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p6) (NOT p2) p0) (AND (NOT p3) (NOT p6) (NOT p2) p0 (NOT p5))), acceptance={0} source=7 dest: 7}, { cond=(OR (AND p3 (NOT p4) (NOT p6) (NOT p2) p0) (AND p3 (NOT p6) (NOT p2) p0 (NOT p5))), acceptance={} source=7 dest: 7}, { cond=(OR (AND p3 (NOT p4) p6 (NOT p0)) (AND p3 (NOT p4) (NOT p2) (NOT p0)) (AND p3 p6 (NOT p0) (NOT p5)) (AND p3 (NOT p2) (NOT p0) (NOT p5))), acceptance={} source=7 dest: 8}, { cond=(OR (AND p3 (NOT p4) (NOT p6) (NOT p2) (NOT p0)) (AND p3 (NOT p6) (NOT p2) (NOT p0) (NOT p5))), acceptance={} source=7 dest: 9}, { cond=(OR (AND p3 p6) (AND p3 (NOT p2)) (AND p6 p0) (AND (NOT p2) p0)), acceptance={} source=7 dest: 10}, { cond=(OR (AND p3 (NOT p6) (NOT p2)) (AND (NOT p6) (NOT p2) p0)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p3) p5), acceptance={} source=8 dest: 1}, { cond=(AND p3 p5), acceptance={} source=8 dest: 3}, { cond=(AND p3 p5), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p3) (NOT p6) p2 (NOT p5)), acceptance={} source=9 dest: 1}, { cond=(OR (AND (NOT p3) p6) (AND (NOT p3) (NOT p2))), acceptance={} source=9 dest: 2}, { cond=(AND p3 (NOT p6) p2 (NOT p5)), acceptance={} source=9 dest: 3}, { cond=(AND p3 (NOT p6) p2 (NOT p5)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p3) (NOT p6) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(OR (AND p3 p6) (AND p3 (NOT p2))), acceptance={} source=9 dest: 8}, { cond=(AND p3 (NOT p6) (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(OR (AND p3 p6) (AND p3 (NOT p2))), acceptance={} source=9 dest: 10}, { cond=(AND p3 (NOT p6) (NOT p2)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1) p5), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p2) p1 p5), acceptance={} source=10 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 2}, { cond=(AND (NOT p6) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p6) (NOT p2) p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p3:(AND (OR (LT s3 1408) (LT s6 92)) (LT s5 1500)), p4:(AND (LT s5 1500) (OR (LT s3 1408) (LT s6 92))), p0:(AND (LT s5 1500) (OR (LT s3 1408) (LT s6 92))), p6:(AND (OR (LT s3 1408) (LT s6 92)) (LT s5 1500)), p2:(AND (GEQ s3 1408) (GEQ s6 92)), p5:(GEQ s5 1500), p1:(AND (OR (LT s3 1408) (LT s6 92)) (LT s5 1500))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7849 steps with 1 reset in 63 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-15 finished in 1636 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621121029903

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SatelliteMemory-PT-X01500Y0046"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SatelliteMemory-PT-X01500Y0046, 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 r197-smll-162089452200325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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