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-162124155800012.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 CANConstruction-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155800012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 33K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 193K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 12 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 12 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 11 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 11 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 554K 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 CANConstruction-PT-010-00
FORMULA_NAME CANConstruction-PT-010-01
FORMULA_NAME CANConstruction-PT-010-02
FORMULA_NAME CANConstruction-PT-010-03
FORMULA_NAME CANConstruction-PT-010-04
FORMULA_NAME CANConstruction-PT-010-05
FORMULA_NAME CANConstruction-PT-010-06
FORMULA_NAME CANConstruction-PT-010-07
FORMULA_NAME CANConstruction-PT-010-08
FORMULA_NAME CANConstruction-PT-010-09
FORMULA_NAME CANConstruction-PT-010-10
FORMULA_NAME CANConstruction-PT-010-11
FORMULA_NAME CANConstruction-PT-010-12
FORMULA_NAME CANConstruction-PT-010-13
FORMULA_NAME CANConstruction-PT-010-14
FORMULA_NAME CANConstruction-PT-010-15

=== Now, execution of the tool begins

BK_START 1621242848071

Running Version 0
[2021-05-17 09:14:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 09:14:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 09:14:09] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2021-05-17 09:14:09] [INFO ] Transformed 322 places.
[2021-05-17 09:14:09] [INFO ] Transformed 480 transitions.
[2021-05-17 09:14:09] [INFO ] Parsed PT model containing 322 places and 480 transitions in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 09:14:09] [INFO ] Initial state test concluded for 4 properties.
FORMULA CANConstruction-PT-010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 252 transition count 340
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 252 transition count 340
Applied a total of 140 rules in 53 ms. Remains 252 /322 variables (removed 70) and now considering 340/480 (removed 140) transitions.
// Phase 1: matrix 340 rows 252 cols
[2021-05-17 09:14:09] [INFO ] Computed 21 place invariants in 17 ms
[2021-05-17 09:14:10] [INFO ] Implicit Places using invariants in 218 ms returned [12, 26, 40, 54, 82, 96, 110, 124, 138]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 245 ms to find 9 implicit places.
// Phase 1: matrix 340 rows 243 cols
[2021-05-17 09:14:10] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-17 09:14:10] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Starting structural reductions, iteration 1 : 243/322 places, 340/480 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 239 transition count 336
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 239 transition count 336
Applied a total of 8 rules in 19 ms. Remains 239 /243 variables (removed 4) and now considering 336/340 (removed 4) transitions.
// Phase 1: matrix 336 rows 239 cols
[2021-05-17 09:14:10] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 09:14:10] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 336 rows 239 cols
[2021-05-17 09:14:10] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 09:14:10] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:10] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 239/322 places, 336/480 transitions.
[2021-05-17 09:14:11] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 09:14:11] [INFO ] Flatten gal took : 64 ms
FORMULA CANConstruction-PT-010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 09:14:11] [INFO ] Flatten gal took : 25 ms
[2021-05-17 09:14:11] [INFO ] Input system was already deterministic with 336 transitions.
Incomplete random walk after 100000 steps, including 596 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 31) seen :26
Running SMT prover for 5 properties.
// Phase 1: matrix 336 rows 239 cols
[2021-05-17 09:14:11] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-17 09:14:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-17 09:14:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-17 09:14:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-17 09:14:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-17 09:14:11] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
[2021-05-17 09:14:11] [INFO ] Initial state test concluded for 1 properties.
FORMULA CANConstruction-PT-010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&X(!p0)))&&F((!p0 U (p1||G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 226 transition count 313
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 226 transition count 313
Applied a total of 26 rules in 10 ms. Remains 226 /239 variables (removed 13) and now considering 313/336 (removed 23) transitions.
// Phase 1: matrix 313 rows 226 cols
[2021-05-17 09:14:11] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:11] [INFO ] Implicit Places using invariants in 94 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
// Phase 1: matrix 313 rows 225 cols
[2021-05-17 09:14:11] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:14:12] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Starting structural reductions, iteration 1 : 225/239 places, 313/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 224 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 312
Applied a total of 2 rules in 12 ms. Remains 224 /225 variables (removed 1) and now considering 312/313 (removed 1) transitions.
// Phase 1: matrix 312 rows 224 cols
[2021-05-17 09:14:12] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:12] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 312 rows 224 cols
[2021-05-17 09:14:12] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-17 09:14:12] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:12] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 224/239 places, 312/336 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, true, (AND p0 (NOT p1)), p0]
Running random walk in product with property : CANConstruction-PT-010-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s48 s84), p1:(AND (GT 3 s102) (GT s48 s84))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 157 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-00 finished in 908 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X((p0&&X((X(F(p1))||G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 225 transition count 312
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 225 transition count 312
Applied a total of 28 rules in 11 ms. Remains 225 /239 variables (removed 14) and now considering 312/336 (removed 24) transitions.
// Phase 1: matrix 312 rows 225 cols
[2021-05-17 09:14:12] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 09:14:12] [INFO ] Implicit Places using invariants in 86 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
// Phase 1: matrix 312 rows 224 cols
[2021-05-17 09:14:12] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:12] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Starting structural reductions, iteration 1 : 224/239 places, 312/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 311
Applied a total of 2 rules in 16 ms. Remains 223 /224 variables (removed 1) and now considering 311/312 (removed 1) transitions.
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:14:12] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:13] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:14:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:13] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:13] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 223/239 places, 311/336 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 6}]], initial=7, aps=[p1:(GT s81 s176), p0:(GT s72 s34)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-02 finished in 957 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||((p1 U G(p2))&&X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 227 transition count 316
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 227 transition count 316
Applied a total of 24 rules in 9 ms. Remains 227 /239 variables (removed 12) and now considering 316/336 (removed 20) transitions.
// Phase 1: matrix 316 rows 227 cols
[2021-05-17 09:14:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:13] [INFO ] Implicit Places using invariants in 73 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
// Phase 1: matrix 316 rows 226 cols
[2021-05-17 09:14:13] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-17 09:14:13] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Starting structural reductions, iteration 1 : 226/239 places, 316/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 315
Applied a total of 2 rules in 5 ms. Remains 225 /226 variables (removed 1) and now considering 315/316 (removed 1) transitions.
// Phase 1: matrix 315 rows 225 cols
[2021-05-17 09:14:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:13] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 315 rows 225 cols
[2021-05-17 09:14:14] [INFO ] Computed 11 place invariants in 10 ms
[2021-05-17 09:14:14] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:14] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 225/239 places, 315/336 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-010-03 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p2 p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GT 1 s183), p1:(LEQ 1 s65), p0:(GT s147 s146)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 229 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-03 finished in 859 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0)))||(p1 U (p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 224 transition count 311
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 224 transition count 311
Applied a total of 30 rules in 8 ms. Remains 224 /239 variables (removed 15) and now considering 311/336 (removed 25) transitions.
// Phase 1: matrix 311 rows 224 cols
[2021-05-17 09:14:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:14] [INFO ] Implicit Places using invariants in 101 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:14:14] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:14] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Starting structural reductions, iteration 1 : 223/239 places, 311/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 4 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:14:14] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:14] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:14:14] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:14] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:15] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 222/239 places, 310/336 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (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 : CANConstruction-PT-010-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GT s146 s121), p2:(AND (GT s161 s62) (GT 1 s67)), p1:(GT 1 s67)], 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]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-04 finished in 823 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 239 transition count 270
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 173 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 172 transition count 269
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 134 place count 172 transition count 260
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 152 place count 163 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 163 place count 152 transition count 239
Iterating global reduction 3 with 11 rules applied. Total rules applied 174 place count 152 transition count 239
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 9 rules applied. Total rules applied 183 place count 152 transition count 230
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 192 place count 143 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 202 place count 138 transition count 225
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 222 place count 128 transition count 295
Applied a total of 222 rules in 53 ms. Remains 128 /239 variables (removed 111) and now considering 295/336 (removed 41) transitions.
// Phase 1: matrix 295 rows 128 cols
[2021-05-17 09:14:15] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 09:14:15] [INFO ] Implicit Places using invariants in 73 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
[2021-05-17 09:14:15] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 295 rows 127 cols
[2021-05-17 09:14:15] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:15] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Starting structural reductions, iteration 1 : 127/239 places, 295/336 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 293
Applied a total of 4 rules in 25 ms. Remains 125 /127 variables (removed 2) and now considering 293/295 (removed 2) transitions.
// Phase 1: matrix 293 rows 125 cols
[2021-05-17 09:14:15] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:15] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2021-05-17 09:14:15] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:15] [INFO ] State equation strengthened by 280 read => feed constraints.
[2021-05-17 09:14:15] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 125/239 places, 293/336 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s4 s32)], 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 55 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-05 finished in 697 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 225 transition count 313
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 225 transition count 313
Applied a total of 28 rules in 5 ms. Remains 225 /239 variables (removed 14) and now considering 313/336 (removed 23) transitions.
// Phase 1: matrix 313 rows 225 cols
[2021-05-17 09:14:16] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:16] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 313 rows 225 cols
[2021-05-17 09:14:16] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:16] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:16] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
// Phase 1: matrix 313 rows 225 cols
[2021-05-17 09:14:16] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:16] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 225/239 places, 313/336 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-010-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT s181 s60), p0:(LEQ s144 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 328 ms.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 222 ms.
Product exploration explored 100000 steps with 33333 reset in 276 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 225 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 225/225 places, 313/313 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 225 transition count 313
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 39 place count 225 transition count 321
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 225 transition count 321
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 207 transition count 303
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 207 transition count 303
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 122 place count 207 transition count 303
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 167 place count 162 transition count 258
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 212 place count 162 transition count 258
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -89
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 222 place count 162 transition count 347
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 222 rules in 42 ms. Remains 162 /225 variables (removed 63) and now considering 347/313 (removed -34) transitions.
[2021-05-17 09:14:18] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 347 rows 162 cols
[2021-05-17 09:14:18] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 09:14:18] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/225 places, 347/313 transitions.
Product exploration explored 100000 steps with 33333 reset in 715 ms.
Product exploration explored 100000 steps with 33333 reset in 658 ms.
[2021-05-17 09:14:19] [INFO ] Flatten gal took : 18 ms
[2021-05-17 09:14:19] [INFO ] Flatten gal took : 15 ms
[2021-05-17 09:14:19] [INFO ] Time to serialize gal into /tmp/LTL7658955196895548454.gal : 6 ms
[2021-05-17 09:14:19] [INFO ] Time to serialize properties into /tmp/LTL10453387765438890065.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/LTL7658955196895548454.gal, -t, CGAL, -LTL, /tmp/LTL10453387765438890065.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/LTL7658955196895548454.gal -t CGAL -LTL /tmp/LTL10453387765438890065.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(Node1requestsent2<=Node6ID2)")||(G("(Node5GiveAnswer1>Node4WaitAnswer)")))))))
Formula 0 simplified : !XXF("(Node1requestsent2<=Node6ID2)" | G"(Node5GiveAnswer1>Node4WaitAnswer)")
Detected timeout of ITS tools.
[2021-05-17 09:14:34] [INFO ] Flatten gal took : 20 ms
[2021-05-17 09:14:34] [INFO ] Applying decomposition
[2021-05-17 09:14:34] [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/graph11193549749862483099.txt, -o, /tmp/graph11193549749862483099.bin, -w, /tmp/graph11193549749862483099.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/graph11193549749862483099.bin, -l, -1, -v, -w, /tmp/graph11193549749862483099.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:14:34] [INFO ] Decomposing Gal with order
[2021-05-17 09:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:14:34] [INFO ] Removed a total of 190 redundant transitions.
[2021-05-17 09:14:34] [INFO ] Flatten gal took : 58 ms
[2021-05-17 09:14:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 9 ms.
[2021-05-17 09:14:35] [INFO ] Time to serialize gal into /tmp/LTL9097229140112539052.gal : 6 ms
[2021-05-17 09:14:35] [INFO ] Time to serialize properties into /tmp/LTL10265430523570108507.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/LTL9097229140112539052.gal, -t, CGAL, -LTL, /tmp/LTL10265430523570108507.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/LTL9097229140112539052.gal -t CGAL -LTL /tmp/LTL10265430523570108507.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(gu41.Node1requestsent2<=gu41.Node6ID2)")||(G("(gu42.Node5GiveAnswer1>gu42.Node4WaitAnswer)")))))))
Formula 0 simplified : !XXF("(gu41.Node1requestsent2<=gu41.Node6ID2)" | G"(gu42.Node5GiveAnswer1>gu42.Node4WaitAnswer)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14639234293916533438
[2021-05-17 09:14:50] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14639234293916533438
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/ltsmin14639234293916533438]
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/ltsmin14639234293916533438] 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/ltsmin14639234293916533438] 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 CANConstruction-PT-010-10 finished in 35098 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||G(p1)||X(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 225 transition count 312
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 225 transition count 312
Applied a total of 28 rules in 4 ms. Remains 225 /239 variables (removed 14) and now considering 312/336 (removed 24) transitions.
// Phase 1: matrix 312 rows 225 cols
[2021-05-17 09:14:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:51] [INFO ] Implicit Places using invariants in 115 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
// Phase 1: matrix 312 rows 224 cols
[2021-05-17 09:14:51] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:51] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Starting structural reductions, iteration 1 : 224/239 places, 312/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 311
Applied a total of 2 rules in 5 ms. Remains 223 /224 variables (removed 1) and now considering 311/312 (removed 1) transitions.
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:14:51] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:51] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:14:51] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:14:51] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:51] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 223/239 places, 311/336 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-11 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: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (GT s165 s125) (GT s214 s113)), p1:(LEQ s214 s113), p2:(LEQ s165 s125)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3384 steps with 19 reset in 12 ms.
FORMULA CANConstruction-PT-010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-11 finished in 1025 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0||X(p1)))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 228 transition count 317
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 228 transition count 317
Applied a total of 22 rules in 4 ms. Remains 228 /239 variables (removed 11) and now considering 317/336 (removed 19) transitions.
// Phase 1: matrix 317 rows 228 cols
[2021-05-17 09:14:52] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:52] [INFO ] Implicit Places using invariants in 76 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
// Phase 1: matrix 317 rows 227 cols
[2021-05-17 09:14:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:52] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Starting structural reductions, iteration 1 : 227/239 places, 317/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 226 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 316
Applied a total of 2 rules in 4 ms. Remains 226 /227 variables (removed 1) and now considering 316/317 (removed 1) transitions.
// Phase 1: matrix 316 rows 226 cols
[2021-05-17 09:14:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:52] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 316 rows 226 cols
[2021-05-17 09:14:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:52] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:52] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 226/239 places, 316/336 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-010-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LEQ s5 s214) (LEQ 2 s176)), p0:(LEQ s149 s16), p1:(LEQ 1 s102)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 324 ms.
Knowledge obtained : [p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Support contains 6 out of 226 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 226/226 places, 316/316 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 226 transition count 316
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 42 place count 226 transition count 316
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 226 transition count 316
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 206 transition count 296
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 206 transition count 296
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 127 place count 206 transition count 296
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 172 place count 161 transition count 251
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 217 place count 161 transition count 251
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 227 place count 161 transition count 339
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 227 rules in 29 ms. Remains 161 /226 variables (removed 65) and now considering 339/316 (removed -23) transitions.
[2021-05-17 09:14:54] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 339 rows 161 cols
[2021-05-17 09:14:54] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:54] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 1 iterations. Remains : 161/226 places, 339/316 transitions.
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 332 ms.
[2021-05-17 09:14:55] [INFO ] Flatten gal took : 13 ms
[2021-05-17 09:14:55] [INFO ] Flatten gal took : 13 ms
[2021-05-17 09:14:55] [INFO ] Time to serialize gal into /tmp/LTL16279736851886779664.gal : 2 ms
[2021-05-17 09:14:55] [INFO ] Time to serialize properties into /tmp/LTL8493236751243920022.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/LTL16279736851886779664.gal, -t, CGAL, -LTL, /tmp/LTL8493236751243920022.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/LTL16279736851886779664.gal -t CGAL -LTL /tmp/LTL8493236751243920022.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(("(Node1GiveAnswer6<=Node1DHTinfo)")||(X("(Node8ResZone>=1)"))))&&(F("((Node0ResZone<=Node8requestsent6)||(Node4GiveAnswer5>=2))"))))
Formula 0 simplified : !(X("(Node1GiveAnswer6<=Node1DHTinfo)" | X"(Node8ResZone>=1)") & F"((Node0ResZone<=Node8requestsent6)||(Node4GiveAnswer5>=2))")
Detected timeout of ITS tools.
[2021-05-17 09:15:10] [INFO ] Flatten gal took : 13 ms
[2021-05-17 09:15:10] [INFO ] Applying decomposition
[2021-05-17 09:15:10] [INFO ] Flatten gal took : 12 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/graph15369668269621663266.txt, -o, /tmp/graph15369668269621663266.bin, -w, /tmp/graph15369668269621663266.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/graph15369668269621663266.bin, -l, -1, -v, -w, /tmp/graph15369668269621663266.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:15:10] [INFO ] Decomposing Gal with order
[2021-05-17 09:15:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:15:10] [INFO ] Removed a total of 189 redundant transitions.
[2021-05-17 09:15:10] [INFO ] Flatten gal took : 31 ms
[2021-05-17 09:15:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 6 ms.
[2021-05-17 09:15:10] [INFO ] Time to serialize gal into /tmp/LTL11004041717552285706.gal : 3 ms
[2021-05-17 09:15:10] [INFO ] Time to serialize properties into /tmp/LTL8013260931981991437.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/LTL11004041717552285706.gal, -t, CGAL, -LTL, /tmp/LTL8013260931981991437.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/LTL11004041717552285706.gal -t CGAL -LTL /tmp/LTL8013260931981991437.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(("(gu6.Node1GiveAnswer6<=gu6.Node1DHTinfo)")||(X("(gi2.gi2.gu38.Node8ResZone>=1)"))))&&(F("((gu1.Node0ResZone<=gu1.Node8requestsent6)||(gi2.gi2.gu27.Node4GiveAnswer5>=2))"))))
Formula 0 simplified : !(X("(gu6.Node1GiveAnswer6<=gu6.Node1DHTinfo)" | X"(gi2.gi2.gu38.Node8ResZone>=1)") & F"((gu1.Node0ResZone<=gu1.Node8requestsent6)||(gi2.gi2.gu27.Node4GiveAnswer5>=2))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11899909025675948434
[2021-05-17 09:15:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11899909025675948434
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/ltsmin11899909025675948434]
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/ltsmin11899909025675948434] 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/ltsmin11899909025675948434] 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 CANConstruction-PT-010-12 finished in 34310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 226 transition count 314
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 226 transition count 314
Applied a total of 26 rules in 24 ms. Remains 226 /239 variables (removed 13) and now considering 314/336 (removed 22) transitions.
// Phase 1: matrix 314 rows 226 cols
[2021-05-17 09:15:26] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:15:26] [INFO ] Implicit Places using invariants in 217 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 219 ms to find 1 implicit places.
// Phase 1: matrix 314 rows 225 cols
[2021-05-17 09:15:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:26] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Starting structural reductions, iteration 1 : 225/239 places, 314/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 224 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 313
Applied a total of 2 rules in 4 ms. Remains 224 /225 variables (removed 1) and now considering 313/314 (removed 1) transitions.
// Phase 1: matrix 313 rows 224 cols
[2021-05-17 09:15:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:26] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 313 rows 224 cols
[2021-05-17 09:15:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:27] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:15:27] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 224/239 places, 313/336 transitions.
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s110 s100), p1:(GT s188 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 166 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-14 finished in 872 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 239/239 places, 336/336 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 225 transition count 312
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 225 transition count 312
Applied a total of 28 rules in 3 ms. Remains 225 /239 variables (removed 14) and now considering 312/336 (removed 24) transitions.
// Phase 1: matrix 312 rows 225 cols
[2021-05-17 09:15:27] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:15:27] [INFO ] Implicit Places using invariants in 97 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
// Phase 1: matrix 312 rows 224 cols
[2021-05-17 09:15:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:27] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Starting structural reductions, iteration 1 : 224/239 places, 312/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 311
Applied a total of 2 rules in 3 ms. Remains 223 /224 variables (removed 1) and now considering 311/312 (removed 1) transitions.
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:15:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:27] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:15:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:27] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:15:28] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 223/239 places, 311/336 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s72 s217), p1:(LEQ s170 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 223 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 223/223 places, 311/311 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 223 transition count 311
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 40 place count 223 transition count 311
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 223 transition count 311
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 71 place count 203 transition count 291
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 91 place count 203 transition count 291
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 128 place count 203 transition count 291
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 174 place count 157 transition count 245
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 220 place count 157 transition count 245
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 230 place count 157 transition count 335
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 230 rules in 21 ms. Remains 157 /223 variables (removed 66) and now considering 335/311 (removed -24) transitions.
[2021-05-17 09:15:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 335 rows 157 cols
[2021-05-17 09:15:29] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 09:15:29] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 157/223 places, 335/311 transitions.
Product exploration explored 100000 steps with 50000 reset in 845 ms.
Product exploration explored 100000 steps with 50000 reset in 868 ms.
[2021-05-17 09:15:31] [INFO ] Flatten gal took : 12 ms
[2021-05-17 09:15:31] [INFO ] Flatten gal took : 12 ms
[2021-05-17 09:15:31] [INFO ] Time to serialize gal into /tmp/LTL1933214818345355416.gal : 1 ms
[2021-05-17 09:15:31] [INFO ] Time to serialize properties into /tmp/LTL4424404213946676587.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/LTL1933214818345355416.gal, -t, CGAL, -LTL, /tmp/LTL4424404213946676587.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/LTL1933214818345355416.gal -t CGAL -LTL /tmp/LTL4424404213946676587.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node5Request<=Node9requestsent3)")||(G(F("(Node4requestsent1<=Node0ResZone)")))))))
Formula 0 simplified : !XF("(Node5Request<=Node9requestsent3)" | GF"(Node4requestsent1<=Node0ResZone)")
Detected timeout of ITS tools.
[2021-05-17 09:15:46] [INFO ] Flatten gal took : 27 ms
[2021-05-17 09:15:46] [INFO ] Applying decomposition
[2021-05-17 09:15:46] [INFO ] Flatten gal took : 20 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/graph5261491938764586221.txt, -o, /tmp/graph5261491938764586221.bin, -w, /tmp/graph5261491938764586221.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/graph5261491938764586221.bin, -l, -1, -v, -w, /tmp/graph5261491938764586221.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:15:46] [INFO ] Decomposing Gal with order
[2021-05-17 09:15:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:15:46] [INFO ] Removed a total of 192 redundant transitions.
[2021-05-17 09:15:46] [INFO ] Flatten gal took : 21 ms
[2021-05-17 09:15:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 8 ms.
[2021-05-17 09:15:46] [INFO ] Time to serialize gal into /tmp/LTL718320660809897173.gal : 2 ms
[2021-05-17 09:15:46] [INFO ] Time to serialize properties into /tmp/LTL9078075237462055461.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/LTL718320660809897173.gal, -t, CGAL, -LTL, /tmp/LTL9078075237462055461.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/LTL718320660809897173.gal -t CGAL -LTL /tmp/LTL9078075237462055461.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gu44.Node5Request<=gu44.Node9requestsent3)")||(G(F("(gu43.Node4requestsent1<=gu43.Node0ResZone)")))))))
Formula 0 simplified : !XF("(gu44.Node5Request<=gu44.Node9requestsent3)" | GF"(gu43.Node4requestsent1<=gu43.Node0ResZone)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2238154111662610785
[2021-05-17 09:16:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2238154111662610785
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/ltsmin2238154111662610785]
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/ltsmin2238154111662610785] 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/ltsmin2238154111662610785] 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 CANConstruction-PT-010-15 finished in 35109 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-17 09:16:02] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin17901193149941765694
[2021-05-17 09:16:02] [INFO ] Computing symmetric may disable matrix : 336 transitions.
[2021-05-17 09:16:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:16:02] [INFO ] Computing symmetric may enable matrix : 336 transitions.
[2021-05-17 09:16:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:16:02] [INFO ] Flatten gal took : 34 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/graph1021837283670115843.txt, -o, /tmp/graph1021837283670115843.bin, -w, /tmp/graph1021837283670115843.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/graph1021837283670115843.bin, -l, -1, -v, -w, /tmp/graph1021837283670115843.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:16:02] [INFO ] Decomposing Gal with order
[2021-05-17 09:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:16:02] [INFO ] Computing Do-Not-Accords matrix : 336 transitions.
[2021-05-17 09:16:02] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:16:02] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17901193149941765694
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/ltsmin17901193149941765694]
[2021-05-17 09:16:02] [INFO ] Removed a total of 228 redundant transitions.
[2021-05-17 09:16:02] [INFO ] Flatten gal took : 77 ms
[2021-05-17 09:16:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 27 ms.
[2021-05-17 09:16:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality17089445436590521155.gal : 15 ms
[2021-05-17 09:16:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality9352993234835243663.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/LTLCardinality17089445436590521155.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9352993234835243663.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/LTLCardinality17089445436590521155.gal -t CGAL -LTL /tmp/LTLCardinality9352993234835243663.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((X(X(F((("(gu38.Node1requestsent2<=gu38.Node6ID2)")||(("(gu61.Node7requestsent6<=gu61.Node8NOshare)")&&(F("(gi1.gi0.gi2.gu34.Node8GiveAnswer5>=3)"))))||(G("(gu60.Node5GiveAnswer1>gu60.Node4WaitAnswer)")))))))
Formula 0 simplified : !XXF("(gu38.Node1requestsent2<=gu38.Node6ID2)" | ("(gu61.Node7requestsent6<=gu61.Node8NOshare)" & F"(gi1.gi0.gi2.gu34.Node8GiveAnswer5>=3)") | G"(gu60.Node5GiveAnswer1>gu60.Node4WaitAnswer)")
Compilation finished in 1749 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17901193149941765694]
Link finished in 72 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(<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17901193149941765694]
LTSmin run took 503 ms.
FORMULA CANConstruction-PT-010-10 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, --when, --ltl, (X(((LTLAPp2==true)||X((LTLAPp3==true))))&&<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin17901193149941765694]
LTSmin run took 327 ms.
FORMULA CANConstruction-PT-010-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, --when, --ltl, X(<>(((LTLAPp5==true)||[](<>((LTLAPp6==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17901193149941765694]
LTSmin run took 428 ms.
FORMULA CANConstruction-PT-010-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621242966698

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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