About the Execution of ITS-Tools for DoubleExponent-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16246.088 | 3600000.00 | 5151551.00 | 51623.40 | ?F???????F?FFFFT | 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.r083-tall-162048875400452.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 DoubleExponent-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875400452
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.5M May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-200-00
FORMULA_NAME DoubleExponent-PT-200-01
FORMULA_NAME DoubleExponent-PT-200-02
FORMULA_NAME DoubleExponent-PT-200-03
FORMULA_NAME DoubleExponent-PT-200-04
FORMULA_NAME DoubleExponent-PT-200-05
FORMULA_NAME DoubleExponent-PT-200-06
FORMULA_NAME DoubleExponent-PT-200-07
FORMULA_NAME DoubleExponent-PT-200-08
FORMULA_NAME DoubleExponent-PT-200-09
FORMULA_NAME DoubleExponent-PT-200-10
FORMULA_NAME DoubleExponent-PT-200-11
FORMULA_NAME DoubleExponent-PT-200-12
FORMULA_NAME DoubleExponent-PT-200-13
FORMULA_NAME DoubleExponent-PT-200-14
FORMULA_NAME DoubleExponent-PT-200-15
=== Now, execution of the tool begins
BK_START 1620600567187
Running Version 0
[2021-05-09 22:49:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-09 22:49:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 22:49:29] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2021-05-09 22:49:29] [INFO ] Transformed 10604 places.
[2021-05-09 22:49:29] [INFO ] Transformed 9998 transitions.
[2021-05-09 22:49:29] [INFO ] Parsed PT model containing 10604 places and 9998 transitions in 379 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 22:49:29] [INFO ] Initial state test concluded for 3 properties.
FORMULA DoubleExponent-PT-200-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 10604 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10600 transition count 9998
Applied a total of 4 rules in 3939 ms. Remains 10600 /10604 variables (removed 4) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:49:37] [INFO ] Invariants computation overflowed in 381 ms
[2021-05-09 22:49:38] [INFO ] Implicit Places using invariants in 1459 ms returned []
Implicit Place search using SMT only with invariants took 1483 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:49:38] [INFO ] Invariants computation overflowed in 298 ms
[2021-05-09 22:49:39] [INFO ] Dead Transitions using invariants and state equation in 1102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10600/10604 places, 9998/9998 transitions.
[2021-05-09 22:49:40] [INFO ] Flatten gal took : 514 ms
[2021-05-09 22:49:40] [INFO ] Flatten gal took : 377 ms
[2021-05-09 22:49:41] [INFO ] Input system was already deterministic with 9998 transitions.
Incomplete random walk after 100000 steps, including 3332 resets, run finished after 765 ms. (steps per millisecond=130 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:49:42] [INFO ] Invariants computation overflowed in 242 ms
[2021-05-09 22:49:46] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:23
[2021-05-09 22:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:51:26] [INFO ] [Nat]Absence check using state equation in 93413 ms returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-09 22:51:26] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :22
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3662 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:51:30] [INFO ] Invariants computation overflowed in 286 ms
[2021-05-09 22:51:31] [INFO ] Implicit Places using invariants in 1083 ms returned []
Implicit Place search using SMT only with invariants took 1084 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:51:38] [INFO ] Invariants computation overflowed in 6951 ms
[2021-05-09 22:51:38] [INFO ] Dead Transitions using invariants and state equation in 7829 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-00 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:(LEQ s10404 s10149)], 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]]
Product exploration explored 100000 steps with 3319 reset in 515 ms.
Product exploration explored 100000 steps with 3254 reset in 448 ms.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.43 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3309 reset in 387 ms.
Product exploration explored 100000 steps with 3314 reset in 396 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 10600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2397 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2397 rules applied. Total rules applied 2397 place count 10600 transition count 9998
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 2397 place count 10600 transition count 10398
Deduced a syphon composed of 2798 places in 1029 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 2798 place count 10600 transition count 10398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2800 place count 10598 transition count 10396
Deduced a syphon composed of 2796 places in 983 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2802 place count 10598 transition count 10396
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: -400
Deduced a syphon composed of 4598 places in 1055 ms
Iterating global reduction 1 with 1802 rules applied. Total rules applied 4604 place count 10598 transition count 10796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4605 place count 10597 transition count 10795
Deduced a syphon composed of 4597 places in 610 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4606 place count 10597 transition count 10795
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -656
Deduced a syphon composed of 4698 places in 600 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4707 place count 10597 transition count 11451
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4808 place count 10496 transition count 11249
Deduced a syphon composed of 4597 places in 557 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4909 place count 10496 transition count 11249
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -649
Deduced a syphon composed of 4698 places in 553 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5010 place count 10496 transition count 11898
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5111 place count 10395 transition count 11696
Deduced a syphon composed of 4597 places in 533 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5212 place count 10395 transition count 11696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 4698 places in 552 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5313 place count 10395 transition count 12360
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5414 place count 10294 transition count 12158
Deduced a syphon composed of 4597 places in 536 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5515 place count 10294 transition count 12158
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -621
Deduced a syphon composed of 4694 places in 573 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5612 place count 10294 transition count 12779
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 5709 place count 10197 transition count 12585
Deduced a syphon composed of 4597 places in 545 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5806 place count 10197 transition count 12585
Deduced a syphon composed of 4597 places in 547 ms
Applied a total of 5806 rules in 24318 ms. Remains 10197 /10600 variables (removed 403) and now considering 12585/9998 (removed -2587) transitions.
// Phase 1: matrix 12585 rows 10197 cols
[2021-05-09 22:52:07] [INFO ] Invariants computation overflowed in 248 ms
[2021-05-09 22:52:08] [INFO ] Dead Transitions using invariants and state equation in 1104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10197/10600 places, 12585/9998 transitions.
Product exploration explored 100000 steps with 10864 reset in 6770 ms.
Product exploration explored 100000 steps with 10905 reset in 6687 ms.
[2021-05-09 22:52:26] [INFO ] Flatten gal took : 295 ms
[2021-05-09 22:52:26] [INFO ] Flatten gal took : 292 ms
[2021-05-09 22:52:26] [INFO ] Time to serialize gal into /tmp/LTL3499372576439870913.gal : 94 ms
[2021-05-09 22:52:26] [INFO ] Time to serialize properties into /tmp/LTL7235847595044456570.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/LTL3499372576439870913.gal, -t, CGAL, -LTL, /tmp/LTL7235847595044456570.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/LTL3499372576439870913.gal -t CGAL -LTL /tmp/LTL7235847595044456570.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("(p9822<=p9593)"))))
Formula 0 simplified : !XG"(p9822<=p9593)"
Detected timeout of ITS tools.
[2021-05-09 22:52:41] [INFO ] Flatten gal took : 279 ms
[2021-05-09 22:52:41] [INFO ] Applying decomposition
[2021-05-09 22:52:42] [INFO ] Flatten gal took : 280 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/graph14953110718269115683.txt, -o, /tmp/graph14953110718269115683.bin, -w, /tmp/graph14953110718269115683.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/graph14953110718269115683.bin, -l, -1, -v, -w, /tmp/graph14953110718269115683.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:52:42] [INFO ] Decomposing Gal with order
[2021-05-09 22:52:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:52:50] [INFO ] Removed a total of 2851 redundant transitions.
[2021-05-09 22:52:50] [INFO ] Flatten gal took : 709 ms
[2021-05-09 22:52:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 281 ms.
[2021-05-09 22:52:52] [INFO ] Time to serialize gal into /tmp/LTL17619465872291279078.gal : 90 ms
[2021-05-09 22:52:52] [INFO ] Time to serialize properties into /tmp/LTL170253368594431647.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/LTL17619465872291279078.gal, -t, CGAL, -LTL, /tmp/LTL170253368594431647.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/LTL17619465872291279078.gal -t CGAL -LTL /tmp/LTL170253368594431647.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("(gu4336.p9822<=gu4336.p9593)"))))
Formula 0 simplified : !XG"(gu4336.p9822<=gu4336.p9593)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17114118072606385457
[2021-05-09 22:53:07] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17114118072606385457
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/ltsmin17114118072606385457]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin17114118072606385457] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin17114118072606385457] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-00 finished in 102470 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((F(p0) U (F(p1)&&X(p2)))||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 10600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2399 transitions
Trivial Post-agglo rules discarded 2399 transitions
Performed 2399 trivial Post agglomeration. Transition count delta: 2399
Iterating post reduction 0 with 2399 rules applied. Total rules applied 2399 place count 10599 transition count 7598
Reduce places removed 2399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4799 place count 8200 transition count 7597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7197
Deduced a syphon composed of 400 places in 778 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5600 place count 7799 transition count 7197
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 289 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9202 place count 5998 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 267 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9404 place count 5897 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 218 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9606 place count 5796 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 211 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9808 place count 5695 transition count 5396
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 195 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 9996 place count 5601 transition count 5396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9997 place count 5600 transition count 5395
Applied a total of 9997 rules in 6634 ms. Remains 5600 /10600 variables (removed 5000) and now considering 5395/9998 (removed 4603) transitions.
// Phase 1: matrix 5395 rows 5600 cols
[2021-05-09 22:53:15] [INFO ] Invariants computation overflowed in 147 ms
[2021-05-09 22:53:19] [INFO ] Implicit Places using invariants in 3669 ms returned []
// Phase 1: matrix 5395 rows 5600 cols
[2021-05-09 22:53:19] [INFO ] Invariants computation overflowed in 98 ms
[2021-05-09 22:53:20] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 4655 ms to find 0 implicit places.
[2021-05-09 22:53:20] [INFO ] Redundant transitions in 520 ms returned []
// Phase 1: matrix 5395 rows 5600 cols
[2021-05-09 22:53:20] [INFO ] Invariants computation overflowed in 100 ms
[2021-05-09 22:53:24] [INFO ] Dead Transitions using invariants and state equation in 3360 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5600/10600 places, 5395/9998 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-200-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s3238), p2:(LEQ 1 s2854)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-01 finished in 15473 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(((p1&&X(p2))||X(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3746 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:53:28] [INFO ] Invariants computation overflowed in 231 ms
[2021-05-09 22:53:29] [INFO ] Implicit Places using invariants in 1118 ms returned []
Implicit Place search using SMT only with invariants took 1120 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:53:29] [INFO ] Invariants computation overflowed in 228 ms
[2021-05-09 22:53:30] [INFO ] Dead Transitions using invariants and state equation in 1087 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s7202), p1:(GT 3 s6160), p3:(GT s5305 s7112), p2:(GT 1 s7772)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3304 reset in 517 ms.
Product exploration explored 100000 steps with 3304 reset in 521 ms.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Knowledge obtained : [(NOT p0), p1, (NOT p3), p2]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0)]
Product exploration explored 100000 steps with 3267 reset in 453 ms.
Product exploration explored 100000 steps with 3318 reset in 492 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0)]
Support contains 5 out of 10600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2395 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2395 rules applied. Total rules applied 2395 place count 10600 transition count 9998
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 402 Pre rules applied. Total rules applied 2395 place count 10600 transition count 10397
Deduced a syphon composed of 2797 places in 1036 ms
Iterating global reduction 1 with 402 rules applied. Total rules applied 2797 place count 10600 transition count 10397
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2799 place count 10598 transition count 10395
Deduced a syphon composed of 2795 places in 882 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2801 place count 10598 transition count 10395
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: -400
Deduced a syphon composed of 4594 places in 654 ms
Iterating global reduction 1 with 1799 rules applied. Total rules applied 4600 place count 10598 transition count 10795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4601 place count 10597 transition count 10794
Deduced a syphon composed of 4593 places in 581 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4602 place count 10597 transition count 10794
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -656
Deduced a syphon composed of 4694 places in 567 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4703 place count 10597 transition count 11450
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4804 place count 10496 transition count 11248
Deduced a syphon composed of 4593 places in 557 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4905 place count 10496 transition count 11248
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -649
Deduced a syphon composed of 4694 places in 555 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5006 place count 10496 transition count 11897
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5107 place count 10395 transition count 11695
Deduced a syphon composed of 4593 places in 536 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5208 place count 10395 transition count 11695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -658
Deduced a syphon composed of 4694 places in 554 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5309 place count 10395 transition count 12353
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5410 place count 10294 transition count 12151
Deduced a syphon composed of 4593 places in 528 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5511 place count 10294 transition count 12151
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -619
Deduced a syphon composed of 4689 places in 573 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 5607 place count 10294 transition count 12770
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 5703 place count 10198 transition count 12578
Deduced a syphon composed of 4593 places in 553 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 5799 place count 10198 transition count 12578
Deduced a syphon composed of 4593 places in 549 ms
Applied a total of 5799 rules in 23016 ms. Remains 10198 /10600 variables (removed 402) and now considering 12578/9998 (removed -2580) transitions.
// Phase 1: matrix 12578 rows 10198 cols
[2021-05-09 22:53:57] [INFO ] Invariants computation overflowed in 209 ms
[2021-05-09 22:53:58] [INFO ] Dead Transitions using invariants and state equation in 1061 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10198/10600 places, 12578/9998 transitions.
Product exploration explored 100000 steps with 3327 reset in 446 ms.
Product exploration explored 100000 steps with 3292 reset in 454 ms.
[2021-05-09 22:54:03] [INFO ] Flatten gal took : 301 ms
[2021-05-09 22:54:03] [INFO ] Flatten gal took : 283 ms
[2021-05-09 22:54:03] [INFO ] Time to serialize gal into /tmp/LTL179392935977201578.gal : 23 ms
[2021-05-09 22:54:03] [INFO ] Time to serialize properties into /tmp/LTL11771521589014387903.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/LTL179392935977201578.gal, -t, CGAL, -LTL, /tmp/LTL11771521589014387903.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/LTL179392935977201578.gal -t CGAL -LTL /tmp/LTL11771521589014387903.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p6940>=1)"))||(G((("(p6001<3)")&&(X("(p7453<1)")))||(X("(p5232>p686)"))))))
Formula 0 simplified : !(F"(p6940>=1)" | G(("(p6001<3)" & X"(p7453<1)") | X"(p5232>p686)"))
Detected timeout of ITS tools.
[2021-05-09 22:54:18] [INFO ] Flatten gal took : 310 ms
[2021-05-09 22:54:18] [INFO ] Applying decomposition
[2021-05-09 22:54:19] [INFO ] Flatten gal took : 274 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/graph4325972636199405732.txt, -o, /tmp/graph4325972636199405732.bin, -w, /tmp/graph4325972636199405732.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/graph4325972636199405732.bin, -l, -1, -v, -w, /tmp/graph4325972636199405732.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:54:19] [INFO ] Decomposing Gal with order
[2021-05-09 22:54:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:54:27] [INFO ] Removed a total of 2856 redundant transitions.
[2021-05-09 22:54:27] [INFO ] Flatten gal took : 546 ms
[2021-05-09 22:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 219 ms.
[2021-05-09 22:54:29] [INFO ] Time to serialize gal into /tmp/LTL9906085835801520268.gal : 146 ms
[2021-05-09 22:54:29] [INFO ] Time to serialize properties into /tmp/LTL14853456466599530011.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/LTL9906085835801520268.gal, -t, CGAL, -LTL, /tmp/LTL14853456466599530011.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/LTL9906085835801520268.gal -t CGAL -LTL /tmp/LTL14853456466599530011.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(gi5.gi1.gi1.gi1.gi3.gi3.gu3079.p6940>=1)"))||(G((("(gi5.gi0.gi1.gi2.gi3.gi0.gu2634.p6001<3)")&&(X("(gi7.gu3327.p7453<1)")))||(X("(gu3043.p5232>gu3043.p686)"))))))
Formula 0 simplified : !(F"(gi5.gi1.gi1.gi1.gi3.gi3.gu3079.p6940>=1)" | G(("(gi5.gi0.gi1.gi2.gi3.gi0.gu2634.p6001<3)" & X"(gi7.gu3327.p7453<1)") | X"(gu3043.p5232>gu3043.p686)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2863411144729915009
[2021-05-09 22:54:44] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2863411144729915009
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/ltsmin2863411144729915009]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2863411144729915009] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2863411144729915009] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-02 finished in 81415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10599 transition count 7599
Reduce places removed 2398 places and 0 transitions.
Iterating post reduction 1 with 2398 rules applied. Total rules applied 4796 place count 8201 transition count 7599
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 4796 place count 8201 transition count 7199
Deduced a syphon composed of 400 places in 892 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 5596 place count 7801 transition count 7199
Performed 1803 Post agglomeration using F-continuation condition.Transition count delta: 1803
Deduced a syphon composed of 1803 places in 373 ms
Reduce places removed 1803 places and 0 transitions.
Iterating global reduction 2 with 3606 rules applied. Total rules applied 9202 place count 5998 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 230 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9404 place count 5897 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 300 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9606 place count 5796 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 206 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9808 place count 5695 transition count 5396
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 287 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 9998 place count 5600 transition count 5396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9999 place count 5599 transition count 5395
Applied a total of 9999 rules in 6579 ms. Remains 5599 /10600 variables (removed 5001) and now considering 5395/9998 (removed 4603) transitions.
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 22:54:52] [INFO ] Invariants computation overflowed in 124 ms
[2021-05-09 22:54:56] [INFO ] Implicit Places using invariants in 3671 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 22:54:56] [INFO ] Invariants computation overflowed in 114 ms
[2021-05-09 22:54:57] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 4786 ms to find 0 implicit places.
[2021-05-09 22:54:57] [INFO ] Redundant transitions in 380 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 22:54:57] [INFO ] Invariants computation overflowed in 115 ms
[2021-05-09 22:55:00] [INFO ] Dead Transitions using invariants and state equation in 3385 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5599/10600 places, 5395/9998 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-03 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:(LEQ s585 s3837)], 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 13908 reset in 369 ms.
Product exploration explored 100000 steps with 13856 reset in 362 ms.
Graph (complete) has 17777 edges and 5599 vertex of which 5597 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13894 reset in 352 ms.
Product exploration explored 100000 steps with 13851 reset in 280 ms.
[2021-05-09 22:55:03] [INFO ] Flatten gal took : 226 ms
[2021-05-09 22:55:03] [INFO ] Flatten gal took : 205 ms
[2021-05-09 22:55:03] [INFO ] Time to serialize gal into /tmp/LTL9671073733145690172.gal : 17 ms
[2021-05-09 22:55:03] [INFO ] Time to serialize properties into /tmp/LTL15901795954501647155.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/LTL9671073733145690172.gal, -t, CGAL, -LTL, /tmp/LTL15901795954501647155.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/LTL9671073733145690172.gal -t CGAL -LTL /tmp/LTL15901795954501647155.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1448<=p6990)"))))
Formula 0 simplified : !GF"(p1448<=p6990)"
Detected timeout of ITS tools.
[2021-05-09 22:55:18] [INFO ] Flatten gal took : 187 ms
[2021-05-09 22:55:18] [INFO ] Applying decomposition
[2021-05-09 22:55:19] [INFO ] Flatten gal took : 190 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/graph13133965916826770858.txt, -o, /tmp/graph13133965916826770858.bin, -w, /tmp/graph13133965916826770858.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/graph13133965916826770858.bin, -l, -1, -v, -w, /tmp/graph13133965916826770858.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:55:19] [INFO ] Decomposing Gal with order
[2021-05-09 22:55:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:55:21] [INFO ] Removed a total of 4235 redundant transitions.
[2021-05-09 22:55:21] [INFO ] Flatten gal took : 345 ms
[2021-05-09 22:55:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 100 ms.
[2021-05-09 22:55:21] [INFO ] Time to serialize gal into /tmp/LTL4843191641392235793.gal : 32 ms
[2021-05-09 22:55:21] [INFO ] Time to serialize properties into /tmp/LTL10043182773997849585.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/LTL4843191641392235793.gal, -t, CGAL, -LTL, /tmp/LTL10043182773997849585.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/LTL4843191641392235793.gal -t CGAL -LTL /tmp/LTL10043182773997849585.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu203.p1448<=gu203.p6990)"))))
Formula 0 simplified : !GF"(gu203.p1448<=gu203.p6990)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17494683869237943819
[2021-05-09 22:55:36] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17494683869237943819
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/ltsmin17494683869237943819]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin17494683869237943819] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin17494683869237943819] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-03 finished in 52142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(p0)||X(p1)))||(G(!p1) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3873 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:55:42] [INFO ] Invariants computation overflowed in 229 ms
[2021-05-09 22:55:42] [INFO ] Implicit Places using invariants in 885 ms returned []
Implicit Place search using SMT only with invariants took 885 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 22:55:42] [INFO ] Invariants computation overflowed in 233 ms
[2021-05-09 22:55:43] [INFO ] Dead Transitions using invariants and state equation in 887 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), (NOT p0), true, (OR (NOT p2) p1), p1]
Running random walk in product with property : DoubleExponent-PT-200-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=p0, acceptance={} source=7 dest: 7}, { cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p1, acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={0} source=9 dest: 10}], [{ cond=p1, acceptance={} source=10 dest: 8}, { cond=(NOT p1), acceptance={} source=10 dest: 10}]], initial=1, aps=[p0:(LEQ s1676 s7048), p1:(LEQ 1 s9566), p2:(GT s81 s4331)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], 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 3296 reset in 547 ms.
Product exploration explored 100000 steps with 3338 reset in 522 ms.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 431 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), (NOT p0), true, (OR (NOT p2) p1), p1]
Product exploration explored 100000 steps with 3289 reset in 605 ms.
Product exploration explored 100000 steps with 3303 reset in 516 ms.
Applying partial POR strategy [true, false, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), (NOT p0), true, (OR (NOT p2) p1), p1]
Support contains 5 out of 10600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2392 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2392 rules applied. Total rules applied 2392 place count 10600 transition count 9998
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 2392 place count 10600 transition count 10398
Deduced a syphon composed of 2793 places in 1137 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 2793 place count 10600 transition count 10398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2795 place count 10598 transition count 10396
Deduced a syphon composed of 2791 places in 909 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2797 place count 10598 transition count 10396
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: -400
Deduced a syphon composed of 4593 places in 742 ms
Iterating global reduction 1 with 1802 rules applied. Total rules applied 4599 place count 10598 transition count 10796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4600 place count 10597 transition count 10795
Deduced a syphon composed of 4592 places in 713 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4601 place count 10597 transition count 10795
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -655
Deduced a syphon composed of 4693 places in 706 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4702 place count 10597 transition count 11450
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4803 place count 10496 transition count 11248
Deduced a syphon composed of 4592 places in 580 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4904 place count 10496 transition count 11248
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -649
Deduced a syphon composed of 4693 places in 553 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5005 place count 10496 transition count 11897
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5106 place count 10395 transition count 11695
Deduced a syphon composed of 4592 places in 535 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5207 place count 10395 transition count 11695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -663
Deduced a syphon composed of 4693 places in 582 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5308 place count 10395 transition count 12358
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5409 place count 10294 transition count 12156
Deduced a syphon composed of 4592 places in 530 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5510 place count 10294 transition count 12156
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -622
Deduced a syphon composed of 4689 places in 599 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5607 place count 10294 transition count 12778
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 5704 place count 10197 transition count 12584
Deduced a syphon composed of 4592 places in 539 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5801 place count 10197 transition count 12584
Deduced a syphon composed of 4592 places in 533 ms
Applied a total of 5801 rules in 24758 ms. Remains 10197 /10600 variables (removed 403) and now considering 12584/9998 (removed -2586) transitions.
// Phase 1: matrix 12584 rows 10197 cols
[2021-05-09 22:56:13] [INFO ] Invariants computation overflowed in 231 ms
[2021-05-09 22:56:14] [INFO ] Dead Transitions using invariants and state equation in 864 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10197/10600 places, 12584/9998 transitions.
Product exploration explored 100000 steps with 10917 reset in 7370 ms.
Product exploration explored 100000 steps with 10839 reset in 7314 ms.
[2021-05-09 22:56:32] [INFO ] Flatten gal took : 280 ms
[2021-05-09 22:56:32] [INFO ] Flatten gal took : 284 ms
[2021-05-09 22:56:32] [INFO ] Time to serialize gal into /tmp/LTL7196123551872241682.gal : 22 ms
[2021-05-09 22:56:32] [INFO ] Time to serialize properties into /tmp/LTL10519726003192831086.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/LTL7196123551872241682.gal, -t, CGAL, -LTL, /tmp/LTL10519726003192831086.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/LTL7196123551872241682.gal -t CGAL -LTL /tmp/LTL10519726003192831086.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G((G("(p1967<=p6801)"))||(X("(p9068>=1)"))))||((G("(p9068<1)"))U("(p10070>p4356)"))))
Formula 0 simplified : !(G(G"(p1967<=p6801)" | X"(p9068>=1)") | (G"(p9068<1)" U "(p10070>p4356)"))
Detected timeout of ITS tools.
[2021-05-09 22:56:48] [INFO ] Flatten gal took : 284 ms
[2021-05-09 22:56:48] [INFO ] Applying decomposition
[2021-05-09 22:56:48] [INFO ] Flatten gal took : 292 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/graph8389507690824545100.txt, -o, /tmp/graph8389507690824545100.bin, -w, /tmp/graph8389507690824545100.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/graph8389507690824545100.bin, -l, -1, -v, -w, /tmp/graph8389507690824545100.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:56:49] [INFO ] Decomposing Gal with order
[2021-05-09 22:56:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:56:56] [INFO ] Removed a total of 2856 redundant transitions.
[2021-05-09 22:56:56] [INFO ] Flatten gal took : 502 ms
[2021-05-09 22:56:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 114 ms.
[2021-05-09 22:56:58] [INFO ] Time to serialize gal into /tmp/LTL8525224410271862663.gal : 49 ms
[2021-05-09 22:56:58] [INFO ] Time to serialize properties into /tmp/LTL14811744181843986588.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/LTL8525224410271862663.gal, -t, CGAL, -LTL, /tmp/LTL14811744181843986588.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/LTL8525224410271862663.gal -t CGAL -LTL /tmp/LTL14811744181843986588.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G((G("(gu714.p1967<=gu714.p6801)"))||(X("(gi1.gu4070.p9068>=1)"))))||((G("(gi1.gu4070.p9068<1)"))U("(gu34.p10070>gu34.p4356)"))))
Formula 0 simplified : !(G(G"(gu714.p1967<=gu714.p6801)" | X"(gi1.gu4070.p9068>=1)") | (G"(gi1.gu4070.p9068<1)" U "(gu34.p10070>gu34.p4356)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12890325744065553839
[2021-05-09 22:57:13] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12890325744065553839
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/ltsmin12890325744065553839]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin12890325744065553839] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin12890325744065553839] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-04 finished in 96339 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0||G(p1)))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2396 transitions
Trivial Post-agglo rules discarded 2396 transitions
Performed 2396 trivial Post agglomeration. Transition count delta: 2396
Iterating post reduction 0 with 2396 rules applied. Total rules applied 2396 place count 10599 transition count 7601
Reduce places removed 2396 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2398 rules applied. Total rules applied 4794 place count 8203 transition count 7599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4796 place count 8201 transition count 7599
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 4796 place count 8201 transition count 7200
Deduced a syphon composed of 399 places in 783 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1800 Post agglomeration using F-continuation condition.Transition count delta: 1800
Deduced a syphon composed of 1800 places in 296 ms
Reduce places removed 1800 places and 0 transitions.
Iterating global reduction 3 with 3600 rules applied. Total rules applied 9194 place count 6002 transition count 5400
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 276 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9396 place count 5901 transition count 5400
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 258 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9598 place count 5800 transition count 5400
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 404 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9800 place count 5699 transition count 5400
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 201 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 9988 place count 5605 transition count 5400
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9989 place count 5605 transition count 5400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9990 place count 5604 transition count 5399
Applied a total of 9990 rules in 7689 ms. Remains 5604 /10600 variables (removed 4996) and now considering 5399/9998 (removed 4599) transitions.
// Phase 1: matrix 5399 rows 5604 cols
[2021-05-09 22:57:22] [INFO ] Invariants computation overflowed in 105 ms
[2021-05-09 22:57:25] [INFO ] Implicit Places using invariants in 3419 ms returned []
// Phase 1: matrix 5399 rows 5604 cols
[2021-05-09 22:57:25] [INFO ] Invariants computation overflowed in 150 ms
[2021-05-09 22:57:26] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 4345 ms to find 0 implicit places.
[2021-05-09 22:57:26] [INFO ] Redundant transitions in 381 ms returned []
// Phase 1: matrix 5399 rows 5604 cols
[2021-05-09 22:57:26] [INFO ] Invariants computation overflowed in 109 ms
[2021-05-09 22:57:29] [INFO ] Dead Transitions using invariants and state equation in 3312 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5604/10600 places, 5399/9998 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-200-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s506 s4598), p2:(LEQ s4152 s53), p1:(LEQ s3620 s3460)], 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 13933 reset in 273 ms.
Product exploration explored 100000 steps with 13838 reset in 284 ms.
Graph (complete) has 17771 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13940 reset in 404 ms.
Product exploration explored 100000 steps with 13754 reset in 289 ms.
[2021-05-09 22:57:32] [INFO ] Flatten gal took : 186 ms
[2021-05-09 22:57:32] [INFO ] Flatten gal took : 238 ms
[2021-05-09 22:57:32] [INFO ] Time to serialize gal into /tmp/LTL4978414460613825605.gal : 61 ms
[2021-05-09 22:57:32] [INFO ] Time to serialize properties into /tmp/LTL8630765310747626748.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/LTL4978414460613825605.gal, -t, CGAL, -LTL, /tmp/LTL8630765310747626748.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/LTL4978414460613825605.gal -t CGAL -LTL /tmp/LTL8630765310747626748.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F(("(p1312<=p8289)")||(G("(p6620<=p6349)"))))||(G("(p7524<=p10081)")))))
Formula 0 simplified : !G(F("(p1312<=p8289)" | G"(p6620<=p6349)") | G"(p7524<=p10081)")
Detected timeout of ITS tools.
[2021-05-09 22:57:48] [INFO ] Flatten gal took : 181 ms
[2021-05-09 22:57:48] [INFO ] Applying decomposition
[2021-05-09 22:57:48] [INFO ] Flatten gal took : 187 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/graph11645717655800941917.txt, -o, /tmp/graph11645717655800941917.bin, -w, /tmp/graph11645717655800941917.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/graph11645717655800941917.bin, -l, -1, -v, -w, /tmp/graph11645717655800941917.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:57:48] [INFO ] Decomposing Gal with order
[2021-05-09 22:57:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:57:50] [INFO ] Removed a total of 4713 redundant transitions.
[2021-05-09 22:57:50] [INFO ] Flatten gal took : 342 ms
[2021-05-09 22:57:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 173 ms.
[2021-05-09 22:57:51] [INFO ] Time to serialize gal into /tmp/LTL11405488547114172968.gal : 123 ms
[2021-05-09 22:57:51] [INFO ] Time to serialize properties into /tmp/LTL1027979115103257162.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/LTL11405488547114172968.gal, -t, CGAL, -LTL, /tmp/LTL1027979115103257162.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/LTL11405488547114172968.gal -t CGAL -LTL /tmp/LTL1027979115103257162.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F(("(gu1891.p1312<=gu1891.p8289)")||(G("(gu1424.p6620<=gu1424.p6349)"))))||(G("(gu1707.p7524<=gu1707.p10081)")))))
Formula 0 simplified : !G(F("(gu1891.p1312<=gu1891.p8289)" | G"(gu1424.p6620<=gu1424.p6349)") | G"(gu1707.p7524<=gu1707.p10081)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11048790270422007200
[2021-05-09 22:58:06] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11048790270422007200
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/ltsmin11048790270422007200]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin11048790270422007200] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin11048790270422007200] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-05 finished in 53676 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 10599 transition count 7597
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7198
Deduced a syphon composed of 399 places in 777 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1803 Post agglomeration using F-continuation condition.Transition count delta: 1803
Deduced a syphon composed of 1803 places in 326 ms
Reduce places removed 1803 places and 0 transitions.
Iterating global reduction 2 with 3606 rules applied. Total rules applied 9204 place count 5997 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 392 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9406 place count 5896 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 217 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9608 place count 5795 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 212 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9810 place count 5694 transition count 5395
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 210 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 9998 place count 5600 transition count 5395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9999 place count 5599 transition count 5394
Applied a total of 9999 rules in 6640 ms. Remains 5599 /10600 variables (removed 5001) and now considering 5394/9998 (removed 4604) transitions.
// Phase 1: matrix 5394 rows 5599 cols
[2021-05-09 22:58:14] [INFO ] Invariants computation overflowed in 130 ms
[2021-05-09 22:58:17] [INFO ] Implicit Places using invariants in 3428 ms returned []
// Phase 1: matrix 5394 rows 5599 cols
[2021-05-09 22:58:18] [INFO ] Invariants computation overflowed in 130 ms
[2021-05-09 22:58:18] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 4347 ms to find 0 implicit places.
[2021-05-09 22:58:19] [INFO ] Redundant transitions in 252 ms returned []
// Phase 1: matrix 5394 rows 5599 cols
[2021-05-09 22:58:19] [INFO ] Invariants computation overflowed in 130 ms
[2021-05-09 22:58:22] [INFO ] Dead Transitions using invariants and state equation in 3004 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5599/10600 places, 5394/9998 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s4472 s2653)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13875 reset in 273 ms.
Product exploration explored 100000 steps with 13883 reset in 426 ms.
Graph (complete) has 17774 edges and 5599 vertex of which 5597 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13903 reset in 273 ms.
Product exploration explored 100000 steps with 13743 reset in 286 ms.
[2021-05-09 22:58:24] [INFO ] Flatten gal took : 204 ms
[2021-05-09 22:58:24] [INFO ] Flatten gal took : 190 ms
[2021-05-09 22:58:24] [INFO ] Time to serialize gal into /tmp/LTL723373467026775658.gal : 16 ms
[2021-05-09 22:58:24] [INFO ] Time to serialize properties into /tmp/LTL13188198804727978000.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/LTL723373467026775658.gal, -t, CGAL, -LTL, /tmp/LTL13188198804727978000.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/LTL723373467026775658.gal -t CGAL -LTL /tmp/LTL13188198804727978000.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(p8077<=p4983)")))
Formula 0 simplified : !G"(p8077<=p4983)"
Detected timeout of ITS tools.
[2021-05-09 22:58:40] [INFO ] Flatten gal took : 185 ms
[2021-05-09 22:58:40] [INFO ] Applying decomposition
[2021-05-09 22:58:40] [INFO ] Flatten gal took : 191 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/graph2134022876764308049.txt, -o, /tmp/graph2134022876764308049.bin, -w, /tmp/graph2134022876764308049.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/graph2134022876764308049.bin, -l, -1, -v, -w, /tmp/graph2134022876764308049.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:58:40] [INFO ] Decomposing Gal with order
[2021-05-09 22:58:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:58:42] [INFO ] Removed a total of 4449 redundant transitions.
[2021-05-09 22:58:42] [INFO ] Flatten gal took : 341 ms
[2021-05-09 22:58:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 158 ms.
[2021-05-09 22:58:43] [INFO ] Time to serialize gal into /tmp/LTL12546826730476747397.gal : 55 ms
[2021-05-09 22:58:43] [INFO ] Time to serialize properties into /tmp/LTL13703930912631186844.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/LTL12546826730476747397.gal, -t, CGAL, -LTL, /tmp/LTL13703930912631186844.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/LTL12546826730476747397.gal -t CGAL -LTL /tmp/LTL13703930912631186844.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(gu1033.p8077<=gu1033.p4983)")))
Formula 0 simplified : !G"(gu1033.p8077<=gu1033.p4983)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12266813501194905270
[2021-05-09 22:58:58] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12266813501194905270
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/ltsmin12266813501194905270]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin12266813501194905270] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin12266813501194905270] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-06 finished in 51388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2399 transitions
Trivial Post-agglo rules discarded 2399 transitions
Performed 2399 trivial Post agglomeration. Transition count delta: 2399
Iterating post reduction 0 with 2399 rules applied. Total rules applied 2399 place count 10599 transition count 7598
Reduce places removed 2399 places and 0 transitions.
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4798 place count 8200 transition count 7598
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 4798 place count 8200 transition count 7198
Deduced a syphon composed of 400 places in 1098 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 478 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 2 with 3604 rules applied. Total rules applied 9202 place count 5998 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 363 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9404 place count 5897 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 365 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9606 place count 5796 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 351 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9808 place count 5695 transition count 5396
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 370 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 9998 place count 5600 transition count 5396
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9999 place count 5600 transition count 5396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10000 place count 5599 transition count 5395
Applied a total of 10000 rules in 9972 ms. Remains 5599 /10600 variables (removed 5001) and now considering 5395/9998 (removed 4603) transitions.
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 22:59:09] [INFO ] Invariants computation overflowed in 161 ms
[2021-05-09 22:59:09] [INFO ] Implicit Places using invariants in 641 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 22:59:10] [INFO ] Invariants computation overflowed in 196 ms
[2021-05-09 22:59:11] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
[2021-05-09 22:59:11] [INFO ] Redundant transitions in 400 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 22:59:12] [INFO ] Invariants computation overflowed in 196 ms
[2021-05-09 22:59:12] [INFO ] Dead Transitions using invariants and state equation in 861 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5599/10600 places, 5395/9998 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3297 s614)], 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 13916 reset in 762 ms.
Product exploration explored 100000 steps with 13862 reset in 631 ms.
Graph (complete) has 17777 edges and 5599 vertex of which 5597 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13918 reset in 552 ms.
Product exploration explored 100000 steps with 13813 reset in 499 ms.
[2021-05-09 22:59:16] [INFO ] Flatten gal took : 280 ms
[2021-05-09 22:59:17] [INFO ] Flatten gal took : 348 ms
[2021-05-09 22:59:17] [INFO ] Time to serialize gal into /tmp/LTL16835725216098203326.gal : 41 ms
[2021-05-09 22:59:17] [INFO ] Time to serialize properties into /tmp/LTL14840797213454234228.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/LTL16835725216098203326.gal, -t, CGAL, -LTL, /tmp/LTL14840797213454234228.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/LTL16835725216098203326.gal -t CGAL -LTL /tmp/LTL14840797213454234228.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p6072<=p1493)"))))
Formula 0 simplified : !FG"(p6072<=p1493)"
Detected timeout of ITS tools.
[2021-05-09 22:59:32] [INFO ] Flatten gal took : 187 ms
[2021-05-09 22:59:32] [INFO ] Applying decomposition
[2021-05-09 22:59:32] [INFO ] Flatten gal took : 191 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/graph9937980493957553657.txt, -o, /tmp/graph9937980493957553657.bin, -w, /tmp/graph9937980493957553657.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/graph9937980493957553657.bin, -l, -1, -v, -w, /tmp/graph9937980493957553657.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:59:33] [INFO ] Decomposing Gal with order
[2021-05-09 22:59:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:59:34] [INFO ] Removed a total of 4451 redundant transitions.
[2021-05-09 22:59:34] [INFO ] Flatten gal took : 340 ms
[2021-05-09 22:59:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 128 ms.
[2021-05-09 22:59:35] [INFO ] Time to serialize gal into /tmp/LTL11830734368840064851.gal : 31 ms
[2021-05-09 22:59:35] [INFO ] Time to serialize properties into /tmp/LTL2017100547208554471.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/LTL11830734368840064851.gal, -t, CGAL, -LTL, /tmp/LTL2017100547208554471.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/LTL11830734368840064851.gal -t CGAL -LTL /tmp/LTL2017100547208554471.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu1293.p6072<=gu1293.p1493)"))))
Formula 0 simplified : !FG"(gu1293.p6072<=gu1293.p1493)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11923423560950759080
[2021-05-09 22:59:50] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11923423560950759080
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/ltsmin11923423560950759080]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin11923423560950759080] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin11923423560950759080] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-07 finished in 52331 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2396 transitions
Trivial Post-agglo rules discarded 2396 transitions
Performed 2396 trivial Post agglomeration. Transition count delta: 2396
Iterating post reduction 0 with 2396 rules applied. Total rules applied 2396 place count 10599 transition count 7601
Reduce places removed 2396 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4793 place count 8203 transition count 7600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4794 place count 8202 transition count 7600
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4794 place count 8202 transition count 7200
Deduced a syphon composed of 400 places in 882 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1803 Post agglomeration using F-continuation condition.Transition count delta: 1803
Deduced a syphon composed of 1803 places in 423 ms
Reduce places removed 1803 places and 0 transitions.
Iterating global reduction 3 with 3606 rules applied. Total rules applied 9200 place count 5999 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 233 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9402 place count 5898 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 544 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9604 place count 5797 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 215 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9806 place count 5696 transition count 5397
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 214 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9996 place count 5601 transition count 5397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9997 place count 5600 transition count 5396
Applied a total of 9997 rules in 6855 ms. Remains 5600 /10600 variables (removed 5000) and now considering 5396/9998 (removed 4602) transitions.
// Phase 1: matrix 5396 rows 5600 cols
[2021-05-09 22:59:58] [INFO ] Invariants computation overflowed in 117 ms
[2021-05-09 23:00:01] [INFO ] Implicit Places using invariants in 3396 ms returned []
// Phase 1: matrix 5396 rows 5600 cols
[2021-05-09 23:00:02] [INFO ] Invariants computation overflowed in 115 ms
[2021-05-09 23:00:02] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 4286 ms to find 0 implicit places.
[2021-05-09 23:00:03] [INFO ] Redundant transitions in 277 ms returned []
// Phase 1: matrix 5396 rows 5600 cols
[2021-05-09 23:00:03] [INFO ] Invariants computation overflowed in 116 ms
[2021-05-09 23:00:06] [INFO ] Dead Transitions using invariants and state equation in 3029 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5600/10600 places, 5396/9998 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GT 3 s3879) (LEQ s4019 s524))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13872 reset in 309 ms.
Product exploration explored 100000 steps with 13959 reset in 325 ms.
Graph (complete) has 17778 edges and 5600 vertex of which 5598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13922 reset in 282 ms.
Product exploration explored 100000 steps with 13879 reset in 327 ms.
[2021-05-09 23:00:08] [INFO ] Flatten gal took : 183 ms
[2021-05-09 23:00:08] [INFO ] Flatten gal took : 189 ms
[2021-05-09 23:00:08] [INFO ] Time to serialize gal into /tmp/LTL10274926620104573085.gal : 17 ms
[2021-05-09 23:00:08] [INFO ] Time to serialize properties into /tmp/LTL9617574674402565077.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/LTL10274926620104573085.gal, -t, CGAL, -LTL, /tmp/LTL9617574674402565077.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/LTL10274926620104573085.gal -t CGAL -LTL /tmp/LTL9617574674402565077.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((p7066<3)&&(p7307<=p1344))")))
Formula 0 simplified : !G"((p7066<3)&&(p7307<=p1344))"
Detected timeout of ITS tools.
[2021-05-09 23:00:23] [INFO ] Flatten gal took : 183 ms
[2021-05-09 23:00:23] [INFO ] Applying decomposition
[2021-05-09 23:00:24] [INFO ] Flatten gal took : 188 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/graph6614741396382937821.txt, -o, /tmp/graph6614741396382937821.bin, -w, /tmp/graph6614741396382937821.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/graph6614741396382937821.bin, -l, -1, -v, -w, /tmp/graph6614741396382937821.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 23:00:24] [INFO ] Decomposing Gal with order
[2021-05-09 23:00:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 23:00:25] [INFO ] Removed a total of 4393 redundant transitions.
[2021-05-09 23:00:26] [INFO ] Flatten gal took : 333 ms
[2021-05-09 23:00:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 38 ms.
[2021-05-09 23:00:26] [INFO ] Time to serialize gal into /tmp/LTL15790948970017562363.gal : 29 ms
[2021-05-09 23:00:26] [INFO ] Time to serialize properties into /tmp/LTL875500889877403661.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/LTL15790948970017562363.gal, -t, CGAL, -LTL, /tmp/LTL875500889877403661.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/LTL15790948970017562363.gal -t CGAL -LTL /tmp/LTL875500889877403661.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((gi4.gu1490.p7066<3)&&(gu1547.p7307<=gu1547.p1344))")))
Formula 0 simplified : !G"((gi4.gu1490.p7066<3)&&(gu1547.p7307<=gu1547.p1344))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3061854541654278906
[2021-05-09 23:00:41] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3061854541654278906
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/ltsmin3061854541654278906]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin3061854541654278906] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin3061854541654278906] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-08 finished in 51054 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10599 transition count 7599
Reduce places removed 2398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4797 place count 8201 transition count 7598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4798 place count 8200 transition count 7598
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4798 place count 8200 transition count 7197
Deduced a syphon composed of 401 places in 773 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5600 place count 7799 transition count 7197
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 293 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9202 place count 5998 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 275 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9404 place count 5897 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 216 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9606 place count 5796 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 209 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9808 place count 5695 transition count 5396
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 212 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9998 place count 5600 transition count 5396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9999 place count 5599 transition count 5395
Applied a total of 9999 rules in 6627 ms. Remains 5599 /10600 variables (removed 5001) and now considering 5395/9998 (removed 4603) transitions.
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 23:00:49] [INFO ] Invariants computation overflowed in 125 ms
[2021-05-09 23:00:52] [INFO ] Implicit Places using invariants in 3413 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 23:00:52] [INFO ] Invariants computation overflowed in 127 ms
[2021-05-09 23:00:53] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 4308 ms to find 0 implicit places.
[2021-05-09 23:00:53] [INFO ] Redundant transitions in 253 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2021-05-09 23:00:54] [INFO ] Invariants computation overflowed in 126 ms
[2021-05-09 23:00:56] [INFO ] Dead Transitions using invariants and state equation in 3086 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5599/10600 places, 5395/9998 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2030 s1069)], 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 13789 reset in 389 ms.
Product exploration explored 100000 steps with 13719 reset in 370 ms.
Graph (complete) has 17773 edges and 5599 vertex of which 5597 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13878 reset in 275 ms.
Product exploration explored 100000 steps with 13946 reset in 376 ms.
[2021-05-09 23:00:59] [INFO ] Flatten gal took : 188 ms
[2021-05-09 23:00:59] [INFO ] Flatten gal took : 194 ms
[2021-05-09 23:00:59] [INFO ] Time to serialize gal into /tmp/LTL3933438162029390678.gal : 17 ms
[2021-05-09 23:00:59] [INFO ] Time to serialize properties into /tmp/LTL7384550387933512166.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/LTL3933438162029390678.gal, -t, CGAL, -LTL, /tmp/LTL7384550387933512166.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/LTL3933438162029390678.gal -t CGAL -LTL /tmp/LTL7384550387933512166.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p3919<=p2277)"))))
Formula 0 simplified : !FG"(p3919<=p2277)"
Detected timeout of ITS tools.
[2021-05-09 23:01:14] [INFO ] Flatten gal took : 187 ms
[2021-05-09 23:01:14] [INFO ] Applying decomposition
[2021-05-09 23:01:15] [INFO ] Flatten gal took : 192 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/graph17457773899031153000.txt, -o, /tmp/graph17457773899031153000.bin, -w, /tmp/graph17457773899031153000.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/graph17457773899031153000.bin, -l, -1, -v, -w, /tmp/graph17457773899031153000.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 23:01:15] [INFO ] Decomposing Gal with order
[2021-05-09 23:01:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 23:01:16] [INFO ] Removed a total of 4263 redundant transitions.
[2021-05-09 23:01:17] [INFO ] Flatten gal took : 339 ms
[2021-05-09 23:01:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 127 ms.
[2021-05-09 23:01:17] [INFO ] Time to serialize gal into /tmp/LTL7779226990717058756.gal : 33 ms
[2021-05-09 23:01:17] [INFO ] Time to serialize properties into /tmp/LTL9843924903806771343.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/LTL7779226990717058756.gal, -t, CGAL, -LTL, /tmp/LTL9843924903806771343.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/LTL7779226990717058756.gal -t CGAL -LTL /tmp/LTL9843924903806771343.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu773.p3919<=gu773.p2277)"))))
Formula 0 simplified : !FG"(gu773.p3919<=gu773.p2277)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18122823762587238789
[2021-05-09 23:01:32] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18122823762587238789
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/ltsmin18122823762587238789]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin18122823762587238789] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin18122823762587238789] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DoubleExponent-PT-200-10 finished in 51187 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2399 transitions
Trivial Post-agglo rules discarded 2399 transitions
Performed 2399 trivial Post agglomeration. Transition count delta: 2399
Iterating post reduction 0 with 2399 rules applied. Total rules applied 2399 place count 10599 transition count 7598
Reduce places removed 2399 places and 0 transitions.
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4798 place count 8200 transition count 7598
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 4798 place count 8200 transition count 7198
Deduced a syphon composed of 400 places in 780 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1803 Post agglomeration using F-continuation condition.Transition count delta: 1803
Deduced a syphon composed of 1803 places in 296 ms
Reduce places removed 1803 places and 0 transitions.
Iterating global reduction 2 with 3606 rules applied. Total rules applied 9204 place count 5997 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 274 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9406 place count 5896 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 218 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9608 place count 5795 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 213 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9810 place count 5694 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 211 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 10000 place count 5599 transition count 5395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10001 place count 5598 transition count 5394
Applied a total of 10001 rules in 6880 ms. Remains 5598 /10600 variables (removed 5002) and now considering 5394/9998 (removed 4604) transitions.
// Phase 1: matrix 5394 rows 5598 cols
[2021-05-09 23:01:40] [INFO ] Invariants computation overflowed in 135 ms
[2021-05-09 23:01:44] [INFO ] Implicit Places using invariants in 3417 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2021-05-09 23:01:44] [INFO ] Invariants computation overflowed in 135 ms
[2021-05-09 23:01:45] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 4324 ms to find 0 implicit places.
[2021-05-09 23:01:45] [INFO ] Redundant transitions in 249 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2021-05-09 23:01:45] [INFO ] Invariants computation overflowed in 131 ms
[2021-05-09 23:01:48] [INFO ] Dead Transitions using invariants and state equation in 3017 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5598/10600 places, 5394/9998 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s2267)], 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]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-11 finished in 14729 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3985 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 23:01:52] [INFO ] Invariants computation overflowed in 244 ms
[2021-05-09 23:01:53] [INFO ] Implicit Places using invariants in 1043 ms returned []
Implicit Place search using SMT only with invariants took 1044 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 23:01:53] [INFO ] Invariants computation overflowed in 247 ms
[2021-05-09 23:01:54] [INFO ] Dead Transitions using invariants and state equation in 1041 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s6912)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-12 finished in 7831 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3644 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 23:02:00] [INFO ] Invariants computation overflowed in 243 ms
[2021-05-09 23:02:01] [INFO ] Implicit Places using invariants in 1122 ms returned []
Implicit Place search using SMT only with invariants took 1123 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2021-05-09 23:02:01] [INFO ] Invariants computation overflowed in 246 ms
[2021-05-09 23:02:02] [INFO ] Dead Transitions using invariants and state equation in 1018 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s9052 s2102)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-13 finished in 7516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 10599 transition count 7597
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7198
Deduced a syphon composed of 399 places in 790 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 297 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 2 with 3602 rules applied. Total rules applied 9200 place count 5999 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 275 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9402 place count 5898 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 264 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9604 place count 5797 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 212 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9806 place count 5696 transition count 5397
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 210 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 9994 place count 5602 transition count 5397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9995 place count 5601 transition count 5396
Applied a total of 9995 rules in 6657 ms. Remains 5601 /10600 variables (removed 4999) and now considering 5396/9998 (removed 4602) transitions.
// Phase 1: matrix 5396 rows 5601 cols
[2021-05-09 23:02:10] [INFO ] Invariants computation overflowed in 130 ms
[2021-05-09 23:02:14] [INFO ] Implicit Places using invariants in 3673 ms returned []
// Phase 1: matrix 5396 rows 5601 cols
[2021-05-09 23:02:14] [INFO ] Invariants computation overflowed in 128 ms
[2021-05-09 23:02:15] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 4872 ms to find 0 implicit places.
[2021-05-09 23:02:15] [INFO ] Redundant transitions in 252 ms returned []
// Phase 1: matrix 5396 rows 5601 cols
[2021-05-09 23:02:15] [INFO ] Invariants computation overflowed in 128 ms
[2021-05-09 23:02:19] [INFO ] Dead Transitions using invariants and state equation in 3385 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5601/10600 places, 5396/9998 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s5137 s1934)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-14 finished in 15406 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1768504235993293748
[2021-05-09 23:02:19] [INFO ] Too many transitions (9998) to apply POR reductions. Disabling POR matrices.
[2021-05-09 23:02:19] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1768504235993293748
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/ltsmin1768504235993293748]
[2021-05-09 23:02:19] [INFO ] Applying decomposition
[2021-05-09 23:02:19] [INFO ] Flatten gal took : 272 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/graph13761927031770921405.txt, -o, /tmp/graph13761927031770921405.bin, -w, /tmp/graph13761927031770921405.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/graph13761927031770921405.bin, -l, -1, -v, -w, /tmp/graph13761927031770921405.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 23:02:20] [INFO ] Decomposing Gal with order
[2021-05-09 23:02:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 23:02:27] [INFO ] Removed a total of 2833 redundant transitions.
[2021-05-09 23:02:28] [INFO ] Flatten gal took : 603 ms
[2021-05-09 23:02:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 381 ms.
[2021-05-09 23:02:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality1467589902940212246.gal : 87 ms
[2021-05-09 23:02:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality1420250540567765844.ltl : 2 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/LTLCardinality1467589902940212246.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1420250540567765844.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/LTLCardinality1467589902940212246.gal -t CGAL -LTL /tmp/LTLCardinality1420250540567765844.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !((X(G("(gu4423.p9822<=gu4423.p9593)"))))
Formula 0 simplified : !XG"(gu4423.p9822<=gu4423.p9593)"
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin1768504235993293748] killed by timeout after 25 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin1768504235993293748] killed by timeout after 25 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 23:26:49] [INFO ] Flatten gal took : 316 ms
[2021-05-09 23:26:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality13336305605104729319.gal : 33 ms
[2021-05-09 23:26:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality9501773175293793866.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/LTLCardinality13336305605104729319.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9501773175293793866.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/LTLCardinality13336305605104729319.gal -t CGAL -LTL /tmp/LTLCardinality9501773175293793866.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !((X(G("(p9822<=p9593)"))))
Formula 0 simplified : !XG"(p9822<=p9593)"
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DoubleExponent-PT-200"
export BK_EXAMINATION="LTLCardinality"
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 DoubleExponent-PT-200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875400452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-200.tgz
mv DoubleExponent-PT-200 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;