About the Execution of ITS-Tools for TwoPhaseLocking-PT-nC10000vN
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6612.247 | 3600000.00 | 3836477.00 | 9092.20 | T?FTFTF?FFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r311-tall-162132108300381.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 TwoPhaseLocking-PT-nC10000vN, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108300381
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 11 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 18:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC10000vN-00
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-01
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-02
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-03
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-04
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-05
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-06
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-07
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-08
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-09
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-10
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-11
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-12
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-13
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-14
FORMULA_NAME TwoPhaseLocking-PT-nC10000vN-15
=== Now, execution of the tool begins
BK_START 1621480151020
Running Version 0
[2021-05-20 03:09:12] [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-20 03:09:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 03:09:12] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-20 03:09:12] [INFO ] Transformed 8 places.
[2021-05-20 03:09:12] [INFO ] Transformed 6 transitions.
[2021-05-20 03:09:12] [INFO ] Parsed PT model containing 8 places and 6 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-20 03:09:12] [INFO ] Initial state test concluded for 2 properties.
FORMULA TwoPhaseLocking-PT-nC10000vN-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:09:12] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-20 03:09:12] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:09:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:09:12] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:09:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:09:12] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-20 03:09:13] [INFO ] Flatten gal took : 16 ms
[2021-05-20 03:09:13] [INFO ] Flatten gal took : 3 ms
[2021-05-20 03:09:13] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 30006 steps, including 0 resets, run visited all 10 properties in 15 ms. (steps per millisecond=2000 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 9 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-20 03:09:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:09:13] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-20 03:09:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:09:13] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-20 03:09:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-20 03:09:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:09:13] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24928 reset in 220 ms.
Product exploration explored 100000 steps with 25113 reset in 130 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25058 reset in 80 ms.
Product exploration explored 100000 steps with 24987 reset in 66 ms.
[2021-05-20 03:09:13] [INFO ] Flatten gal took : 2 ms
[2021-05-20 03:09:13] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:09:13] [INFO ] Time to serialize gal into /tmp/LTL11105716497270041174.gal : 1 ms
[2021-05-20 03:09:13] [INFO ] Time to serialize properties into /tmp/LTL15894538042932400418.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/LTL11105716497270041174.gal, -t, CGAL, -LTL, /tmp/LTL15894538042932400418.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/LTL11105716497270041174.gal -t CGAL -LTL /tmp/LTL15894538042932400418.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(haveAandB>=1)")))
Formula 0 simplified : !F"(haveAandB>=1)"
Detected timeout of ITS tools.
[2021-05-20 03:09:28] [INFO ] Flatten gal took : 8 ms
[2021-05-20 03:09:28] [INFO ] Applying decomposition
[2021-05-20 03:09:28] [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/graph8141433454193355329.txt, -o, /tmp/graph8141433454193355329.bin, -w, /tmp/graph8141433454193355329.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/graph8141433454193355329.bin, -l, -1, -v, -w, /tmp/graph8141433454193355329.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:09:28] [INFO ] Decomposing Gal with order
[2021-05-20 03:09:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:09:29] [INFO ] Flatten gal took : 19 ms
[2021-05-20 03:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-20 03:09:29] [INFO ] Time to serialize gal into /tmp/LTL17966596269764117657.gal : 0 ms
[2021-05-20 03:09:29] [INFO ] Time to serialize properties into /tmp/LTL3914907062202019301.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/LTL17966596269764117657.gal, -t, CGAL, -LTL, /tmp/LTL3914907062202019301.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/LTL17966596269764117657.gal -t CGAL -LTL /tmp/LTL3914907062202019301.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("(u0.haveAandB>=1)")))
Formula 0 simplified : !F"(u0.haveAandB>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15367145777236386103
[2021-05-20 03:09:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15367145777236386103
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/ltsmin15367145777236386103]
Compilation finished in 146 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15367145777236386103]
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, <>((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin15367145777236386103]
LTSmin run took 694 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC10000vN-00 finished in 31820 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
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 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-20 03:09:44] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:09:44] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-20 03:09:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:09:44] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-20 03:09:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-20 03:09:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:09:44] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13916 reset in 192 ms.
Product exploration explored 100000 steps with 13798 reset in 208 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13868 reset in 76 ms.
Product exploration explored 100000 steps with 13954 reset in 177 ms.
[2021-05-20 03:09:45] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:09:45] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:09:45] [INFO ] Time to serialize gal into /tmp/LTL8852556775683011269.gal : 1 ms
[2021-05-20 03:09:45] [INFO ] Time to serialize properties into /tmp/LTL15184742137016010032.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/LTL8852556775683011269.gal, -t, CGAL, -LTL, /tmp/LTL15184742137016010032.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/LTL8852556775683011269.gal -t CGAL -LTL /tmp/LTL15184742137016010032.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(haveA2andB>=1)"))))
Formula 0 simplified : !GF"(haveA2andB>=1)"
Detected timeout of ITS tools.
[2021-05-20 03:10:00] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:10:00] [INFO ] Applying decomposition
[2021-05-20 03:10:00] [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/graph5630866871024092175.txt, -o, /tmp/graph5630866871024092175.bin, -w, /tmp/graph5630866871024092175.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/graph5630866871024092175.bin, -l, -1, -v, -w, /tmp/graph5630866871024092175.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:10:00] [INFO ] Decomposing Gal with order
[2021-05-20 03:10:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:10:00] [INFO ] Flatten gal took : 2 ms
[2021-05-20 03:10:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-20 03:10:00] [INFO ] Time to serialize gal into /tmp/LTL12452678958677191434.gal : 0 ms
[2021-05-20 03:10:00] [INFO ] Time to serialize properties into /tmp/LTL3346130538327813962.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/LTL12452678958677191434.gal, -t, CGAL, -LTL, /tmp/LTL3346130538327813962.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/LTL12452678958677191434.gal -t CGAL -LTL /tmp/LTL3346130538327813962.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(u1.haveA2andB>=1)"))))
Formula 0 simplified : !GF"(u1.haveA2andB>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13036224864365335163
[2021-05-20 03:10:15] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13036224864365335163
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/ltsmin13036224864365335163]
Compilation finished in 90 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13036224864365335163]
Link finished in 30 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin13036224864365335163]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC10000vN-01 finished in 45931 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:10:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:10:30] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:10:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:10:30] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:10:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:10:30] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-02 finished in 92 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:10:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:10:30] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:10:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:10:30] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-20 03:10:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:10:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:10:30] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p2:(OR (LT s0 1) (LT s1 1) (GEQ s2 1)), p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Knowledge obtained : [(NOT p1), p2, p0]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
[2021-05-20 03:10:31] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:10:31] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:10:31] [INFO ] Time to serialize gal into /tmp/LTL12462781012390984411.gal : 1 ms
[2021-05-20 03:10:31] [INFO ] Time to serialize properties into /tmp/LTL7869275772753301547.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/LTL12462781012390984411.gal, -t, CGAL, -LTL, /tmp/LTL7869275772753301547.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/LTL12462781012390984411.gal -t CGAL -LTL /tmp/LTL7869275772753301547.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((resA>=1)&&(Clients>=1))")U((G("(((resB<1)||(haveA<1))||(haveA2>=1))"))||("((resB>=1)&&(haveA>=1))"))))
Formula 0 simplified : !("((resA>=1)&&(Clients>=1))" U ("((resB>=1)&&(haveA>=1))" | G"(((resB<1)||(haveA<1))||(haveA2>=1))"))
Detected timeout of ITS tools.
[2021-05-20 03:10:46] [INFO ] Flatten gal took : 2 ms
[2021-05-20 03:10:46] [INFO ] Applying decomposition
[2021-05-20 03:10:46] [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/graph8462564956552888632.txt, -o, /tmp/graph8462564956552888632.bin, -w, /tmp/graph8462564956552888632.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/graph8462564956552888632.bin, -l, -1, -v, -w, /tmp/graph8462564956552888632.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:10:46] [INFO ] Decomposing Gal with order
[2021-05-20 03:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:10:46] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-20 03:10:46] [INFO ] Time to serialize gal into /tmp/LTL17123197266782732381.gal : 1 ms
[2021-05-20 03:10:46] [INFO ] Time to serialize properties into /tmp/LTL1143589975653300587.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/LTL17123197266782732381.gal, -t, CGAL, -LTL, /tmp/LTL1143589975653300587.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/LTL17123197266782732381.gal -t CGAL -LTL /tmp/LTL1143589975653300587.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("((u2.resA>=1)&&(u1.Clients>=1))")U((G("(((u0.resB<1)||(u1.haveA<1))||(u2.haveA2>=1))"))||("((u0.resB>=1)&&(u1.haveA>=1))"))))
Formula 0 simplified : !("((u2.resA>=1)&&(u1.Clients>=1))" U ("((u0.resB>=1)&&(u1.haveA>=1))" | G"(((u0.resB<1)||(u1.haveA<1))||(u2.haveA2>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3058609379436862481
[2021-05-20 03:11:01] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3058609379436862481
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/ltsmin3058609379436862481]
Compilation finished in 93 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3058609379436862481]
Link finished in 30 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 ([]((LTLAPp1==true))||(LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3058609379436862481]
LTSmin run took 90 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC10000vN-03 finished in 31157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:11:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:11:02] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:11:02] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-20 03:11:02] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-20 03:11:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:11:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:11:02] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1)), p1:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 239 reset in 116 ms.
Product exploration explored 100000 steps with 115 reset in 156 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 519 reset in 117 ms.
Product exploration explored 100000 steps with 20 reset in 205 ms.
[2021-05-20 03:11:02] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:11:02] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:11:02] [INFO ] Time to serialize gal into /tmp/LTL8751280384298840036.gal : 1 ms
[2021-05-20 03:11:02] [INFO ] Time to serialize properties into /tmp/LTL15943635935361390362.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/LTL8751280384298840036.gal, -t, CGAL, -LTL, /tmp/LTL15943635935361390362.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/LTL8751280384298840036.gal -t CGAL -LTL /tmp/LTL15943635935361390362.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((resB>=1)&&(haveA>=1))"))&&(F(G("((resA>=1)&&(Clients>=1))"))))))
Formula 0 simplified : !G(F"((resB>=1)&&(haveA>=1))" & FG"((resA>=1)&&(Clients>=1))")
Detected timeout of ITS tools.
[2021-05-20 03:11:18] [INFO ] Flatten gal took : 0 ms
[2021-05-20 03:11:18] [INFO ] Applying decomposition
[2021-05-20 03:11:18] [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/graph3304836917450174213.txt, -o, /tmp/graph3304836917450174213.bin, -w, /tmp/graph3304836917450174213.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/graph3304836917450174213.bin, -l, -1, -v, -w, /tmp/graph3304836917450174213.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:11:18] [INFO ] Decomposing Gal with order
[2021-05-20 03:11:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:11:18] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:11:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-20 03:11:18] [INFO ] Time to serialize gal into /tmp/LTL1147476565909232696.gal : 1 ms
[2021-05-20 03:11:18] [INFO ] Time to serialize properties into /tmp/LTL17301841111331221321.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/LTL1147476565909232696.gal, -t, CGAL, -LTL, /tmp/LTL17301841111331221321.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/LTL1147476565909232696.gal -t CGAL -LTL /tmp/LTL17301841111331221321.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("((u0.resB>=1)&&(u1.haveA>=1))"))&&(F(G("((u2.resA>=1)&&(u1.Clients>=1))"))))))
Formula 0 simplified : !G(F"((u0.resB>=1)&&(u1.haveA>=1))" & FG"((u2.resA>=1)&&(u1.Clients>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11167086479248411204
[2021-05-20 03:11:33] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11167086479248411204
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/ltsmin11167086479248411204]
Compilation finished in 93 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11167086479248411204]
Link finished in 31 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))&&<>([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11167086479248411204]
LTSmin run took 288 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC10000vN-04 finished in 31376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)||G(!p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:11:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:11:33] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:11:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:11:33] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-20 03:11:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:11:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:11:33] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p2:(GEQ s6 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 25027 reset in 81 ms.
Product exploration explored 100000 steps with 24929 reset in 92 ms.
Knowledge obtained : [(NOT p1), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25042 reset in 80 ms.
Product exploration explored 100000 steps with 25052 reset in 91 ms.
[2021-05-20 03:11:34] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:11:34] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:11:34] [INFO ] Time to serialize gal into /tmp/LTL15376156908213413481.gal : 1 ms
[2021-05-20 03:11:34] [INFO ] Time to serialize properties into /tmp/LTL8162135113165444523.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/LTL15376156908213413481.gal, -t, CGAL, -LTL, /tmp/LTL8162135113165444523.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/LTL15376156908213413481.gal -t CGAL -LTL /tmp/LTL8162135113165444523.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((G("(haveA2>=1)"))||(F("((resA>=1)&&(haveB>=1))")))||(G("(haveA2andB<1)"))))
Formula 0 simplified : !(G"(haveA2>=1)" | F"((resA>=1)&&(haveB>=1))" | G"(haveA2andB<1)")
Detected timeout of ITS tools.
[2021-05-20 03:11:49] [INFO ] Flatten gal took : 0 ms
[2021-05-20 03:11:49] [INFO ] Applying decomposition
[2021-05-20 03:11:49] [INFO ] Flatten gal took : 0 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/graph8379874761867266410.txt, -o, /tmp/graph8379874761867266410.bin, -w, /tmp/graph8379874761867266410.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/graph8379874761867266410.bin, -l, -1, -v, -w, /tmp/graph8379874761867266410.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:11:49] [INFO ] Decomposing Gal with order
[2021-05-20 03:11:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:11:49] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-20 03:11:49] [INFO ] Time to serialize gal into /tmp/LTL14856322604125723983.gal : 1 ms
[2021-05-20 03:11:49] [INFO ] Time to serialize properties into /tmp/LTL5780382317023332106.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/LTL14856322604125723983.gal, -t, CGAL, -LTL, /tmp/LTL5780382317023332106.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/LTL14856322604125723983.gal -t CGAL -LTL /tmp/LTL5780382317023332106.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((G("(i0.u1.haveA2>=1)"))||(F("((i0.u0.resA>=1)&&(u2.haveB>=1))")))||(G("(u2.haveA2andB<1)"))))
Formula 0 simplified : !(G"(i0.u1.haveA2>=1)" | F"((i0.u0.resA>=1)&&(u2.haveB>=1))" | G"(u2.haveA2andB<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11597939072348349043
[2021-05-20 03:12:04] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11597939072348349043
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/ltsmin11597939072348349043]
Compilation finished in 97 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11597939072348349043]
Link finished in 31 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))||<>((LTLAPp1==true))||[]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11597939072348349043]
LTSmin run took 1241 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC10000vN-05 finished in 32112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(!p0)) U ((X(X(!p0))&&p1)||X(X(G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:05] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:05] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:05] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, p0, p0, true]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-06 finished in 138 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||((G(p1) U X(p2))&&X(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:12:05] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:12:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ 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]]
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Applying partial POR strategy [true]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-20 03:12:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:06] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:12:06] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:06] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:06] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:12:06] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:06] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-20 03:12:06] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:12:06] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:12:06] [INFO ] Time to serialize gal into /tmp/LTL15377145885380729801.gal : 1 ms
[2021-05-20 03:12:06] [INFO ] Time to serialize properties into /tmp/LTL16690463624354034648.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/LTL15377145885380729801.gal, -t, CGAL, -LTL, /tmp/LTL16690463624354034648.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/LTL15377145885380729801.gal -t CGAL -LTL /tmp/LTL16690463624354034648.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !((G(F("(haveA2andB>=1)"))))
Formula 0 simplified : !GF"(haveA2andB>=1)"
Detected timeout of ITS tools.
[2021-05-20 03:12:21] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:12:21] [INFO ] Applying decomposition
[2021-05-20 03:12:21] [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/graph3296023828027451720.txt, -o, /tmp/graph3296023828027451720.bin, -w, /tmp/graph3296023828027451720.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/graph3296023828027451720.bin, -l, -1, -v, -w, /tmp/graph3296023828027451720.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:12:21] [INFO ] Decomposing Gal with order
[2021-05-20 03:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:12:21] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-20 03:12:21] [INFO ] Time to serialize gal into /tmp/LTL6165701061406658100.gal : 1 ms
[2021-05-20 03:12:21] [INFO ] Time to serialize properties into /tmp/LTL2616713786139369538.ltl : 4 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/LTL6165701061406658100.gal, -t, CGAL, -LTL, /tmp/LTL2616713786139369538.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/LTL6165701061406658100.gal -t CGAL -LTL /tmp/LTL2616713786139369538.ltl -c -stutter-deadlock
Read 9 LTL properties
Checking formula 0 : !((G(F("(u1.haveA2andB>=1)"))))
Formula 0 simplified : !GF"(u1.haveA2andB>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10304155006859329477
[2021-05-20 03:12:36] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10304155006859329477
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/ltsmin10304155006859329477]
Compilation finished in 96 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10304155006859329477]
Link finished in 31 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin10304155006859329477]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC10000vN-07 finished in 45998 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 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:12:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:51] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:12:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:12:51] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-20 03:12:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:12:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:12:51] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 37 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-08 finished in 145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||(F(p1)&&F(p0))) U G(!p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:12:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:51] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:12:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:51] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-20 03:12:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-20 03:12:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:51] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 45 ms :[p1, (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s5 1), p0:(GEQ s6 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 7757 reset in 71 ms.
Stack based approach found an accepted trace after 55 steps with 2 reset with depth 38 and stack size 38 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-10 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:12:52] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:52] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-20 03:12:52] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:12:52] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), true, p0]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), true, p0]
Support contains 4 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-20 03:12:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:12:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:12:52] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 159 ms.
[2021-05-20 03:12:53] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:12:53] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:12:53] [INFO ] Time to serialize gal into /tmp/LTL14724111491139739067.gal : 1 ms
[2021-05-20 03:12:53] [INFO ] Time to serialize properties into /tmp/LTL1304984359728292241.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/LTL14724111491139739067.gal, -t, CGAL, -LTL, /tmp/LTL1304984359728292241.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/LTL14724111491139739067.gal -t CGAL -LTL /tmp/LTL1304984359728292241.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((resB<1)||(haveA<1))"))U("((resA>=1)&&(Clients>=1))"))))
Formula 0 simplified : !X(G"((resB<1)||(haveA<1))" U "((resA>=1)&&(Clients>=1))")
Detected timeout of ITS tools.
[2021-05-20 03:13:08] [INFO ] Flatten gal took : 0 ms
[2021-05-20 03:13:08] [INFO ] Applying decomposition
[2021-05-20 03:13:08] [INFO ] Flatten gal took : 0 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/graph4652678506237527061.txt, -o, /tmp/graph4652678506237527061.bin, -w, /tmp/graph4652678506237527061.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/graph4652678506237527061.bin, -l, -1, -v, -w, /tmp/graph4652678506237527061.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:13:08] [INFO ] Decomposing Gal with order
[2021-05-20 03:13:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:13:08] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:13:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-20 03:13:08] [INFO ] Time to serialize gal into /tmp/LTL6420180955051029466.gal : 0 ms
[2021-05-20 03:13:08] [INFO ] Time to serialize properties into /tmp/LTL4920797813793808367.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/LTL6420180955051029466.gal, -t, CGAL, -LTL, /tmp/LTL4920797813793808367.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/LTL6420180955051029466.gal -t CGAL -LTL /tmp/LTL4920797813793808367.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("((u2.resB<1)||(u0.haveA<1))"))U("((u0.resA>=1)&&(u1.Clients>=1))"))))
Formula 0 simplified : !X(G"((u2.resB<1)||(u0.haveA<1))" U "((u0.resA>=1)&&(u1.Clients>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14232741723227994525
[2021-05-20 03:13:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14232741723227994525
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/ltsmin14232741723227994525]
Compilation finished in 92 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14232741723227994525]
Link finished in 31 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)) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14232741723227994525]
LTSmin run took 104 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC10000vN-11 finished in 31324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((X(X(G(!p1))) U (!p2&&X(X(G(!p1))))))||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:23] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:13:23] [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 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:23] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s5 1)), p2:(AND (GEQ s3 1) (GEQ s5 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-12 finished in 302 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(!p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:23] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:23] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:23] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-13 finished in 202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X((p1 U X((p0||X(G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:23] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:23] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 2}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 5}]], initial=8, aps=[p0:(GEQ s2 1), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-14 finished in 280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(X(G((F(!p2)||p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:24] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-20 03:13:24] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-20 03:13:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-20 03:13:24] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p0)), (AND p2 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) p2), (AND p2 (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-15 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=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 4}, { cond=(AND p1 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 p2), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 7}], [{ cond=(AND p0 p2), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p1 p2), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 10}], [{ cond=p2, acceptance={} source=10 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s2 1)), p1:(OR (LT s0 1) (LT s1 1)), p2:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3542 reset in 93 ms.
Stack based approach found an accepted trace after 586 steps with 20 reset with depth 74 and stack size 74 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-15 finished in 399 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9166957461650388103
[2021-05-20 03:13:24] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2021-05-20 03:13:24] [INFO ] Applying decomposition
[2021-05-20 03:13:24] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-20 03:13:24] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2021-05-20 03:13:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-20 03:13:24] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:13:24] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2021-05-20 03:13:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-20 03:13:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9166957461650388103
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/ltsmin9166957461650388103]
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/graph15778004508260138826.txt, -o, /tmp/graph15778004508260138826.bin, -w, /tmp/graph15778004508260138826.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/graph15778004508260138826.bin, -l, -1, -v, -w, /tmp/graph15778004508260138826.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:13:24] [INFO ] Decomposing Gal with order
[2021-05-20 03:13:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:13:24] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:13:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-20 03:13:24] [INFO ] Time to serialize gal into /tmp/LTLFireability6151581288345565570.gal : 0 ms
[2021-05-20 03:13:24] [INFO ] Time to serialize properties into /tmp/LTLFireability3110187445253289299.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/LTLFireability6151581288345565570.gal, -t, CGAL, -LTL, /tmp/LTLFireability3110187445253289299.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/LTLFireability6151581288345565570.gal -t CGAL -LTL /tmp/LTLFireability3110187445253289299.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G(F("(u1.haveA2andB>=1)"))))
Formula 0 simplified : !GF"(u1.haveA2andB>=1)"
Compilation finished in 117 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9166957461650388103]
Link finished in 31 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9166957461650388103]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Initializing POR dependencies: labels 9, guards 6
pins2lts-mc-linux64( 0/ 8), 0.001: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.001: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.007: buchi has 2 states
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.008: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.055: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.055: State length is 9, there are 9 groups
pins2lts-mc-linux64( 0/ 8), 0.055: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.055: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.055: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.055: Visible groups: 2 / 9, labels: 1 / 11
pins2lts-mc-linux64( 0/ 8), 0.055: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.055: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.142: [Blue] ~92 levels ~960 states ~1472 transitions
pins2lts-mc-linux64( 7/ 8), 0.172: [Blue] ~197 levels ~1920 states ~3152 transitions
pins2lts-mc-linux64( 3/ 8), 0.190: [Blue] ~382 levels ~3840 states ~6120 transitions
pins2lts-mc-linux64( 7/ 8), 0.198: [Blue] ~828 levels ~7680 states ~13272 transitions
pins2lts-mc-linux64( 7/ 8), 0.200: [Blue] ~1501 levels ~15360 states ~24200 transitions
pins2lts-mc-linux64( 7/ 8), 0.203: [Blue] ~2855 levels ~30720 states ~46400 transitions
pins2lts-mc-linux64( 6/ 8), 0.210: [Blue] ~5974 levels ~61440 states ~96128 transitions
pins2lts-mc-linux64( 6/ 8), 0.235: [Blue] ~11757 levels ~122880 states ~188688 transitions
pins2lts-mc-linux64( 6/ 8), 0.293: [Blue] ~18382 levels ~245760 states ~359000 transitions
pins2lts-mc-linux64( 5/ 8), 0.420: [Blue] ~19949 levels ~491520 states ~716240 transitions
pins2lts-mc-linux64( 5/ 8), 0.723: [Blue] ~19949 levels ~983040 states ~1484000 transitions
pins2lts-mc-linux64( 7/ 8), 1.339: [Blue] ~19634 levels ~1966080 states ~3983992 transitions
pins2lts-mc-linux64( 7/ 8), 2.640: [Blue] ~19634 levels ~3932160 states ~8482392 transitions
pins2lts-mc-linux64( 7/ 8), 5.187: [Blue] ~19634 levels ~7864320 states ~16952920 transitions
pins2lts-mc-linux64( 7/ 8), 10.714: [Blue] ~19634 levels ~15728640 states ~33608536 transitions
pins2lts-mc-linux64( 7/ 8), 22.293: [Blue] ~19634 levels ~31457280 states ~65363952 transitions
pins2lts-mc-linux64( 4/ 8), 37.653: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 37.701:
pins2lts-mc-linux64( 0/ 8), 37.701: Explored 40106278 states 81256282 transitions, fanout: 2.026
pins2lts-mc-linux64( 0/ 8), 37.701: Total exploration time 37.620 sec (37.570 sec minimum, 37.591 sec on average)
pins2lts-mc-linux64( 0/ 8), 37.701: States per second: 1066089, Transitions per second: 2159922
pins2lts-mc-linux64( 0/ 8), 37.701:
pins2lts-mc-linux64( 0/ 8), 37.701: State space has 17140850 states, 16948847 are accepting
pins2lts-mc-linux64( 0/ 8), 37.701: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 37.701: blue states: 40106278 (233.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 37.701: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 37.701: all-red states: 16948847 (98.88%), bogus 22823786 (133.15%)
pins2lts-mc-linux64( 0/ 8), 37.701:
pins2lts-mc-linux64( 0/ 8), 37.701: Total memory used for local state coloring: 2.4MB
pins2lts-mc-linux64( 0/ 8), 37.701:
pins2lts-mc-linux64( 0/ 8), 37.701: Queue width: 8B, total height: 158863, memory: 1.21MB
pins2lts-mc-linux64( 0/ 8), 37.701: Tree memory: 386.8MB, 23.7 B/state, compr.: 62.3%
pins2lts-mc-linux64( 0/ 8), 37.701: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 37.701: Stored 6 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 37.701: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 37.701: Est. total memory use: 388.0MB (~1025.2MB 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9166957461650388103]
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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9166957461650388103]
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)
Detected timeout of ITS tools.
[2021-05-20 03:34:47] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:34:47] [INFO ] Time to serialize gal into /tmp/LTLFireability10933609540630182904.gal : 1 ms
[2021-05-20 03:34:47] [INFO ] Time to serialize properties into /tmp/LTLFireability17433026856753898254.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/LTLFireability10933609540630182904.gal, -t, CGAL, -LTL, /tmp/LTLFireability17433026856753898254.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/LTLFireability10933609540630182904.gal -t CGAL -LTL /tmp/LTLFireability17433026856753898254.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((G(F("(haveA2andB>=1)"))))
Formula 0 simplified : !GF"(haveA2andB>=1)"
Detected timeout of ITS tools.
[2021-05-20 03:56:10] [INFO ] Flatten gal took : 1 ms
[2021-05-20 03:56:10] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-20 03:56:10] [INFO ] Transformed 8 places.
[2021-05-20 03:56:10] [INFO ] Transformed 6 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-20 03:56:10] [INFO ] Time to serialize gal into /tmp/LTLFireability14989769396551450866.gal : 0 ms
[2021-05-20 03:56:10] [INFO ] Time to serialize properties into /tmp/LTLFireability17617797580251847187.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/LTLFireability14989769396551450866.gal, -t, CGAL, -LTL, /tmp/LTLFireability17617797580251847187.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability14989769396551450866.gal -t CGAL -LTL /tmp/LTLFireability17617797580251847187.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(haveA2andB>=1)"))))
Formula 0 simplified : !GF"(haveA2andB>=1)"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TwoPhaseLocking-PT-nC10000vN"
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 TwoPhaseLocking-PT-nC10000vN, 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 r311-tall-162132108300381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC10000vN.tgz
mv TwoPhaseLocking-PT-nC10000vN 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 '
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 ;