fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156400421
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for HirschbergSinclair-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8022.668 3600000.00 6963443.00 69998.80 ?FFTTFF?FTTFTFFF 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.r292-tall-162124156400421.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 HirschbergSinclair-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156400421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 34K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 164K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.8K May 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 687K May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-20-00
FORMULA_NAME HirschbergSinclair-PT-20-01
FORMULA_NAME HirschbergSinclair-PT-20-02
FORMULA_NAME HirschbergSinclair-PT-20-03
FORMULA_NAME HirschbergSinclair-PT-20-04
FORMULA_NAME HirschbergSinclair-PT-20-05
FORMULA_NAME HirschbergSinclair-PT-20-06
FORMULA_NAME HirschbergSinclair-PT-20-07
FORMULA_NAME HirschbergSinclair-PT-20-08
FORMULA_NAME HirschbergSinclair-PT-20-09
FORMULA_NAME HirschbergSinclair-PT-20-10
FORMULA_NAME HirschbergSinclair-PT-20-11
FORMULA_NAME HirschbergSinclair-PT-20-12
FORMULA_NAME HirschbergSinclair-PT-20-13
FORMULA_NAME HirschbergSinclair-PT-20-14
FORMULA_NAME HirschbergSinclair-PT-20-15

=== Now, execution of the tool begins

BK_START 1621287158266

Running Version 0
[2021-05-17 21:32:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 21:32:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 21:32:40] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-05-17 21:32:40] [INFO ] Transformed 530 places.
[2021-05-17 21:32:40] [INFO ] Transformed 485 transitions.
[2021-05-17 21:32:40] [INFO ] Parsed PT model containing 530 places and 485 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 21:32:40] [INFO ] Initial state test concluded for 3 properties.
FORMULA HirschbergSinclair-PT-20-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 510 transition count 485
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 39 place count 491 transition count 466
Iterating global reduction 1 with 19 rules applied. Total rules applied 58 place count 491 transition count 466
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 75 place count 474 transition count 449
Iterating global reduction 1 with 17 rules applied. Total rules applied 92 place count 474 transition count 449
Applied a total of 92 rules in 116 ms. Remains 474 /530 variables (removed 56) and now considering 449/485 (removed 36) transitions.
// Phase 1: matrix 449 rows 474 cols
[2021-05-17 21:32:40] [INFO ] Computed 25 place invariants in 25 ms
[2021-05-17 21:32:40] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 449 rows 474 cols
[2021-05-17 21:32:40] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-17 21:32:41] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
// Phase 1: matrix 449 rows 474 cols
[2021-05-17 21:32:41] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-17 21:32:41] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 1 iterations. Remains : 474/530 places, 449/485 transitions.
[2021-05-17 21:32:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 21:32:41] [INFO ] Flatten gal took : 66 ms
FORMULA HirschbergSinclair-PT-20-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 21:32:41] [INFO ] Flatten gal took : 31 ms
[2021-05-17 21:32:42] [INFO ] Input system was already deterministic with 449 transitions.
Incomplete random walk after 100000 steps, including 206 resets, run finished after 473 ms. (steps per millisecond=211 ) properties (out of 27) seen :23
Running SMT prover for 4 properties.
// Phase 1: matrix 449 rows 474 cols
[2021-05-17 21:32:42] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:32:42] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-17 21:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:42] [INFO ] [Real]Absence check using state equation in 124 ms returned unsat
[2021-05-17 21:32:42] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 39 ms returned sat
[2021-05-17 21:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:43] [INFO ] [Real]Absence check using state equation in 152 ms returned unsat
[2021-05-17 21:32:43] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-17 21:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:43] [INFO ] [Real]Absence check using state equation in 90 ms returned unsat
[2021-05-17 21:32:43] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-17 21:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:43] [INFO ] [Real]Absence check using state equation in 107 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2021-05-17 21:32:43] [INFO ] Initial state test concluded for 2 properties.
FORMULA HirschbergSinclair-PT-20-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((F(p0)&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 471 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 471 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 470 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 470 transition count 445
Applied a total of 8 rules in 53 ms. Remains 470 /474 variables (removed 4) and now considering 445/449 (removed 4) transitions.
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:32:46] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:32:46] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:32:46] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:32:47] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:32:47] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:32:47] [INFO ] Dead Transitions using invariants and state equation in 272 ms returned []
Finished structural reductions, in 1 iterations. Remains : 470/474 places, 445/449 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-20-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (GEQ s29 1) (GEQ s196 1)), p0:(GEQ s350 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 290 reset in 347 ms.
Product exploration explored 100000 steps with 291 reset in 315 ms.
Graph (complete) has 899 edges and 470 vertex of which 450 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.5 ms
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 291 reset in 259 ms.
Product exploration explored 100000 steps with 292 reset in 398 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 470 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 470/470 places, 445/445 transitions.
Performed 188 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 470 transition count 445
Deduced a syphon composed of 188 places in 5 ms
Applied a total of 188 rules in 94 ms. Remains 470 /470 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2021-05-17 21:32:49] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:32:49] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:32:50] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Finished structural reductions, in 1 iterations. Remains : 470/470 places, 445/445 transitions.
Product exploration explored 100000 steps with 513 reset in 350 ms.
Product exploration explored 100000 steps with 514 reset in 305 ms.
[2021-05-17 21:32:50] [INFO ] Flatten gal took : 26 ms
[2021-05-17 21:32:50] [INFO ] Flatten gal took : 25 ms
[2021-05-17 21:32:50] [INFO ] Time to serialize gal into /tmp/LTL6739851090932086812.gal : 14 ms
[2021-05-17 21:32:50] [INFO ] Time to serialize properties into /tmp/LTL8403689083330474653.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/LTL6739851090932086812.gal, -t, CGAL, -LTL, /tmp/LTL8403689083330474653.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/LTL6739851090932086812.gal -t CGAL -LTL /tmp/LTL8403689083330474653.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(rcv_right_reply_20_4_10>=1)"))&&(F("((newmsg15>=1)&&(reply_20_3_to_right_14>=1))")))))))
Formula 0 simplified : !XXX(F"(rcv_right_reply_20_4_10>=1)" & F"((newmsg15>=1)&&(reply_20_3_to_right_14>=1))")
Detected timeout of ITS tools.
[2021-05-17 21:33:06] [INFO ] Flatten gal took : 26 ms
[2021-05-17 21:33:06] [INFO ] Applying decomposition
[2021-05-17 21:33:06] [INFO ] Flatten gal took : 21 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/graph10035342812350913473.txt, -o, /tmp/graph10035342812350913473.bin, -w, /tmp/graph10035342812350913473.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/graph10035342812350913473.bin, -l, -1, -v, -w, /tmp/graph10035342812350913473.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:33:06] [INFO ] Decomposing Gal with order
[2021-05-17 21:33:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:33:06] [INFO ] Removed a total of 59 redundant transitions.
[2021-05-17 21:33:06] [INFO ] Flatten gal took : 74 ms
[2021-05-17 21:33:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 21:33:06] [INFO ] Time to serialize gal into /tmp/LTL6489775795369097794.gal : 9 ms
[2021-05-17 21:33:06] [INFO ] Time to serialize properties into /tmp/LTL11081371542468005750.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/LTL6489775795369097794.gal, -t, CGAL, -LTL, /tmp/LTL11081371542468005750.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6489775795369097794.gal -t CGAL -LTL /tmp/LTL11081371542468005750.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(i6.i1.u9.rcv_right_reply_20_4_10>=1)"))&&(F("((i3.i0.u12.newmsg15>=1)&&(i3.i1.u21.reply_20_3_to_right_14>=1))")))))))
Formula 0 simplified : !XXX(F"(i6.i1.u9.rcv_right_reply_20_4_10>=1)" & F"((i3.i0.u12.newmsg15>=1)&&(i3.i1.u21.reply_20_3_to_right_14>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13261753819958040063
[2021-05-17 21:33:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13261753819958040063
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/ltsmin13261753819958040063]
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/ltsmin13261753819958040063] 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/ltsmin13261753819958040063] 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 HirschbergSinclair-PT-20-00 finished in 38974 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 473 transition count 251
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 276 transition count 251
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 397 place count 273 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 400 place count 273 transition count 248
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 402 place count 273 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 404 place count 271 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 405 place count 270 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 406 place count 269 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 407 place count 268 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 408 place count 267 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 409 place count 266 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 410 place count 265 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 411 place count 264 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 412 place count 263 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 413 place count 262 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 261 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 260 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 259 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 258 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 418 place count 257 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 256 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 420 place count 255 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 421 place count 254 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 422 place count 253 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 423 place count 252 transition count 227
Applied a total of 423 rules in 243 ms. Remains 252 /474 variables (removed 222) and now considering 227/449 (removed 222) transitions.
// Phase 1: matrix 227 rows 252 cols
[2021-05-17 21:33:22] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:33:22] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 227 rows 252 cols
[2021-05-17 21:33:22] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-17 21:33:23] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2021-05-17 21:33:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 227 rows 252 cols
[2021-05-17 21:33:23] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:23] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 1 iterations. Remains : 252/474 places, 227/449 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-20-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s217 1), p0:(GEQ s172 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 247 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-01 finished in 996 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 471 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 471 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 470 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 470 transition count 445
Applied a total of 8 rules in 24 ms. Remains 470 /474 variables (removed 4) and now considering 445/449 (removed 4) transitions.
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:33:23] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:23] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:33:23] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:24] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:33:24] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:33:24] [INFO ] Dead Transitions using invariants and state equation in 263 ms returned []
Finished structural reductions, in 1 iterations. Remains : 470/474 places, 445/449 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HirschbergSinclair-PT-20-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s8 1), p0:(GEQ s409 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-02 finished in 1627 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 473 transition count 250
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 275 transition count 250
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 399 place count 272 transition count 247
Iterating global reduction 2 with 3 rules applied. Total rules applied 402 place count 272 transition count 247
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 404 place count 272 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 406 place count 270 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 407 place count 269 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 408 place count 268 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 409 place count 267 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 410 place count 266 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 411 place count 265 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 412 place count 264 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 413 place count 263 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 262 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 261 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 260 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 259 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 418 place count 258 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 257 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 420 place count 256 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 421 place count 255 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 422 place count 254 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 423 place count 253 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 424 place count 252 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 425 place count 251 transition count 226
Applied a total of 425 rules in 157 ms. Remains 251 /474 variables (removed 223) and now considering 226/449 (removed 223) transitions.
// Phase 1: matrix 226 rows 251 cols
[2021-05-17 21:33:25] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:33:25] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 226 rows 251 cols
[2021-05-17 21:33:25] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:33:25] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2021-05-17 21:33:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 226 rows 251 cols
[2021-05-17 21:33:25] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:33:25] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 1 iterations. Remains : 251/474 places, 226/449 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s176 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 407 reset in 230 ms.
Product exploration explored 100000 steps with 407 reset in 236 ms.
Graph (complete) has 641 edges and 251 vertex of which 231 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 407 reset in 188 ms.
Product exploration explored 100000 steps with 407 reset in 203 ms.
[2021-05-17 21:33:26] [INFO ] Flatten gal took : 10 ms
[2021-05-17 21:33:26] [INFO ] Flatten gal took : 9 ms
[2021-05-17 21:33:26] [INFO ] Time to serialize gal into /tmp/LTL4498415927894634019.gal : 1 ms
[2021-05-17 21:33:26] [INFO ] Time to serialize properties into /tmp/LTL7525814417606390231.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/LTL4498415927894634019.gal, -t, CGAL, -LTL, /tmp/LTL7525814417606390231.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/LTL4498415927894634019.gal -t CGAL -LTL /tmp/LTL7525814417606390231.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(rcv_right_reply_20_4_14<1)"))))
Formula 0 simplified : !FG"(rcv_right_reply_20_4_14<1)"
Reverse transition relation is NOT exact ! Due to transitions t22.t23, t26.t27, t30.t31, t34.t35, t38.t39, t43.t44, t47.t48, t51.t52, t55.t56, t61.t62, t65.t66, t69.t70, t73.t74, t77.t78, t82.t83, t86.t87, t90.t91, t94.t95, t387.t388, t427.t428, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/206/20/226
Computing Next relation with stutter on 4.57764e+14 deadlock states
Detected timeout of ITS tools.
[2021-05-17 21:33:41] [INFO ] Flatten gal took : 41 ms
[2021-05-17 21:33:41] [INFO ] Applying decomposition
[2021-05-17 21:33:41] [INFO ] Flatten gal took : 25 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/graph13723692281730795742.txt, -o, /tmp/graph13723692281730795742.bin, -w, /tmp/graph13723692281730795742.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/graph13723692281730795742.bin, -l, -1, -v, -w, /tmp/graph13723692281730795742.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:33:42] [INFO ] Decomposing Gal with order
[2021-05-17 21:33:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:33:42] [INFO ] Removed a total of 156 redundant transitions.
[2021-05-17 21:33:42] [INFO ] Flatten gal took : 36 ms
[2021-05-17 21:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 7 ms.
[2021-05-17 21:33:42] [INFO ] Time to serialize gal into /tmp/LTL2753483716155079171.gal : 22 ms
[2021-05-17 21:33:42] [INFO ] Time to serialize properties into /tmp/LTL11681344470916714842.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/LTL2753483716155079171.gal, -t, CGAL, -LTL, /tmp/LTL11681344470916714842.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2753483716155079171.gal -t CGAL -LTL /tmp/LTL11681344470916714842.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i6.i0.u0.rcv_right_reply_20_4_14<1)"))))
Formula 0 simplified : !FG"(i6.i0.u0.rcv_right_reply_20_4_14<1)"
Reverse transition relation is NOT exact ! Due to transitions t26_t27, t43_t44, t61_t62, t82_t83, t183_t184, t387_t388, i1.t22_t23, i2.t427_t428, i2.t94_t95, i3.t34_t35, i3.i0.t38_t39, i3.i1.t30_t31, i4.t55_t56, i4.t51_t52, i4.t47_t48, i5.i0.t86_t87, i6.t73_t74, i6.i0.t77_t78, i6.i1.t65_t66, i6.i1.t69_t70, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/198/20/218
Computing Next relation with stutter on 4.57764e+14 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2361597103753767458
[2021-05-17 21:33:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2361597103753767458
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/ltsmin2361597103753767458]
Compilation finished in 955 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2361597103753767458]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2361597103753767458]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-20-07 finished in 47124 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 473 transition count 259
Reduce places removed 189 places and 0 transitions.
Iterating post reduction 1 with 189 rules applied. Total rules applied 378 place count 284 transition count 259
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 381 place count 281 transition count 256
Iterating global reduction 2 with 3 rules applied. Total rules applied 384 place count 281 transition count 256
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 385 place count 281 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 386 place count 280 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 279 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 388 place count 278 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 277 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 390 place count 276 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 391 place count 275 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 392 place count 274 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 273 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 394 place count 272 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 271 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 270 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 269 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 268 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 399 place count 267 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 266 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 401 place count 265 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 264 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 263 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 404 place count 262 transition count 237
Applied a total of 404 rules in 119 ms. Remains 262 /474 variables (removed 212) and now considering 237/449 (removed 212) transitions.
// Phase 1: matrix 237 rows 262 cols
[2021-05-17 21:34:12] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:34:12] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 237 rows 262 cols
[2021-05-17 21:34:12] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:34:12] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2021-05-17 21:34:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 237 rows 262 cols
[2021-05-17 21:34:12] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:34:13] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 262/474 places, 237/449 transitions.
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-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:(OR (LT s15 1) (LT s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 99 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-08 finished in 902 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 473 transition count 260
Reduce places removed 188 places and 0 transitions.
Iterating post reduction 1 with 188 rules applied. Total rules applied 376 place count 285 transition count 260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 379 place count 282 transition count 257
Iterating global reduction 2 with 3 rules applied. Total rules applied 382 place count 282 transition count 257
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 384 place count 282 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 386 place count 280 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 279 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 388 place count 278 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 277 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 390 place count 276 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 391 place count 275 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 392 place count 274 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 273 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 394 place count 272 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 271 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 270 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 269 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 268 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 399 place count 267 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 266 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 401 place count 265 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 264 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 263 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 404 place count 262 transition count 237
Applied a total of 404 rules in 126 ms. Remains 262 /474 variables (removed 212) and now considering 237/449 (removed 212) transitions.
// Phase 1: matrix 237 rows 262 cols
[2021-05-17 21:34:13] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:34:13] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 237 rows 262 cols
[2021-05-17 21:34:13] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-17 21:34:13] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2021-05-17 21:34:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 237 rows 262 cols
[2021-05-17 21:34:13] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:34:13] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 1 iterations. Remains : 262/474 places, 237/449 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s17 1) (GEQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 535 reset in 190 ms.
Product exploration explored 100000 steps with 535 reset in 215 ms.
Graph (complete) has 654 edges and 262 vertex of which 242 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 535 reset in 195 ms.
Product exploration explored 100000 steps with 535 reset in 218 ms.
[2021-05-17 21:34:14] [INFO ] Flatten gal took : 9 ms
[2021-05-17 21:34:14] [INFO ] Flatten gal took : 9 ms
[2021-05-17 21:34:14] [INFO ] Time to serialize gal into /tmp/LTL3799162226046771353.gal : 1 ms
[2021-05-17 21:34:14] [INFO ] Time to serialize properties into /tmp/LTL11271721051730634623.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/LTL3799162226046771353.gal, -t, CGAL, -LTL, /tmp/LTL11271721051730634623.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/LTL3799162226046771353.gal -t CGAL -LTL /tmp/LTL11271721051730634623.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((newmsg17>=1)&&(reply_20_4_to_right_16>=1))")))
Formula 0 simplified : !F"((newmsg17>=1)&&(reply_20_4_to_right_16>=1))"
Reverse transition relation is NOT exact ! Due to transitions t16, t22.t23, t26.t27, t30.t31, t34.t35, t38.t39, t43.t44, t47.t48, t51.t52, t55.t56, t61.t62, t65.t66, t69.t70, t73.t74, t77.t78, t82.t83, t87, t88.t89, t90.t91, t93, t94.t95, t387.t388, t427.t428, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/214/23/237
Computing Next relation with stutter on 4.57764e+14 deadlock states
Detected timeout of ITS tools.
[2021-05-17 21:34:29] [INFO ] Flatten gal took : 9 ms
[2021-05-17 21:34:29] [INFO ] Applying decomposition
[2021-05-17 21:34:29] [INFO ] Flatten gal took : 8 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/graph18286913677380794962.txt, -o, /tmp/graph18286913677380794962.bin, -w, /tmp/graph18286913677380794962.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/graph18286913677380794962.bin, -l, -1, -v, -w, /tmp/graph18286913677380794962.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:34:29] [INFO ] Decomposing Gal with order
[2021-05-17 21:34:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:34:30] [INFO ] Removed a total of 152 redundant transitions.
[2021-05-17 21:34:30] [INFO ] Flatten gal took : 17 ms
[2021-05-17 21:34:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 7 ms.
[2021-05-17 21:34:30] [INFO ] Time to serialize gal into /tmp/LTL11035693059923714238.gal : 3 ms
[2021-05-17 21:34:30] [INFO ] Time to serialize properties into /tmp/LTL14469901656004932704.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/LTL11035693059923714238.gal, -t, CGAL, -LTL, /tmp/LTL14469901656004932704.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11035693059923714238.gal -t CGAL -LTL /tmp/LTL14469901656004932704.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((i2.u17.newmsg17>=1)&&(i2.u59.reply_20_4_to_right_16>=1))")))
Formula 0 simplified : !F"((i2.u17.newmsg17>=1)&&(i2.u59.reply_20_4_to_right_16>=1))"
Reverse transition relation is NOT exact ! Due to transitions t26_t27, t51_t52, t61_t62, t90_t91, t294_t295, t387_t388, t421_t422, i1.t69_t70, i1.i0.t65_t66, i1.i1.t73_t74, i1.i1.t77_t78, i2.t93, i2.t88_t89, i2.t16, i2.u17.t87, i3.t124_t125, i3.i1.t427_t428, i4.t47_t48, i4.t43_t44, i4.t38_t39, i5.i0.t30_t31, i6.t55_t56, i7.i1.t22_t23, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/23/223
Computing Next relation with stutter on 4.57764e+14 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
847 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.50934,226928,1,0,418965,819,4354,1.44836e+06,311,3543,293257
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-20-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HirschbergSinclair-PT-20-09 finished in 26953 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p1)&&p0)||((p2 U p3)&&X(X(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 471 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 471 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 470 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 470 transition count 445
Applied a total of 8 rules in 25 ms. Remains 470 /474 variables (removed 4) and now considering 445/449 (removed 4) transitions.
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:34:40] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:34:40] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:34:40] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:34:41] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:34:41] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:34:41] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 1 iterations. Remains : 470/474 places, 445/449 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p3), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-20-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s404 1)), p3:(OR (AND (GEQ s5 1) (GEQ s404 1)) (GEQ s297 1)), p2:(AND (GEQ s35 1) (GEQ s144 1)), p1:(AND (GEQ s39 1) (GEQ s239 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-11 finished in 1743 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||X((F(p2)||p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 472 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 472 transition count 447
Applied a total of 4 rules in 21 ms. Remains 472 /474 variables (removed 2) and now considering 447/449 (removed 2) transitions.
// Phase 1: matrix 447 rows 472 cols
[2021-05-17 21:34:41] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:34:41] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 447 rows 472 cols
[2021-05-17 21:34:42] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:34:43] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
// Phase 1: matrix 447 rows 472 cols
[2021-05-17 21:34:43] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:34:43] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/474 places, 447/449 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-20-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(GEQ s330 1), p2:(GEQ s79 1), p1:(OR (LT s27 1) (LT s384 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 340 ms.
Product exploration explored 100000 steps with 25000 reset in 364 ms.
Graph (complete) has 902 edges and 472 vertex of which 452 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), (NOT p2), p1]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 363 ms.
Product exploration explored 100000 steps with 25000 reset in 414 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 472 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 472/472 places, 447/447 transitions.
Performed 188 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 472 transition count 447
Deduced a syphon composed of 188 places in 8 ms
Applied a total of 188 rules in 23 ms. Remains 472 /472 variables (removed 0) and now considering 447/447 (removed 0) transitions.
[2021-05-17 21:34:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 447 rows 472 cols
[2021-05-17 21:34:45] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:34:45] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Finished structural reductions, in 1 iterations. Remains : 472/472 places, 447/447 transitions.
Product exploration explored 100000 steps with 25000 reset in 1275 ms.
Product exploration explored 100000 steps with 25000 reset in 1277 ms.
[2021-05-17 21:34:48] [INFO ] Flatten gal took : 17 ms
[2021-05-17 21:34:48] [INFO ] Flatten gal took : 15 ms
[2021-05-17 21:34:48] [INFO ] Time to serialize gal into /tmp/LTL1104980746820949919.gal : 1 ms
[2021-05-17 21:34:48] [INFO ] Time to serialize properties into /tmp/LTL2060574976680337463.ltl : 53 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/LTL1104980746820949919.gal, -t, CGAL, -LTL, /tmp/LTL2060574976680337463.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/LTL1104980746820949919.gal -t CGAL -LTL /tmp/LTL2060574976680337463.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(rcv_left_election_20_4_11_11>=1)")||(X(("((newmsg14<1)||(election_20_5_6_to_left_15<1))")||(F("(rcv_left_reply_10_0_10>=1)"))))))))
Formula 0 simplified : !XX("(rcv_left_election_20_4_11_11>=1)" | X("((newmsg14<1)||(election_20_5_6_to_left_15<1))" | F"(rcv_left_reply_10_0_10>=1)"))
Detected timeout of ITS tools.
[2021-05-17 21:35:03] [INFO ] Flatten gal took : 16 ms
[2021-05-17 21:35:03] [INFO ] Applying decomposition
[2021-05-17 21:35:03] [INFO ] Flatten gal took : 15 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/graph12507158185039007608.txt, -o, /tmp/graph12507158185039007608.bin, -w, /tmp/graph12507158185039007608.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/graph12507158185039007608.bin, -l, -1, -v, -w, /tmp/graph12507158185039007608.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:35:03] [INFO ] Decomposing Gal with order
[2021-05-17 21:35:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:35:03] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-17 21:35:03] [INFO ] Flatten gal took : 30 ms
[2021-05-17 21:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 21:35:03] [INFO ] Time to serialize gal into /tmp/LTL17335115660076326749.gal : 22 ms
[2021-05-17 21:35:03] [INFO ] Time to serialize properties into /tmp/LTL1805860248064224296.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/LTL17335115660076326749.gal, -t, CGAL, -LTL, /tmp/LTL1805860248064224296.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17335115660076326749.gal -t CGAL -LTL /tmp/LTL1805860248064224296.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i1.u20.rcv_left_election_20_4_11_11>=1)")||(X(("((i2.u9.newmsg14<1)||(i3.u10.election_20_5_6_to_left_15<1))")||(F("(i1.u19.rcv_left_reply_10_0_10>=1)"))))))))
Formula 0 simplified : !XX("(i1.u20.rcv_left_election_20_4_11_11>=1)" | X("((i2.u9.newmsg14<1)||(i3.u10.election_20_5_6_to_left_15<1))" | F"(i1.u19.rcv_left_reply_10_0_10>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9799520286261084014
[2021-05-17 21:35:18] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9799520286261084014
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/ltsmin9799520286261084014]
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/ltsmin9799520286261084014] 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/ltsmin9799520286261084014] 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 HirschbergSinclair-PT-20-12 finished in 37874 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(p0)&&(p0||G(p1))))||G((!p1&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 472 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 472 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 471 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 471 transition count 446
Applied a total of 6 rules in 22 ms. Remains 471 /474 variables (removed 3) and now considering 446/449 (removed 3) transitions.
// Phase 1: matrix 446 rows 471 cols
[2021-05-17 21:35:19] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:35:19] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 446 rows 471 cols
[2021-05-17 21:35:19] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:35:20] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 471 cols
[2021-05-17 21:35:20] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:35:21] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 471/474 places, 446/449 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-13 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 p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(OR p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s31 1) (GEQ s105 1)), p1:(AND (GEQ s29 1) (GEQ s94 1)), p2:(OR (LT s23 1) (LT s387 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-13 finished in 1629 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 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 473 transition count 259
Reduce places removed 189 places and 0 transitions.
Iterating post reduction 1 with 189 rules applied. Total rules applied 378 place count 284 transition count 259
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 381 place count 281 transition count 256
Iterating global reduction 2 with 3 rules applied. Total rules applied 384 place count 281 transition count 256
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 386 place count 281 transition count 254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 388 place count 279 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 278 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 390 place count 277 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 391 place count 276 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 392 place count 275 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 274 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 394 place count 273 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 272 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 271 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 270 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 269 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 399 place count 268 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 267 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 401 place count 266 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 265 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 264 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 404 place count 263 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 405 place count 262 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 406 place count 261 transition count 236
Applied a total of 406 rules in 98 ms. Remains 261 /474 variables (removed 213) and now considering 236/449 (removed 213) transitions.
// Phase 1: matrix 236 rows 261 cols
[2021-05-17 21:35:21] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:35:21] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 236 rows 261 cols
[2021-05-17 21:35:21] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-17 21:35:21] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2021-05-17 21:35:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 236 rows 261 cols
[2021-05-17 21:35:21] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:35:22] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 261/474 places, 236/449 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 257 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-14 finished in 853 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 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 449/449 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 473 transition count 259
Reduce places removed 189 places and 0 transitions.
Iterating post reduction 1 with 189 rules applied. Total rules applied 378 place count 284 transition count 259
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 380 place count 282 transition count 257
Iterating global reduction 2 with 2 rules applied. Total rules applied 382 place count 282 transition count 257
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 383 place count 282 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 384 place count 281 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 385 place count 280 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 386 place count 279 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 278 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 388 place count 277 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 276 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 390 place count 275 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 391 place count 274 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 392 place count 273 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 272 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 394 place count 271 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 270 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 269 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 268 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 267 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 399 place count 266 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 265 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 401 place count 264 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 263 transition count 238
Applied a total of 402 rules in 101 ms. Remains 263 /474 variables (removed 211) and now considering 238/449 (removed 211) transitions.
// Phase 1: matrix 238 rows 263 cols
[2021-05-17 21:35:22] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:35:22] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 238 rows 263 cols
[2021-05-17 21:35:22] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:35:22] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2021-05-17 21:35:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 238 rows 263 cols
[2021-05-17 21:35:22] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:35:22] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 263/474 places, 238/449 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1870 reset in 315 ms.
Product exploration explored 100000 steps with 1852 reset in 347 ms.
Graph (complete) has 655 edges and 263 vertex of which 243 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1853 reset in 318 ms.
Product exploration explored 100000 steps with 1841 reset in 352 ms.
[2021-05-17 21:35:24] [INFO ] Flatten gal took : 8 ms
[2021-05-17 21:35:24] [INFO ] Flatten gal took : 7 ms
[2021-05-17 21:35:24] [INFO ] Time to serialize gal into /tmp/LTL6870699482124064916.gal : 2 ms
[2021-05-17 21:35:24] [INFO ] Time to serialize properties into /tmp/LTL15667546788800377415.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/LTL6870699482124064916.gal, -t, CGAL, -LTL, /tmp/LTL15667546788800377415.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/LTL6870699482124064916.gal -t CGAL -LTL /tmp/LTL15667546788800377415.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((newmsg6>=1)&&(reply_6_0_to_right_5>=1))"))))
Formula 0 simplified : !GF"((newmsg6>=1)&&(reply_6_0_to_right_5>=1))"
Reverse transition relation is NOT exact ! Due to transitions t5, t22.t23, t26.t27, t30.t31, t34.t35, t39, t42, t43.t44, t46, t47.t48, t51.t52, t55.t56, t61.t62, t65.t66, t69.t70, t73.t74, t77.t78, t82.t83, t86.t87, t90.t91, t94.t95, t387.t388, t427.t428, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/215/23/238
Computing Next relation with stutter on 5.49316e+14 deadlock states
Detected timeout of ITS tools.
[2021-05-17 21:35:39] [INFO ] Flatten gal took : 11 ms
[2021-05-17 21:35:39] [INFO ] Applying decomposition
[2021-05-17 21:35:39] [INFO ] Flatten gal took : 7 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/graph12360562037210911395.txt, -o, /tmp/graph12360562037210911395.bin, -w, /tmp/graph12360562037210911395.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/graph12360562037210911395.bin, -l, -1, -v, -w, /tmp/graph12360562037210911395.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:35:39] [INFO ] Decomposing Gal with order
[2021-05-17 21:35:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:35:39] [INFO ] Removed a total of 152 redundant transitions.
[2021-05-17 21:35:39] [INFO ] Flatten gal took : 16 ms
[2021-05-17 21:35:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 6 ms.
[2021-05-17 21:35:40] [INFO ] Time to serialize gal into /tmp/LTL2728353578727073782.gal : 514 ms
[2021-05-17 21:35:40] [INFO ] Time to serialize properties into /tmp/LTL8426821599277914461.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/LTL2728353578727073782.gal, -t, CGAL, -LTL, /tmp/LTL8426821599277914461.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2728353578727073782.gal -t CGAL -LTL /tmp/LTL8426821599277914461.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i5.u0.newmsg6>=1)&&(i5.u6.reply_6_0_to_right_5>=1))"))))
Formula 0 simplified : !GF"((i5.u0.newmsg6>=1)&&(i5.u6.reply_6_0_to_right_5>=1))"
Reverse transition relation is NOT exact ! Due to transitions t30_t31, t43_t44, t55_t56, t73_t74, t86_t87, t387_t388, i1.t22_t23, i1.i1.t26_t27, i2.t427_t428, i2.t124_t125, i2.i1.t90_t91, i3.t270_t271, i3.t266_t267, i3.t65_t66, i4.t51_t52, i4.t47_t48, i5.t42, i5.t34_t35, i5.t5, i5.u0.t39, i5.u0.t46, i6.t82_t83, i6.t77_t78, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/202/23/225
Computing Next relation with stutter on 5.49316e+14 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13937335063280451042
[2021-05-17 21:35:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13937335063280451042
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/ltsmin13937335063280451042]
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/ltsmin13937335063280451042] 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/ltsmin13937335063280451042] 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 HirschbergSinclair-PT-20-15 finished in 34086 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13303716103502614299
[2021-05-17 21:35:56] [INFO ] Computing symmetric may disable matrix : 449 transitions.
[2021-05-17 21:35:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 21:35:56] [INFO ] Computing symmetric may enable matrix : 449 transitions.
[2021-05-17 21:35:56] [INFO ] Applying decomposition
[2021-05-17 21:35:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 21:35:56] [INFO ] Flatten gal took : 33 ms
[2021-05-17 21:35:56] [INFO ] Computing Do-Not-Accords matrix : 449 transitions.
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/graph17836475611389851650.txt, -o, /tmp/graph17836475611389851650.bin, -w, /tmp/graph17836475611389851650.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/graph17836475611389851650.bin, -l, -1, -v, -w, /tmp/graph17836475611389851650.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:35:56] [INFO ] Decomposing Gal with order
[2021-05-17 21:35:56] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 21:35:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:35:56] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13303716103502614299
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/ltsmin13303716103502614299]
[2021-05-17 21:35:56] [INFO ] Removed a total of 63 redundant transitions.
[2021-05-17 21:35:56] [INFO ] Flatten gal took : 28 ms
[2021-05-17 21:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 21:35:58] [INFO ] Time to serialize gal into /tmp/LTLFireability12872713132855436090.gal : 2078 ms
[2021-05-17 21:35:58] [INFO ] Time to serialize properties into /tmp/LTLFireability11523664928575828697.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/LTLFireability12872713132855436090.gal, -t, CGAL, -LTL, /tmp/LTLFireability11523664928575828697.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability12872713132855436090.gal -t CGAL -LTL /tmp/LTLFireability11523664928575828697.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !(((G("((i6.u15.rcv_left_reply_20_2_20>=1)&&(i4.u11.rcv_left_election_20_4_15_15>=1))"))||(X(X(X((F("(i8.u7.rcv_right_reply_20_4_10>=1)"))&&(F("((i4.u11.newmsg15>=1)&&(i4.u33.reply_20_3_to_right_14>=1))"))))))))
Formula 0 simplified : !(G"((i6.u15.rcv_left_reply_20_2_20>=1)&&(i4.u11.rcv_left_election_20_4_15_15>=1))" | XXX(F"(i8.u7.rcv_right_reply_20_4_10>=1)" & F"((i4.u11.newmsg15>=1)&&(i4.u33.reply_20_3_to_right_14>=1))"))
Compilation finished in 3582 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13303716103502614299]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
Reverse transition relation is NOT exact ! Due to transitions start1, start3, start5, start6, start7, start9, start10, start12, start14, start17, start18, start19, hdl_right_election_7_0_1_6, hdl_right_election_19_0_1_18, hdl_right_election_20_5_19_1, elected_20_20, i0.hdl_right_election_3_0_1_2, i0.start2, i0.u0.hdl_right_election_2_0_1_1, i0.u1.hdl_left_election_1_0_1_2, i1.hdl_right_election_4_0_1_3, i1.start4, i1.u2.hdl_left_election_2_0_1_3, i1.u17.hdl_left_election_3_0_1_4, i1.u17.hdl_right_election_5_0_1_4, i2.hdl_right_election_9_0_1_8, i2.start8, i2.i0.u4.hdl_left_election_6_0_1_7, i2.i0.u4.hdl_right_election_8_0_1_7, i2.i0.u5.hdl_left_election_7_0_1_8, i2.i1.u6.hdl_left_election_8_0_1_9, i3.hdl_right_election_14_0_1_13, i3.start13, i3.u9.hdl_left_election_11_0_1_12, i3.u9.hdl_right_election_13_0_1_12, i3.u10.hdl_left_election_12_0_1_13, i4.hdl_right_election_16_0_1_15, i4.reply_15_0_from_left_15, i4.start16, i4.start15, i4.u11.hdl_left_election_14_0_1_15, i4.u12.hdl_left_election_15_0_1_16, i4.u12.hdl_right_election_17_0_1_16, i4.u20.hdl_left_election_13_0_1_14, i5.hdl_right_election_18_0_1_17, i5.u13.hdl_left_election_16_0_1_17, i5.u22.hdl_left_election_17_0_1_18, i6.start20, i6.u14.hdl_left_election_18_0_1_19, i6.u14.hdl_left_election_20_5_19_19, i6.u15.hdl_right_election_1_0_1_20, i7.reply_6_0_from_left_6, i7.u3.hdl_left_election_4_0_1_5, i7.u19.hdl_left_election_5_0_1_6, i8.hdl_right_election_11_0_1_10, i8.start11, i8.u7.hdl_left_election_9_0_1_10, i8.u7.hdl_left_reply_10_0_10, i8.u8.hdl_left_election_10_0_1_11, i8.u8.hdl_right_election_12_0_1_11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/389/60/449
Computing Next relation with stutter on 7.91016e+14 deadlock states
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp3==true)||X((<>((LTLAPp5==true))||(LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
LTSmin run took 678 ms.
FORMULA HirschbergSinclair-PT-20-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp6==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
LTSmin run took 1591 ms.
FORMULA HirschbergSinclair-PT-20-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.119: LTL layer: formula: X(X(X((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.119: "X(X(X((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.119: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.187: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.190: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.195: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.195: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.204: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.318: DFS-FIFO for weak LTL, using special progress label 457
pins2lts-mc-linux64( 0/ 8), 0.318: There are 458 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.318: State length is 475, there are 457 groups
pins2lts-mc-linux64( 0/ 8), 0.318: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.318: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.318: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.318: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.488: ~113 levels ~960 states ~17232 transitions
pins2lts-mc-linux64( 3/ 8), 0.501: ~235 levels ~1920 states ~19224 transitions
pins2lts-mc-linux64( 6/ 8), 0.513: ~362 levels ~3840 states ~23560 transitions
pins2lts-mc-linux64( 2/ 8), 0.550: ~352 levels ~7680 states ~32000 transitions
pins2lts-mc-linux64( 0/ 8), 0.632: ~357 levels ~15360 states ~48848 transitions
pins2lts-mc-linux64( 7/ 8), 0.799: ~356 levels ~30720 states ~99224 transitions
pins2lts-mc-linux64( 4/ 8), 1.064: ~361 levels ~61440 states ~184352 transitions
pins2lts-mc-linux64( 4/ 8), 1.673: ~361 levels ~122880 states ~409480 transitions
pins2lts-mc-linux64( 1/ 8), 3.358: ~361 levels ~245760 states ~802248 transitions
pins2lts-mc-linux64( 2/ 8), 6.360: ~361 levels ~491520 states ~1896248 transitions
pins2lts-mc-linux64( 5/ 8), 12.903: ~361 levels ~983040 states ~3683200 transitions
pins2lts-mc-linux64( 0/ 8), 26.550: ~361 levels ~1966080 states ~7916024 transitions
pins2lts-mc-linux64( 0/ 8), 53.393: ~361 levels ~3932160 states ~16738304 transitions
pins2lts-mc-linux64( 0/ 8), 113.045: ~361 levels ~7864320 states ~37394856 transitions
pins2lts-mc-linux64( 5/ 8), 238.722: ~361 levels ~15728640 states ~84550176 transitions
pins2lts-mc-linux64( 3/ 8), 493.091: ~361 levels ~31457280 states ~176155312 transitions
pins2lts-mc-linux64( 2/ 8), 658.060: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 658.088:
pins2lts-mc-linux64( 0/ 8), 658.088: mean standard work distribution: 3.7% (states) 2.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 658.088:
pins2lts-mc-linux64( 0/ 8), 658.088: Explored 38902042 states 241156328 transitions, fanout: 6.199
pins2lts-mc-linux64( 0/ 8), 658.088: Total exploration time 657.750 sec (657.730 sec minimum, 657.743 sec on average)
pins2lts-mc-linux64( 0/ 8), 658.088: States per second: 59144, Transitions per second: 366638
pins2lts-mc-linux64( 0/ 8), 658.088:
pins2lts-mc-linux64( 0/ 8), 658.088: Progress states detected: 164
pins2lts-mc-linux64( 0/ 8), 658.088: Redundant explorations: -0.0189
pins2lts-mc-linux64( 0/ 8), 658.088:
pins2lts-mc-linux64( 0/ 8), 658.088: Queue width: 8B, total height: 3265, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 658.088: Tree memory: 552.9MB, 14.9 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 658.088: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 658.088: Stored 451 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 658.088: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 658.088: Est. total memory use: 552.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13303716103502614299]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 21:57:03] [INFO ] Flatten gal took : 14 ms
[2021-05-17 21:57:03] [INFO ] Time to serialize gal into /tmp/LTLFireability14446196963379269655.gal : 2 ms
[2021-05-17 21:57:03] [INFO ] Time to serialize properties into /tmp/LTLFireability6956211962567278298.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/LTLFireability14446196963379269655.gal, -t, CGAL, -LTL, /tmp/LTLFireability6956211962567278298.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/LTLFireability14446196963379269655.gal -t CGAL -LTL /tmp/LTLFireability6956211962567278298.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((G("((rcv_left_reply_20_2_20>=1)&&(rcv_left_election_20_4_15_15>=1))"))||(X(X(X((F("(rcv_right_reply_20_4_10>=1)"))&&(F("((newmsg15>=1)&&(reply_20_3_to_right_14>=1))"))))))))
Formula 0 simplified : !(G"((rcv_left_reply_20_2_20>=1)&&(rcv_left_election_20_4_15_15>=1))" | XXX(F"(rcv_right_reply_20_4_10>=1)" & F"((newmsg15>=1)&&(reply_20_3_to_right_14>=1))"))
Reverse transition relation is NOT exact ! Due to transitions start1, start2, start3, start4, start5, start6, start7, start8, start9, start10, start11, start12, start13, start14, start15, start16, start17, start18, start19, start20, hdl_right_election_1_0_1_20, hdl_left_election_1_0_1_2, hdl_right_election_2_0_1_1, hdl_left_election_2_0_1_3, hdl_right_election_3_0_1_2, hdl_left_election_3_0_1_4, hdl_right_election_4_0_1_3, hdl_left_election_4_0_1_5, hdl_right_election_5_0_1_4, hdl_left_election_5_0_1_6, reply_6_0_from_left_6, hdl_left_election_6_0_1_7, hdl_right_election_7_0_1_6, hdl_left_election_7_0_1_8, hdl_right_election_8_0_1_7, hdl_left_election_8_0_1_9, hdl_right_election_9_0_1_8, hdl_left_election_9_0_1_10, hdl_left_reply_10_0_10, hdl_left_election_10_0_1_11, hdl_right_election_11_0_1_10, hdl_left_election_11_0_1_12, hdl_right_election_12_0_1_11, hdl_left_election_12_0_1_13, hdl_right_election_13_0_1_12, hdl_left_election_13_0_1_14, hdl_right_election_14_0_1_13, hdl_left_election_14_0_1_15, reply_15_0_from_left_15, hdl_left_election_15_0_1_16, hdl_right_election_16_0_1_15, hdl_left_election_16_0_1_17, hdl_right_election_17_0_1_16, hdl_left_election_17_0_1_18, hdl_right_election_18_0_1_17, hdl_left_election_18_0_1_19, hdl_right_election_19_0_1_18, hdl_right_election_20_5_19_1, hdl_left_election_20_5_19_19, elected_20_20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/389/60/449
Computing Next relation with stutter on 7.91016e+14 deadlock states
Detected timeout of ITS tools.
[2021-05-17 22:18:08] [INFO ] Flatten gal took : 13 ms
[2021-05-17 22:18:08] [INFO ] Input system was already deterministic with 449 transitions.
[2021-05-17 22:18:08] [INFO ] Transformed 474 places.
[2021-05-17 22:18:08] [INFO ] Transformed 449 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 22:18:08] [INFO ] Time to serialize gal into /tmp/LTLFireability16618431475474386034.gal : 2 ms
[2021-05-17 22:18:08] [INFO ] Time to serialize properties into /tmp/LTLFireability11061236038500304746.ltl : 5 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/LTLFireability16618431475474386034.gal, -t, CGAL, -LTL, /tmp/LTLFireability11061236038500304746.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16618431475474386034.gal -t CGAL -LTL /tmp/LTLFireability11061236038500304746.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((rcv_left_reply_20_2_20>=1)&&(rcv_left_election_20_4_15_15>=1))"))||(X(X(X((F("(rcv_right_reply_20_4_10>=1)"))&&(F("((newmsg15>=1)&&(reply_20_3_to_right_14>=1))"))))))))
Formula 0 simplified : !(G"((rcv_left_reply_20_2_20>=1)&&(rcv_left_election_20_4_15_15>=1))" | XXX(F"(rcv_right_reply_20_4_10>=1)" & F"((newmsg15>=1)&&(reply_20_3_to_right_14>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t42, t44, t46, t48, t50, t52, t54, t56, t60, t62, t64, t66, t68, t70, t72, t74, t76, t78, t81, t83, t85, t87, t89, t91, t93, t95, t97, t388, t428, t448, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/389/60/449
Computing Next relation with stutter on 7.91016e+14 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156400421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-20.tgz
mv HirschbergSinclair-PT-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;