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.r083-tall-162048875800781.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FMS-PT-00200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875800781
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 17K May 5 16:51 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 FMS-PT-00200-00
FORMULA_NAME FMS-PT-00200-01
FORMULA_NAME FMS-PT-00200-02
FORMULA_NAME FMS-PT-00200-03
FORMULA_NAME FMS-PT-00200-04
FORMULA_NAME FMS-PT-00200-05
FORMULA_NAME FMS-PT-00200-06
FORMULA_NAME FMS-PT-00200-07
FORMULA_NAME FMS-PT-00200-08
FORMULA_NAME FMS-PT-00200-09
FORMULA_NAME FMS-PT-00200-10
FORMULA_NAME FMS-PT-00200-11
FORMULA_NAME FMS-PT-00200-12
FORMULA_NAME FMS-PT-00200-13
FORMULA_NAME FMS-PT-00200-14
FORMULA_NAME FMS-PT-00200-15

=== Now, execution of the tool begins

BK_START 1620663447082

Running Version 0
[2021-05-10 16:17:28] [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-10 16:17:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 16:17:28] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-10 16:17:28] [INFO ] Transformed 22 places.
[2021-05-10 16:17:28] [INFO ] Transformed 20 transitions.
[2021-05-10 16:17:28] [INFO ] Parsed PT model containing 22 places and 20 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 16:17:28] [INFO ] Initial state test concluded for 2 properties.
Support contains 16 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:17:28] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-10 16:17:28] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:17:28] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:17:28] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:17:28] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 16:17:29] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 16:17:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 16:17:29] [INFO ] Flatten gal took : 19 ms
FORMULA FMS-PT-00200-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 16:17:29] [INFO ] Flatten gal took : 5 ms
[2021-05-10 16:17:29] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 3411 steps, including 0 resets, run visited all 14 properties in 13 ms. (steps per millisecond=262 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 11 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 7 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 4 transition count 4
Applied a total of 31 rules in 15 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:17:29] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 16:17:29] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:17:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 16:17:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-10 16:17:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:17:29] [INFO ] Computed 2 place invariants in 8 ms
[2021-05-10 16:17:29] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00200-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s3 1))], 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 2 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00200-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-00 finished in 242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:17:29] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:17:29] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:17:29] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:17:29] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:17:29] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 16:17:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00200-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s0 1), p1:(LT s14 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 5866 reset in 249 ms.
Product exploration explored 100000 steps with 5852 reset in 191 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5870 reset in 136 ms.
Product exploration explored 100000 steps with 5898 reset in 136 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 21 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 21 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 21 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 15 rules in 7 ms. Remains 21 /22 variables (removed 1) and now considering 20/20 (removed 0) transitions.
[2021-05-10 16:17:30] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 16:17:30] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 21 cols
[2021-05-10 16:17:30] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:17:30] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 20/20 transitions.
Product exploration explored 100000 steps with 10181 reset in 232 ms.
Product exploration explored 100000 steps with 10164 reset in 174 ms.
[2021-05-10 16:17:31] [INFO ] Flatten gal took : 3 ms
[2021-05-10 16:17:31] [INFO ] Flatten gal took : 3 ms
[2021-05-10 16:17:31] [INFO ] Time to serialize gal into /tmp/LTL17304295257952980512.gal : 1 ms
[2021-05-10 16:17:31] [INFO ] Time to serialize properties into /tmp/LTL14305189894354698188.ltl : 0 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/LTL17304295257952980512.gal, -t, CGAL, -LTL, /tmp/LTL14305189894354698188.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/LTL17304295257952980512.gal -t CGAL -LTL /tmp/LTL14305189894354698188.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(P1d>=1)"))||(X(G("(P12s<1)"))))))
Formula 0 simplified : !X(F"(P1d>=1)" | XG"(P12s<1)")
Detected timeout of ITS tools.
[2021-05-10 16:17:46] [INFO ] Flatten gal took : 2 ms
[2021-05-10 16:17:46] [INFO ] Applying decomposition
[2021-05-10 16:17:46] [INFO ] Flatten gal took : 6 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/graph6589145658725071325.txt, -o, /tmp/graph6589145658725071325.bin, -w, /tmp/graph6589145658725071325.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/graph6589145658725071325.bin, -l, -1, -v, -w, /tmp/graph6589145658725071325.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 16:17:46] [INFO ] Decomposing Gal with order
[2021-05-10 16:17:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 16:17:46] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 16:17:46] [INFO ] Flatten gal took : 23 ms
[2021-05-10 16:17:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 16:17:46] [INFO ] Time to serialize gal into /tmp/LTL18131140580628415702.gal : 1 ms
[2021-05-10 16:17:46] [INFO ] Time to serialize properties into /tmp/LTL7505297454037127579.ltl : 0 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/LTL18131140580628415702.gal, -t, CGAL, -LTL, /tmp/LTL7505297454037127579.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/LTL18131140580628415702.gal -t CGAL -LTL /tmp/LTL7505297454037127579.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(i1.u0.P1d>=1)"))||(X(G("(i0.u6.P12s<1)"))))))
Formula 0 simplified : !X(F"(i1.u0.P1d>=1)" | XG"(i0.u6.P12s<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6204622944286630562
[2021-05-10 16:18:01] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6204622944286630562
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/ltsmin6204622944286630562]
Compilation finished in 224 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6204622944286630562]
Link finished in 39 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))||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6204622944286630562]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FMS-PT-00200-01 finished in 46943 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 11 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 7 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 4 transition count 4
Applied a total of 31 rules in 4 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:18:16] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 16:18:16] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:18:16] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 16:18:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-10 16:18:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 16:18:16] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 16:18:16] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : FMS-PT-00200-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-03 finished in 100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:16] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:16] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 16:18:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-00200-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p0:(GEQ s6 1), p1:(OR (LT s2 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7805 reset in 107 ms.
Stack based approach found an accepted trace after 141 steps with 12 reset with depth 15 and stack size 15 in 1 ms.
FORMULA FMS-PT-00200-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-04 finished in 321 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||X((F(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:16] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : FMS-PT-00200-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(OR (LT s5 1) (LT s7 1)), p2:(GEQ s11 1), p1:(AND (GEQ s5 1) (GEQ s7 1) (LT s11 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 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-05 finished in 184 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U ((p1&&X(p0))||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:17] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FMS-PT-00200-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s9 1), p1:(OR (LT s5 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-06 finished in 189 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 9 / 15 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 9 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 20 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 5 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 5 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 27 place count 5 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 2 transition count 3
Applied a total of 32 rules in 2 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 16:18:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 16:18:17] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 16:18:17] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 16:18:17] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-10 16:18:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 16:18:17] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-10 16:18:17] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00200-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-07 finished in 64 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0||(X(X(X(p0)))&&(p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:17] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:17] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-00200-08 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s18 1)), p1:(LT s16 1), p2:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property FMS-PT-00200-08 finished in 96 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:17] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:17] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00200-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s16 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 22 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 21 transition count 19
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 21 transition count 25
Deduced a syphon composed of 12 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 21 transition count 21
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 19 rules in 5 ms. Remains 21 /22 variables (removed 1) and now considering 21/20 (removed -1) transitions.
[2021-05-10 16:18:18] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 16:18:18] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
// Phase 1: matrix 20 rows 21 cols
[2021-05-10 16:18:18] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 21/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
[2021-05-10 16:18:18] [INFO ] Flatten gal took : 1 ms
[2021-05-10 16:18:18] [INFO ] Flatten gal took : 1 ms
[2021-05-10 16:18:18] [INFO ] Time to serialize gal into /tmp/LTL11584411391767301313.gal : 1 ms
[2021-05-10 16:18:18] [INFO ] Time to serialize properties into /tmp/LTL16918386093122582727.ltl : 0 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/LTL11584411391767301313.gal, -t, CGAL, -LTL, /tmp/LTL16918386093122582727.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/LTL11584411391767301313.gal -t CGAL -LTL /tmp/LTL16918386093122582727.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(P3s<1)"))))
Formula 0 simplified : !XF"(P3s<1)"
Detected timeout of ITS tools.
[2021-05-10 16:18:33] [INFO ] Flatten gal took : 2 ms
[2021-05-10 16:18:33] [INFO ] Applying decomposition
[2021-05-10 16:18:33] [INFO ] Flatten gal took : 2 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/graph7397892798117725120.txt, -o, /tmp/graph7397892798117725120.bin, -w, /tmp/graph7397892798117725120.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/graph7397892798117725120.bin, -l, -1, -v, -w, /tmp/graph7397892798117725120.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 16:18:33] [INFO ] Decomposing Gal with order
[2021-05-10 16:18:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 16:18:33] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 16:18:33] [INFO ] Flatten gal took : 10 ms
[2021-05-10 16:18:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 16:18:33] [INFO ] Time to serialize gal into /tmp/LTL4061775181123829940.gal : 1 ms
[2021-05-10 16:18:33] [INFO ] Time to serialize properties into /tmp/LTL2867231273031746152.ltl : 0 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/LTL4061775181123829940.gal, -t, CGAL, -LTL, /tmp/LTL2867231273031746152.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/LTL4061775181123829940.gal -t CGAL -LTL /tmp/LTL2867231273031746152.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(u7.P3s<1)"))))
Formula 0 simplified : !XF"(u7.P3s<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4485955098657346124
[2021-05-10 16:18:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4485955098657346124
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/ltsmin4485955098657346124]
Compilation finished in 128 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4485955098657346124]
Link finished in 34 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin4485955098657346124]
LTSmin run took 132 ms.
FORMULA FMS-PT-00200-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-00200-09 finished in 31474 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 9 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 12 place count 15 transition count 14
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 19 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 10 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 20 place count 10 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 27 place count 6 transition count 8
Applied a total of 27 rules in 3 ms. Remains 6 /22 variables (removed 16) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 16:18:48] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 16:18:48] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 16:18:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 16:18:48] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-10 16:18:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 16:18:48] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 16:18:48] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00200-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-10 finished in 103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((F(p0)||X(G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:48] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:48] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:48] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 16:18:49] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:49] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : FMS-PT-00200-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GEQ s19 1), p1:(LT s1 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5963 reset in 94 ms.
Stack based approach found an accepted trace after 249 steps with 14 reset with depth 14 and stack size 14 in 0 ms.
FORMULA FMS-PT-00200-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-11 finished in 332 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(X(!p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:49] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:49] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 16:18:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 162 ms :[p1, p1, p1, p1, true, p1, (NOT p0)]
Running random walk in product with property : FMS-PT-00200-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s20 1), p1:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 73 ms.
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[p1, p1, p1, p1, true, p1, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 79 ms.
Product exploration explored 100000 steps with 33333 reset in 87 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, p1, true, p1, (NOT p0)]
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 22 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 21 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 21 transition count 22
Deduced a syphon composed of 9 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 21 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 14 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 20/20 (removed 0) transitions.
[2021-05-10 16:18:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-10 16:18:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 16:18:50] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 20/20 transitions.
Product exploration explored 100000 steps with 33333 reset in 138 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
[2021-05-10 16:18:50] [INFO ] Flatten gal took : 1 ms
[2021-05-10 16:18:50] [INFO ] Flatten gal took : 2 ms
[2021-05-10 16:18:50] [INFO ] Time to serialize gal into /tmp/LTL3984552523797863271.gal : 1 ms
[2021-05-10 16:18:50] [INFO ] Time to serialize properties into /tmp/LTL5673866008284069786.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/LTL3984552523797863271.gal, -t, CGAL, -LTL, /tmp/LTL5673866008284069786.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/LTL3984552523797863271.gal -t CGAL -LTL /tmp/LTL5673866008284069786.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(P3<1)"))U(X(X("(P2d<1)")))))
Formula 0 simplified : !(G"(P3<1)" U XX"(P2d<1)")
Detected timeout of ITS tools.
[2021-05-10 16:19:05] [INFO ] Flatten gal took : 1 ms
[2021-05-10 16:19:05] [INFO ] Applying decomposition
[2021-05-10 16:19:05] [INFO ] Flatten gal took : 1 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/graph848570427772486774.txt, -o, /tmp/graph848570427772486774.bin, -w, /tmp/graph848570427772486774.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/graph848570427772486774.bin, -l, -1, -v, -w, /tmp/graph848570427772486774.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 16:19:05] [INFO ] Decomposing Gal with order
[2021-05-10 16:19:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 16:19:05] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 16:19:05] [INFO ] Flatten gal took : 5 ms
[2021-05-10 16:19:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 16:19:05] [INFO ] Time to serialize gal into /tmp/LTL14339641016365675715.gal : 1 ms
[2021-05-10 16:19:05] [INFO ] Time to serialize properties into /tmp/LTL14135815707971784289.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/LTL14339641016365675715.gal, -t, CGAL, -LTL, /tmp/LTL14135815707971784289.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/LTL14339641016365675715.gal -t CGAL -LTL /tmp/LTL14135815707971784289.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(u8.P3<1)"))U(X(X("(i1.u7.P2d<1)")))))
Formula 0 simplified : !(G"(u8.P3<1)" U XX"(i1.u7.P2d<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11388906046512940202
[2021-05-10 16:19:20] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11388906046512940202
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/ltsmin11388906046512940202]
Compilation finished in 130 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11388906046512940202]
Link finished in 38 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, ([]((LTLAPp0==true)) U X(X((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11388906046512940202]
LTSmin run took 119 ms.
FORMULA FMS-PT-00200-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-00200-12 finished in 31710 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 9 edges and 13 vertex of which 6 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 9 transition count 12
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 7 transition count 8
Applied a total of 24 rules in 2 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2021-05-10 16:19:21] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 16:19:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 16:19:21] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-10 16:19:21] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 16:19:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 16:19:21] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-10 16:19:21] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 16:19:21] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 16:19:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 16:19:21] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FMS-PT-00200-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 46579 steps with 0 reset in 65 ms.
FORMULA FMS-PT-00200-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-13 finished in 162 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(p0&&F(!p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 13 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 17 place count 13 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 22 place count 10 transition count 10
Applied a total of 22 rules in 4 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 16:19:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 16:19:21] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 16:19:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 16:19:21] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-10 16:19:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 16:19:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 16:19:21] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : FMS-PT-00200-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s9 1), p0:(OR (LT s2 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-14 finished in 138 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 9 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 16 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 16 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 16 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 13 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 23 place count 9 transition count 9
Applied a total of 23 rules in 2 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
[2021-05-10 16:19:21] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-10 16:19:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 16:19:21] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-10 16:19:21] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-10 16:19:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 16:19:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-10 16:19:21] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 16:19:21] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-10 16:19:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 16:19:21] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00200-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1), p1:(OR (LT s6 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 24996 reset in 120 ms.
Product exploration explored 100000 steps with 25022 reset in 86 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25051 reset in 77 ms.
Product exploration explored 100000 steps with 24892 reset in 81 ms.
[2021-05-10 16:19:21] [INFO ] Flatten gal took : 1 ms
[2021-05-10 16:19:21] [INFO ] Flatten gal took : 0 ms
[2021-05-10 16:19:21] [INFO ] Time to serialize gal into /tmp/LTL6553341291113924912.gal : 0 ms
[2021-05-10 16:19:21] [INFO ] Time to serialize properties into /tmp/LTL17507288490165425218.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/LTL6553341291113924912.gal, -t, CGAL, -LTL, /tmp/LTL17507288490165425218.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/LTL6553341291113924912.gal -t CGAL -LTL /tmp/LTL17507288490165425218.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(P2M2>=1)")||(G(F("((P12wM3<1)||(M3<1))"))))))
Formula 0 simplified : !F("(P2M2>=1)" | GF"((P12wM3<1)||(M3<1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
592 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.93157,129076,1,0,406,603442,21,201,1203,439386,1013
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FMS-PT-00200-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FMS-PT-00200-15 finished in 7049 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-10 16:19:28] [INFO ] Applying decomposition
[2021-05-10 16:19:28] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin6724218505830913373
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/graph15705390441843304685.txt, -o, /tmp/graph15705390441843304685.bin, -w, /tmp/graph15705390441843304685.weights], workingDir=null]
[2021-05-10 16:19:28] [INFO ] Computing symmetric may disable matrix : 20 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15705390441843304685.bin, -l, -1, -v, -w, /tmp/graph15705390441843304685.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 16:19:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 16:19:28] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2021-05-10 16:19:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 16:19:28] [INFO ] Decomposing Gal with order
[2021-05-10 16:19:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 16:19:28] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2021-05-10 16:19:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 16:19:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6724218505830913373
[2021-05-10 16:19:28] [INFO ] Removed a total of 1 redundant transitions.
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/ltsmin6724218505830913373]
[2021-05-10 16:19:28] [INFO ] Flatten gal took : 3 ms
[2021-05-10 16:19:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 16:19:28] [INFO ] Time to serialize gal into /tmp/LTLFireability3948663629239823962.gal : 0 ms
[2021-05-10 16:19:28] [INFO ] Time to serialize properties into /tmp/LTLFireability4321807113422678122.ltl : 0 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/LTLFireability3948663629239823962.gal, -t, CGAL, -LTL, /tmp/LTLFireability4321807113422678122.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/LTLFireability3948663629239823962.gal -t CGAL -LTL /tmp/LTLFireability4321807113422678122.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(i0.u0.P1d>=1)"))||(X(G("(i1.u6.P12s<1)"))))))
Formula 0 simplified : !X(F"(i0.u0.P1d>=1)" | XG"(i1.u6.P12s<1)")
Compilation finished in 152 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6724218505830913373]
Link finished in 36 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))||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6724218505830913373]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: "X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.068: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.068: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.068: State length is 23, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.068: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.068: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.068: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.068: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.245: ~1 levels ~960 states ~4104 transitions
pins2lts-mc-linux64( 6/ 8), 0.252: ~1 levels ~1920 states ~9704 transitions
pins2lts-mc-linux64( 5/ 8), 0.254: ~1 levels ~3840 states ~20832 transitions
pins2lts-mc-linux64( 7/ 8), 0.256: ~1 levels ~7680 states ~33912 transitions
pins2lts-mc-linux64( 7/ 8), 0.259: ~1 levels ~15360 states ~68336 transitions
pins2lts-mc-linux64( 7/ 8), 0.277: ~1 levels ~30720 states ~139352 transitions
pins2lts-mc-linux64( 7/ 8), 0.300: ~1 levels ~61440 states ~257288 transitions
pins2lts-mc-linux64( 7/ 8), 0.350: ~1 levels ~122880 states ~531432 transitions
pins2lts-mc-linux64( 7/ 8), 0.450: ~1 levels ~245760 states ~1102696 transitions
pins2lts-mc-linux64( 2/ 8), 0.717: ~1 levels ~491520 states ~2014736 transitions
pins2lts-mc-linux64( 6/ 8), 0.967: ~1 levels ~983040 states ~5591608 transitions
pins2lts-mc-linux64( 2/ 8), 1.782: ~1 levels ~1966080 states ~8611496 transitions
pins2lts-mc-linux64( 2/ 8), 3.375: ~1 levels ~3932160 states ~17642856 transitions
pins2lts-mc-linux64( 2/ 8), 6.578: ~1 levels ~7864320 states ~34203072 transitions
pins2lts-mc-linux64( 2/ 8), 13.664: ~1 levels ~15728640 states ~70215832 transitions
pins2lts-mc-linux64( 2/ 8), 28.536: ~1 levels ~31457280 states ~143589432 transitions
pins2lts-mc-linux64( 2/ 8), 58.547: ~1 levels ~62914560 states ~285338608 transitions
pins2lts-mc-linux64( 2/ 8), 124.133: ~1 levels ~125829120 states ~563216264 transitions
pins2lts-mc-linux64( 3/ 8), 151.023: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 151.035:
pins2lts-mc-linux64( 0/ 8), 151.035: mean standard work distribution: 8.3% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 151.035:
pins2lts-mc-linux64( 0/ 8), 151.035: Explored 119261626 states 650668829 transitions, fanout: 5.456
pins2lts-mc-linux64( 0/ 8), 151.035: Total exploration time 150.950 sec (150.920 sec minimum, 150.936 sec on average)
pins2lts-mc-linux64( 0/ 8), 151.035: States per second: 790074, Transitions per second: 4310492
pins2lts-mc-linux64( 0/ 8), 151.035:
pins2lts-mc-linux64( 0/ 8), 151.035: Progress states detected: 134216044
pins2lts-mc-linux64( 0/ 8), 151.035: Redundant explorations: -11.1421
pins2lts-mc-linux64( 0/ 8), 151.035:
pins2lts-mc-linux64( 0/ 8), 151.035: Queue width: 8B, total height: 30507672, memory: 232.76MB
pins2lts-mc-linux64( 0/ 8), 151.035: Tree memory: 1045.3MB, 8.2 B/state, compr.: 8.7%
pins2lts-mc-linux64( 0/ 8), 151.035: Tree fill ratio (roots/leafs): 99.0%/8.0%
pins2lts-mc-linux64( 0/ 8), 151.035: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 151.035: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 151.035: Est. total memory use: 1278.0MB (~1256.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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))||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6724218505830913373]
255
java.lang.RuntimeException: Unexpected exception when executing 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))||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6724218505830913373]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
49579 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,495.808,2357156,1,0,735942,3.92495e+06,261,1.6504e+06,725,7.57225e+06,421316
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FMS-PT-00200-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620664160855

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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="FMS-PT-00200"
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 FMS-PT-00200, 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 r083-tall-162048875800781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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