Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416400821.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ResAllocation-PT-R100C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416400821
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 422K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621267128917

Running Version 0
[2021-05-17 15:58:51] [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 15:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:58:51] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-17 15:58:51] [INFO ] Transformed 400 places.
[2021-05-17 15:58:51] [INFO ] Transformed 202 transitions.
[2021-05-17 15:58:51] [INFO ] Parsed PT model containing 400 places and 202 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:58:51] [INFO ] Initial state test concluded for 2 properties.
Support contains 76 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 57 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2021-05-17 15:58:51] [INFO ] Computed 200 place invariants in 17 ms
[2021-05-17 15:58:52] [INFO ] Implicit Places using invariants in 569 ms returned [201, 203, 205, 207, 209, 213, 217, 221, 223, 225, 227, 229, 231, 235, 239, 241, 243, 245, 247, 249, 251, 253, 255, 259, 261, 263, 265, 267, 269, 271, 273, 275, 279, 281, 283, 285, 291, 293, 295, 297, 299, 301, 303, 305, 307, 309, 311, 313, 315, 319, 321, 323, 327, 329, 331, 335, 337, 339, 341, 343, 345, 347, 349, 353, 359, 363, 367, 369, 371, 373, 375, 377, 381, 383, 385, 387, 389, 391, 393, 395, 397, 399]
Discarding 82 places :
Implicit Place search using SMT only with invariants took 603 ms to find 82 implicit places.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 15:58:52] [INFO ] Computed 118 place invariants in 6 ms
[2021-05-17 15:58:52] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 318/400 places, 202/202 transitions.
Applied a total of 0 rules in 11 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 15:58:52] [INFO ] Computed 118 place invariants in 2 ms
[2021-05-17 15:58:52] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 2 iterations. Remains : 318/400 places, 202/202 transitions.
[2021-05-17 15:58:52] [INFO ] Flatten gal took : 41 ms
[2021-05-17 15:58:52] [INFO ] Flatten gal took : 19 ms
[2021-05-17 15:58:52] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 100000 steps, including 38 resets, run finished after 492 ms. (steps per millisecond=203 ) properties (out of 28) seen :20
Running SMT prover for 8 properties.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 15:58:53] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 15:58:53] [INFO ] [Real]Absence check using 118 positive place invariants in 27 ms returned sat
[2021-05-17 15:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:53] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-17 15:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:58:53] [INFO ] [Nat]Absence check using 118 positive place invariants in 19 ms returned sat
[2021-05-17 15:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:53] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-17 15:58:53] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-17 15:58:54] [INFO ] Added : 98 causal constraints over 20 iterations in 341 ms. Result :sat
[2021-05-17 15:58:54] [INFO ] [Real]Absence check using 118 positive place invariants in 18 ms returned sat
[2021-05-17 15:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:54] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-17 15:58:54] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 15:58:54] [INFO ] Added : 97 causal constraints over 20 iterations in 311 ms. Result :sat
[2021-05-17 15:58:54] [INFO ] [Real]Absence check using 118 positive place invariants in 17 ms returned sat
[2021-05-17 15:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:54] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-17 15:58:54] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 15:58:54] [INFO ] Added : 97 causal constraints over 20 iterations in 250 ms. Result :sat
[2021-05-17 15:58:54] [INFO ] [Real]Absence check using 118 positive place invariants in 12 ms returned sat
[2021-05-17 15:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:55] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 15:58:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
[2021-05-17 15:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-17 15:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:58:55] [INFO ] [Nat]Absence check using 118 positive place invariants in 13 ms returned sat
[2021-05-17 15:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:55] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-17 15:58:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2021-05-17 15:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-17 15:58:55] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 15:58:55] [INFO ] Added : 148 causal constraints over 30 iterations in 312 ms. Result :sat
[2021-05-17 15:58:55] [INFO ] [Real]Absence check using 118 positive place invariants in 18 ms returned sat
[2021-05-17 15:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:55] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-17 15:58:55] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 15:58:55] [INFO ] Added : 97 causal constraints over 20 iterations in 238 ms. Result :sat
[2021-05-17 15:58:55] [INFO ] [Real]Absence check using 118 positive place invariants in 13 ms returned sat
[2021-05-17 15:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:56] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-17 15:58:56] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 15:58:56] [INFO ] Added : 98 causal constraints over 20 iterations in 230 ms. Result :sat
[2021-05-17 15:58:56] [INFO ] [Real]Absence check using 118 positive place invariants in 11 ms returned sat
[2021-05-17 15:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:56] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-17 15:58:56] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 15:58:56] [INFO ] Added : 92 causal constraints over 19 iterations in 222 ms. Result :sat
[2021-05-17 15:58:56] [INFO ] [Real]Absence check using 118 positive place invariants in 12 ms returned sat
[2021-05-17 15:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:58:56] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-17 15:58:56] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 15:58:57] [INFO ] Added : 185 causal constraints over 37 iterations in 467 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p0)&&X(F(p1))) U X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 15:58:57] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 15:58:57] [INFO ] Implicit Places using invariants in 141 ms returned [206, 209, 212, 220, 223, 234, 245, 251, 253, 273, 278, 288, 291, 293, 296, 299, 307]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 143 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 15:58:57] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 15:58:57] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 15:58:57] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-17 15:58:57] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s52 1) (LT s55 1)), p0:(AND (GEQ s117 1) (GEQ s259 1) (GEQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25045 reset in 314 ms.
Product exploration explored 100000 steps with 24948 reset in 268 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 25084 reset in 229 ms.
Product exploration explored 100000 steps with 24964 reset in 277 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 301 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 301/301 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 301 transition count 202
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 27 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2021-05-17 15:58:59] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 15:58:59] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 15:58:59] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 202/202 transitions.
Product exploration explored 100000 steps with 24991 reset in 264 ms.
Product exploration explored 100000 steps with 25009 reset in 264 ms.
[2021-05-17 15:59:00] [INFO ] Flatten gal took : 14 ms
[2021-05-17 15:59:00] [INFO ] Flatten gal took : 13 ms
[2021-05-17 15:59:00] [INFO ] Time to serialize gal into /tmp/LTL12311808651868039753.gal : 4 ms
[2021-05-17 15:59:00] [INFO ] Time to serialize properties into /tmp/LTL17366642767945670731.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/LTL12311808651868039753.gal, -t, CGAL, -LTL, /tmp/LTL17366642767945670731.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/LTL12311808651868039753.gal -t CGAL -LTL /tmp/LTL17366642767945670731.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((F("(((r_0_58>=1)&&(r_1_58>=1))&&(p_1_59>=1))"))&&(X(F("((p_0_26<1)||(r_0_27<1))"))))U(X(X(G("(((r_0_58>=1)&&(r_1_58>=1))&&(p_1_59>=1))")))))))
Formula 0 simplified : !X((F"(((r_0_58>=1)&&(r_1_58>=1))&&(p_1_59>=1))" & XF"((p_0_26<1)||(r_0_27<1))") U XXG"(((r_0_58>=1)&&(r_1_58>=1))&&(p_1_59>=1))")
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2021-05-17 15:59:15] [INFO ] Flatten gal took : 26 ms
[2021-05-17 15:59:15] [INFO ] Applying decomposition
[2021-05-17 15:59:15] [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/graph1864830904989937084.txt, -o, /tmp/graph1864830904989937084.bin, -w, /tmp/graph1864830904989937084.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/graph1864830904989937084.bin, -l, -1, -v, -w, /tmp/graph1864830904989937084.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:59:15] [INFO ] Decomposing Gal with order
[2021-05-17 15:59:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:59:15] [INFO ] Flatten gal took : 58 ms
[2021-05-17 15:59:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 15:59:15] [INFO ] Time to serialize gal into /tmp/LTL6415902224892981069.gal : 7 ms
[2021-05-17 15:59:15] [INFO ] Time to serialize properties into /tmp/LTL1885161378632317147.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/LTL6415902224892981069.gal, -t, CGAL, -LTL, /tmp/LTL1885161378632317147.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/LTL6415902224892981069.gal -t CGAL -LTL /tmp/LTL1885161378632317147.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((F("(((i8.u58.r_0_58>=1)&&(i8.u100.r_1_58>=1))&&(i8.u59.p_1_59>=1))"))&&(X(F("((i4.u26.p_0_26<1)||(i4.u27.r_0_27<1))"))))U(X(X(G("(((i8.u58.r_0_58>=1)&&(i8.u100.r_1_58>=1))&&(i8.u59.p_1_59>=1))")))))))
Formula 0 simplified : !X((F"(((i8.u58.r_0_58>=1)&&(i8.u100.r_1_58>=1))&&(i8.u59.p_1_59>=1))" & XF"((i4.u26.p_0_26<1)||(i4.u27.r_0_27<1))") U XXG"(((i8.u58.r_0_58>=1)&&(i8.u100.r_1_58>=1))&&(i8.u59.p_1_59>=1))")
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i13.u99.t100, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2544228489042787681
[2021-05-17 15:59:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2544228489042787681
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/ltsmin2544228489042787681]
Compilation finished in 916 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2544228489042787681]
Link finished in 65 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((<>((LTLAPp0==true))&&X(<>((LTLAPp1==true)))) U X(X([]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2544228489042787681]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-00 finished in 48413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 316 transition count 200
Applied a total of 4 rules in 23 ms. Remains 316 /318 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 316 cols
[2021-05-17 15:59:45] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 15:59:45] [INFO ] Implicit Places using invariants in 151 ms returned [204, 207, 210, 218, 221, 243, 249, 251, 266, 271, 276, 286, 291, 294, 297, 305]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 152 ms to find 16 implicit places.
[2021-05-17 15:59:45] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 200 rows 300 cols
[2021-05-17 15:59:45] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:59:45] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Starting structural reductions, iteration 1 : 300/318 places, 200/202 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2021-05-17 15:59:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 200 rows 300 cols
[2021-05-17 15:59:45] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:59:46] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 2 iterations. Remains : 300/318 places, 200/202 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s80 1) (LT s83 1)), p0:(OR (LT s57 1) (LT s227 1) (LT s228 1) (AND (GEQ s155 1) (GEQ s277 1) (GEQ s278 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 38 reset in 349 ms.
Product exploration explored 100000 steps with 38 reset in 383 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 38 reset in 453 ms.
Product exploration explored 100000 steps with 38 reset in 429 ms.
[2021-05-17 15:59:47] [INFO ] Flatten gal took : 11 ms
[2021-05-17 15:59:47] [INFO ] Flatten gal took : 9 ms
[2021-05-17 15:59:47] [INFO ] Time to serialize gal into /tmp/LTL6280523131555528271.gal : 2 ms
[2021-05-17 15:59:47] [INFO ] Time to serialize properties into /tmp/LTL5025809094805055179.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/LTL6280523131555528271.gal, -t, CGAL, -LTL, /tmp/LTL5025809094805055179.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/LTL6280523131555528271.gal -t CGAL -LTL /tmp/LTL5025809094805055179.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((("(((r_0_28<1)||(r_1_28<1))||(p_1_29<1))")||(G("((p_0_40<1)||(r_0_41<1))")))||("(((r_0_77>=1)&&(r_1_77>=1))&&(p_1_78>=1))")))))
Formula 0 simplified : !GF("(((r_0_28<1)||(r_1_28<1))||(p_1_29<1))" | "(((r_0_77>=1)&&(r_1_77>=1))&&(p_1_78>=1))" | G"((p_0_40<1)||(r_0_41<1))")
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/198/2/200
Computing Next relation with stutter on 99 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
178 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,1.82701,62468,1,0,413,310368,432,206,9684,184554,417
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R100C002-01 finished in 4355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1)||G(p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 15:59:50] [INFO ] Computed 118 place invariants in 2 ms
[2021-05-17 15:59:50] [INFO ] Implicit Places using invariants in 207 ms returned [206, 209, 212, 220, 223, 245, 251, 253, 268, 273, 278, 288, 291, 293, 296, 299, 307]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 211 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 15:59:50] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 15:59:50] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 15:59:50] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 15:59:50] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s58 1) (GEQ s61 1)), p2:(OR (LT s57 1) (LT s229 1) (LT s230 1)), p0:(AND (GEQ s86 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 380 reset in 439 ms.
Product exploration explored 100000 steps with 369 reset in 403 ms.
Knowledge obtained : [(NOT p1), p2, (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 374 reset in 316 ms.
Product exploration explored 100000 steps with 386 reset in 335 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 7 out of 301 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 301/301 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 301 transition count 202
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 27 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2021-05-17 15:59:52] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 15:59:52] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 15:59:52] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 202/202 transitions.
Product exploration explored 100000 steps with 386 reset in 559 ms.
Product exploration explored 100000 steps with 378 reset in 468 ms.
[2021-05-17 15:59:53] [INFO ] Flatten gal took : 11 ms
[2021-05-17 15:59:54] [INFO ] Flatten gal took : 10 ms
[2021-05-17 15:59:54] [INFO ] Time to serialize gal into /tmp/LTL13743143692214438166.gal : 2 ms
[2021-05-17 15:59:54] [INFO ] Time to serialize properties into /tmp/LTL4974120562589210372.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/LTL13743143692214438166.gal, -t, CGAL, -LTL, /tmp/LTL4974120562589210372.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/LTL13743143692214438166.gal -t CGAL -LTL /tmp/LTL4974120562589210372.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((F("((p_0_29>=1)&&(r_0_30>=1))"))||(G("(((r_0_28<1)||(r_1_28<1))||(p_1_29<1))")))||("((p_0_43>=1)&&(r_0_44>=1))"))))
Formula 0 simplified : !X("((p_0_43>=1)&&(r_0_44>=1))" | F"((p_0_29>=1)&&(r_0_30>=1))" | G"(((r_0_28<1)||(r_1_28<1))||(p_1_29<1))")
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2021-05-17 16:00:09] [INFO ] Flatten gal took : 25 ms
[2021-05-17 16:00:09] [INFO ] Applying decomposition
[2021-05-17 16:00:09] [INFO ] Flatten gal took : 19 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/graph293480704921932462.txt, -o, /tmp/graph293480704921932462.bin, -w, /tmp/graph293480704921932462.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/graph293480704921932462.bin, -l, -1, -v, -w, /tmp/graph293480704921932462.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:00:09] [INFO ] Decomposing Gal with order
[2021-05-17 16:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:00:09] [INFO ] Flatten gal took : 25 ms
[2021-05-17 16:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 16:00:09] [INFO ] Time to serialize gal into /tmp/LTL6172469295320915086.gal : 5 ms
[2021-05-17 16:00:09] [INFO ] Time to serialize properties into /tmp/LTL11951132907638733236.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/LTL6172469295320915086.gal, -t, CGAL, -LTL, /tmp/LTL11951132907638733236.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/LTL6172469295320915086.gal -t CGAL -LTL /tmp/LTL11951132907638733236.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((F("((i4.u29.p_0_29>=1)&&(i4.u30.r_0_30>=1))"))||(G("(((i4.u28.r_0_28<1)||(i4.u100.r_1_28<1))||(i4.u29.p_1_29<1))")))||("((i6.u43.p_0_43>=1)&&(i6.u44.r_0_44>=1))"))))
Formula 0 simplified : !X("((i6.u43.p_0_43>=1)&&(i6.u44.r_0_44>=1))" | F"((i4.u29.p_0_29>=1)&&(i4.u30.r_0_30>=1))" | G"(((i4.u28.r_0_28<1)||(i4.u100.r_1_28<1))||(i4.u29.p_1_29<1))")
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i14.u99.t100, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
88 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,0.919187,38448,1,0,55906,53,1616,70222,87,81,71352
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-02 finished in 20214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p0&&(!p0||G(F(p1)))) U (G((p0&&(!p0||G(F(p1)))))||((!p0||G(F(p1)))&&p2))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:10] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:10] [INFO ] Implicit Places using invariants in 193 ms returned [206, 209, 212, 220, 223, 234, 245, 251, 253, 268, 273, 278, 288, 291, 299, 307]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 198 ms to find 16 implicit places.
// Phase 1: matrix 202 rows 302 cols
[2021-05-17 16:00:10] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 16:00:10] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Starting structural reductions, iteration 1 : 302/318 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 302 cols
[2021-05-17 16:00:10] [INFO ] Computed 102 place invariants in 3 ms
[2021-05-17 16:00:10] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 2 iterations. Remains : 302/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : ResAllocation-PT-R100C002-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (LT s52 1) (LT s55 1)) (OR (LT s157 1) (LT s279 1) (LT s280 1))), p0:(OR (LT s52 1) (LT s55 1)), p1:(OR (LT s161 1) (LT s282 1) (LT s283 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 706 reset in 426 ms.
Product exploration explored 100000 steps with 697 reset in 373 ms.
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Product exploration explored 100000 steps with 704 reset in 396 ms.
Product exploration explored 100000 steps with 711 reset in 373 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Support contains 8 out of 302 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 302/302 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 202
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 19 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2021-05-17 16:00:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 202 rows 302 cols
[2021-05-17 16:00:13] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 16:00:13] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 302/302 places, 202/202 transitions.
Product exploration explored 100000 steps with 709 reset in 485 ms.
Product exploration explored 100000 steps with 693 reset in 416 ms.
[2021-05-17 16:00:14] [INFO ] Flatten gal took : 10 ms
[2021-05-17 16:00:14] [INFO ] Flatten gal took : 9 ms
[2021-05-17 16:00:14] [INFO ] Time to serialize gal into /tmp/LTL6865092268204759602.gal : 1 ms
[2021-05-17 16:00:14] [INFO ] Time to serialize properties into /tmp/LTL14089957775342666988.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/LTL6865092268204759602.gal, -t, CGAL, -LTL, /tmp/LTL14089957775342666988.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/LTL6865092268204759602.gal -t CGAL -LTL /tmp/LTL14089957775342666988.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((("((p_0_26<1)||(r_0_27<1))")&&((G(F("(((r_0_80<1)||(r_1_80<1))||(p_1_81<1))")))||("((p_0_26>=1)&&(r_0_27>=1))")))U((G(("((p_0_26<1)||(r_0_27<1))")&&(("((p_0_26>=1)&&(r_0_27>=1))")||(G(F("(((r_0_80<1)||(r_1_80<1))||(p_1_81<1))"))))))||(("(((p_0_26<1)||(r_0_27<1))&&(((r_0_78<1)||(r_1_78<1))||(p_1_79<1)))")&&((G(F("(((r_0_80<1)||(r_1_80<1))||(p_1_81<1))")))||("((p_0_26>=1)&&(r_0_27>=1))"))))))))
Formula 0 simplified : !XF(("((p_0_26<1)||(r_0_27<1))" & ("((p_0_26>=1)&&(r_0_27>=1))" | GF"(((r_0_80<1)||(r_1_80<1))||(p_1_81<1))")) U (G("((p_0_26<1)||(r_0_27<1))" & ("((p_0_26>=1)&&(r_0_27>=1))" | GF"(((r_0_80<1)||(r_1_80<1))||(p_1_81<1))")) | ("(((p_0_26<1)||(r_0_27<1))&&(((r_0_78<1)||(r_1_78<1))||(p_1_79<1)))" & ("((p_0_26>=1)&&(r_0_27>=1))" | GF"(((r_0_80<1)||(r_1_80<1))||(p_1_81<1))"))))
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2021-05-17 16:00:29] [INFO ] Flatten gal took : 28 ms
[2021-05-17 16:00:29] [INFO ] Applying decomposition
[2021-05-17 16:00:29] [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/graph13045209284312114112.txt, -o, /tmp/graph13045209284312114112.bin, -w, /tmp/graph13045209284312114112.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/graph13045209284312114112.bin, -l, -1, -v, -w, /tmp/graph13045209284312114112.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:00:29] [INFO ] Decomposing Gal with order
[2021-05-17 16:00:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:00:29] [INFO ] Flatten gal took : 22 ms
[2021-05-17 16:00:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 16:00:29] [INFO ] Time to serialize gal into /tmp/LTL5092209320130153242.gal : 4 ms
[2021-05-17 16:00:29] [INFO ] Time to serialize properties into /tmp/LTL14593198420697837988.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5092209320130153242.gal, -t, CGAL, -LTL, /tmp/LTL14593198420697837988.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/LTL5092209320130153242.gal -t CGAL -LTL /tmp/LTL14593198420697837988.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((("((i4.i0.i1.u26.p_0_26<1)||(i4.i0.i1.u27.r_0_27<1))")&&((G(F("(((i11.u80.r_0_80<1)||(i11.u101.r_1_80<1))||(i12.i0.i0.u81.p_1_81<1))")))||("((i4.i0.i1.u26.p_0_26>=1)&&(i4.i0.i1.u27.r_0_27>=1))")))U((G(("((i4.i0.i1.u26.p_0_26<1)||(i4.i0.i1.u27.r_0_27<1))")&&(("((i4.i0.i1.u26.p_0_26>=1)&&(i4.i0.i1.u27.r_0_27>=1))")||(G(F("(((i11.u80.r_0_80<1)||(i11.u101.r_1_80<1))||(i12.i0.i0.u81.p_1_81<1))"))))))||(("(((i4.i0.i1.u26.p_0_26<1)||(i4.i0.i1.u27.r_0_27<1))&&(((i11.u78.r_0_78<1)||(i11.u100.r_1_78<1))||(i11.u79.p_1_79<1)))")&&((G(F("(((i11.u80.r_0_80<1)||(i11.u101.r_1_80<1))||(i12.i0.i0.u81.p_1_81<1))")))||("((i4.i0.i1.u26.p_0_26>=1)&&(i4.i0.i1.u27.r_0_27>=1))"))))))))
Formula 0 simplified : !XF(("((i4.i0.i1.u26.p_0_26<1)||(i4.i0.i1.u27.r_0_27<1))" & ("((i4.i0.i1.u26.p_0_26>=1)&&(i4.i0.i1.u27.r_0_27>=1))" | GF"(((i11.u80.r_0_80<1)||(i11.u101.r_1_80<1))||(i12.i0.i0.u81.p_1_81<1))")) U (G("((i4.i0.i1.u26.p_0_26<1)||(i4.i0.i1.u27.r_0_27<1))" & ("((i4.i0.i1.u26.p_0_26>=1)&&(i4.i0.i1.u27.r_0_27>=1))" | GF"(((i11.u80.r_0_80<1)||(i11.u101.r_1_80<1))||(i12.i0.i0.u81.p_1_81<1))")) | ("(((i4.i0.i1.u26.p_0_26<1)||(i4.i0.i1.u27.r_0_27<1))&&(((i11.u78.r_0_78<1)||(i11.u100.r_1_78<1))||(i11.u79.p_1_79<1)))" & ("((i4.i0.i1.u26.p_0_26>=1)&&(i4.i0.i1.u27.r_0_27>=1))" | GF"(((i11.u80.r_0_80<1)||(i11.u101.r_1_80<1))||(i12.i0.i0.u81.p_1_81<1))"))))
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i14.u99.t100, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17587772188597030448
[2021-05-17 16:00:44] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17587772188597030448
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/ltsmin17587772188597030448]
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/ltsmin17587772188597030448] 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/ltsmin17587772188597030448] 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 ResAllocation-PT-R100C002-03 finished in 35313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G((p1&&X((p1 U (G(p1)||p2))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 318 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:45] [INFO ] Computed 118 place invariants in 2 ms
[2021-05-17 16:00:45] [INFO ] Implicit Places using invariants in 185 ms returned [206, 209, 212, 220, 223, 234, 245, 251, 253, 268, 273, 278, 288, 291, 293, 296, 299]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 186 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:45] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 16:00:45] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:45] [INFO ] Computed 101 place invariants in 8 ms
[2021-05-17 16:00:46] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s179 1) (GEQ s290 1) (GEQ s291 1)), p1:(OR (LT s60 1) (LT s63 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 220 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R100C002-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-04 finished in 642 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:46] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:46] [INFO ] Implicit Places using invariants in 205 ms returned [209, 212, 220, 223, 234, 245, 251, 253, 268, 273, 278, 288, 291, 293, 296, 299, 307]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 207 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:46] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-17 16:00:46] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:46] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 16:00:46] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s206 1) (GEQ s207 1) (GEQ s100 1) (GEQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-05 finished in 591 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:46] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:46] [INFO ] Implicit Places using invariants in 198 ms returned [206, 209, 212, 220, 223, 234, 251, 253, 268, 273, 278, 288, 291, 293, 296, 299, 307]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 199 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:46] [INFO ] Computed 101 place invariants in 3 ms
[2021-05-17 16:00:47] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:47] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 16:00:47] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s77 1) (GEQ s239 1) (GEQ s240 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][false, false, false]]
Stuttering criterion allowed to conclude after 2566 steps with 0 reset in 13 ms.
FORMULA ResAllocation-PT-R100C002-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-06 finished in 613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 316 transition count 200
Applied a total of 4 rules in 15 ms. Remains 316 /318 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 316 cols
[2021-05-17 16:00:47] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:47] [INFO ] Implicit Places using invariants in 190 ms returned [204, 207, 218, 221, 232, 243, 249, 251, 266, 271, 276, 286, 289, 291, 294, 297, 305]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 193 ms to find 17 implicit places.
[2021-05-17 16:00:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 200 rows 299 cols
[2021-05-17 16:00:47] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 16:00:47] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Starting structural reductions, iteration 1 : 299/318 places, 200/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2021-05-17 16:00:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 200 rows 299 cols
[2021-05-17 16:00:47] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 16:00:47] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 2 iterations. Remains : 299/318 places, 200/202 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-07 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 s19 1) (GEQ s208 1) (GEQ s209 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]]
Stuttering criterion allowed to conclude after 2554 steps with 0 reset in 10 ms.
FORMULA ResAllocation-PT-R100C002-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-07 finished in 548 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X((F(p1)&&p0)))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:47] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:48] [INFO ] Implicit Places using invariants in 155 ms returned [206, 209, 212, 220, 223, 234, 245, 251, 268, 273, 278, 291, 293, 296, 299, 307]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 156 ms to find 16 implicit places.
// Phase 1: matrix 202 rows 302 cols
[2021-05-17 16:00:48] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 16:00:48] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Starting structural reductions, iteration 1 : 302/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 302 cols
[2021-05-17 16:00:48] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 16:00:48] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 2 iterations. Remains : 302/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R100C002-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 2}, { cond=(NOT p2), acceptance={} source=7 dest: 5}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(AND (GEQ s151 1) (GEQ s277 1) (GEQ s278 1)), p0:(AND (GEQ s89 1) (GEQ s245 1) (GEQ s246 1)), p2:(AND (GEQ s89 1) (GEQ s245 1) (GEQ s246 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-08 finished in 725 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:48] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:48] [INFO ] Implicit Places using invariants in 181 ms returned [206, 209, 212, 220, 223, 234, 245, 251, 253, 268, 278, 288, 291, 293, 296, 299, 307]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 182 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:48] [INFO ] Computed 101 place invariants in 35 ms
[2021-05-17 16:00:49] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:49] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-17 16:00:49] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s138 1) (LT s141 1)) (OR (LT s125 1) (LT s263 1) (LT s264 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 365 ms.
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 301 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 301/301 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 301 transition count 202
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 20 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2021-05-17 16:00:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:51] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-17 16:00:51] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 202/202 transitions.
Product exploration explored 100000 steps with 50000 reset in 1708 ms.
Product exploration explored 100000 steps with 50000 reset in 1722 ms.
[2021-05-17 16:00:54] [INFO ] Flatten gal took : 9 ms
[2021-05-17 16:00:54] [INFO ] Flatten gal took : 8 ms
[2021-05-17 16:00:54] [INFO ] Time to serialize gal into /tmp/LTL17100280764911776466.gal : 2 ms
[2021-05-17 16:00:54] [INFO ] Time to serialize properties into /tmp/LTL4734649723432745154.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/LTL17100280764911776466.gal, -t, CGAL, -LTL, /tmp/LTL4734649723432745154.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/LTL17100280764911776466.gal -t CGAL -LTL /tmp/LTL4734649723432745154.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((p_0_69<1)||(r_0_70<1))&&(((r_0_62<1)||(r_1_62<1))||(p_1_63<1)))"))))
Formula 0 simplified : !XF"(((p_0_69<1)||(r_0_70<1))&&(((r_0_62<1)||(r_1_62<1))||(p_1_63<1)))"
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
116 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,1.19163,45624,1,0,419,230936,430,207,9322,105550,417
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R100C002-09 finished in 7241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 7 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:55] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:56] [INFO ] Implicit Places using invariants in 212 ms returned [206, 209, 212, 220, 234, 245, 251, 253, 268, 273, 278, 288, 291, 293, 296, 299, 307]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 214 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:56] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-17 16:00:56] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:56] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 16:00:56] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s68 1) (GEQ s71 1)) (AND (GEQ s37 1) (GEQ s219 1) (GEQ s220 1))), p0:(OR (AND (GEQ s37 1) (GEQ s219 1) (GEQ s220 1)) (AND (GEQ s74 1) (GEQ s77 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 18116 steps with 39 reset in 87 ms.
FORMULA ResAllocation-PT-R100C002-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-10 finished in 767 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:56] [INFO ] Computed 118 place invariants in 2 ms
[2021-05-17 16:00:56] [INFO ] Implicit Places using invariants in 215 ms returned [206, 209, 212, 220, 223, 234, 245, 251, 253, 268, 273, 278, 288, 291, 293, 296, 307]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 216 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:56] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 16:00:57] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:57] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-17 16:00:57] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s165 1) (GEQ s283 1) (GEQ s284 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-11 finished in 644 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:00:57] [INFO ] Computed 118 place invariants in 2 ms
[2021-05-17 16:00:57] [INFO ] Implicit Places using invariants in 224 ms returned [206, 209, 212, 223, 234, 245, 251, 253, 268, 273, 278, 288, 291, 293, 296, 299, 307]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 226 ms to find 17 implicit places.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:57] [INFO ] Computed 101 place invariants in 3 ms
[2021-05-17 16:00:57] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Starting structural reductions, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2021-05-17 16:00:57] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-17 16:00:57] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 2 iterations. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ResAllocation-PT-R100C002-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s186 1) (GEQ s189 1)), p0:(AND (GEQ s33 1) (GEQ s217 1) (GEQ s218 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-12 finished in 602 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 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 316 transition count 200
Applied a total of 4 rules in 18 ms. Remains 316 /318 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 316 cols
[2021-05-17 16:00:57] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:58] [INFO ] Implicit Places using invariants in 195 ms returned [204, 207, 210, 218, 221, 232, 243, 249, 251, 266, 271, 276, 286, 289, 291, 294, 297, 305]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 196 ms to find 18 implicit places.
[2021-05-17 16:00:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 200 rows 298 cols
[2021-05-17 16:00:58] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-17 16:00:58] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Starting structural reductions, iteration 1 : 298/318 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2021-05-17 16:00:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 200 rows 298 cols
[2021-05-17 16:00:58] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-17 16:00:58] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 2 iterations. Remains : 298/318 places, 200/202 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s88 1) (LT s91 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 317 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R100C002-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-13 finished in 544 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 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 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 316 transition count 200
Applied a total of 4 rules in 11 ms. Remains 316 /318 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 316 cols
[2021-05-17 16:00:58] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:00:58] [INFO ] Implicit Places using invariants in 187 ms returned [204, 207, 210, 218, 221, 232, 243, 249, 251, 266, 271, 276, 286, 289, 291, 294, 297, 305]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 189 ms to find 18 implicit places.
[2021-05-17 16:00:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 200 rows 298 cols
[2021-05-17 16:00:58] [INFO ] Computed 100 place invariants in 2 ms
[2021-05-17 16:00:58] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 298/318 places, 200/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2021-05-17 16:00:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 200 rows 298 cols
[2021-05-17 16:00:58] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-17 16:00:58] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 2 iterations. Remains : 298/318 places, 200/202 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s66 1) (LT s69 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 38 reset in 337 ms.
Product exploration explored 100000 steps with 38 reset in 377 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 38 reset in 346 ms.
Product exploration explored 100000 steps with 38 reset in 374 ms.
[2021-05-17 16:01:00] [INFO ] Flatten gal took : 13 ms
[2021-05-17 16:01:00] [INFO ] Flatten gal took : 13 ms
[2021-05-17 16:01:00] [INFO ] Time to serialize gal into /tmp/LTL14248747455987162027.gal : 2 ms
[2021-05-17 16:01:00] [INFO ] Time to serialize properties into /tmp/LTL14494610628482117375.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/LTL14248747455987162027.gal, -t, CGAL, -LTL, /tmp/LTL14494610628482117375.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/LTL14248747455987162027.gal -t CGAL -LTL /tmp/LTL14494610628482117375.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p_0_33<1)||(r_0_34<1))"))))
Formula 0 simplified : !FG"((p_0_33<1)||(r_0_34<1))"
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/198/2/200
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2021-05-17 16:01:15] [INFO ] Flatten gal took : 11 ms
[2021-05-17 16:01:15] [INFO ] Applying decomposition
[2021-05-17 16:01:15] [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/graph5349199646509102158.txt, -o, /tmp/graph5349199646509102158.bin, -w, /tmp/graph5349199646509102158.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/graph5349199646509102158.bin, -l, -1, -v, -w, /tmp/graph5349199646509102158.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:01:15] [INFO ] Decomposing Gal with order
[2021-05-17 16:01:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:01:15] [INFO ] Flatten gal took : 16 ms
[2021-05-17 16:01:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 16:01:15] [INFO ] Time to serialize gal into /tmp/LTL7074235872605039451.gal : 2 ms
[2021-05-17 16:01:15] [INFO ] Time to serialize properties into /tmp/LTL4303156312263698571.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/LTL7074235872605039451.gal, -t, CGAL, -LTL, /tmp/LTL4303156312263698571.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/LTL7074235872605039451.gal -t CGAL -LTL /tmp/LTL4303156312263698571.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.i1.i1.u32.p_0_33<1)||(i5.u33.r_0_34<1))"))))
Formula 0 simplified : !FG"((i4.i1.i1.u32.p_0_33<1)||(i5.u33.r_0_34<1))"
Reverse transition relation is NOT exact ! Due to transitions i0.t102_t101, i13.i1.i2.t99_t100, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/198/2/200
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11582095525989437304
[2021-05-17 16:01:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11582095525989437304
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/ltsmin11582095525989437304]
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/ltsmin11582095525989437304] 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/ltsmin11582095525989437304] 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 ResAllocation-PT-R100C002-14 finished in 33239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(p0)&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2021-05-17 16:01:31] [INFO ] Computed 118 place invariants in 1 ms
[2021-05-17 16:01:31] [INFO ] Implicit Places using invariants in 186 ms returned [206, 209, 212, 220, 223, 234, 245, 253, 268, 273, 288, 291, 293, 296, 299, 307]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 187 ms to find 16 implicit places.
// Phase 1: matrix 202 rows 302 cols
[2021-05-17 16:01:31] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 16:01:32] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Starting structural reductions, iteration 1 : 302/318 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 302 cols
[2021-05-17 16:01:32] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 16:01:32] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 2 iterations. Remains : 302/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ResAllocation-PT-R100C002-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s87 1) (GEQ s244 1) (GEQ s245 1)), p0:(AND (GEQ s133 1) (GEQ s268 1) (GEQ s269 1))], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-15 finished in 679 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5544435062779708252
[2021-05-17 16:01:32] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2021-05-17 16:01:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:01:32] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2021-05-17 16:01:32] [INFO ] Applying decomposition
[2021-05-17 16:01:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:01:32] [INFO ] Flatten gal took : 17 ms
[2021-05-17 16:01:32] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2021-05-17 16:01:32] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:01:32] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5544435062779708252
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/ltsmin5544435062779708252]
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/graph7458628286569175657.txt, -o, /tmp/graph7458628286569175657.bin, -w, /tmp/graph7458628286569175657.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/graph7458628286569175657.bin, -l, -1, -v, -w, /tmp/graph7458628286569175657.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:01:32] [INFO ] Decomposing Gal with order
[2021-05-17 16:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:01:32] [INFO ] Flatten gal took : 21 ms
[2021-05-17 16:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 16:01:32] [INFO ] Time to serialize gal into /tmp/LTLFireability6769761597932373415.gal : 2 ms
[2021-05-17 16:01:32] [INFO ] Time to serialize properties into /tmp/LTLFireability3942654807326521484.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/LTLFireability6769761597932373415.gal, -t, CGAL, -LTL, /tmp/LTLFireability3942654807326521484.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/LTLFireability6769761597932373415.gal -t CGAL -LTL /tmp/LTLFireability3942654807326521484.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(((F("(((i8.u58.r_0_58>=1)&&(i8.u109.r_1_58>=1))&&(i8.u59.p_1_59>=1))"))&&(X(F(!("((i3.u26.p_0_26>=1)&&(i3.u27.r_0_27>=1))")))))U(X(X(G("(((i8.u58.r_0_58>=1)&&(i8.u109.r_1_58>=1))&&(i8.u59.p_1_59>=1))")))))))
Formula 0 simplified : !X((F"(((i8.u58.r_0_58>=1)&&(i8.u109.r_1_58>=1))&&(i8.u59.p_1_59>=1))" & XF!"((i3.u26.p_0_26>=1)&&(i3.u27.r_0_27>=1))") U XXG"(((i8.u58.r_0_58>=1)&&(i8.u109.r_1_58>=1))&&(i8.u59.p_1_59>=1))")
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t_1_0, i14.u99.t_0_100, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
Compilation finished in 1196 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5544435062779708252]
Link finished in 56 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((<>((LTLAPp0==true))&&X(<>((LTLAPp1==true)))) U X(X([]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5544435062779708252]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: LTL layer: formula: X(((<>((LTLAPp0==true))&&X(<>((LTLAPp1==true)))) U X(X([]((LTLAPp0==true))))))
pins2lts-mc-linux64( 2/ 8), 0.007: "X(((<>((LTLAPp0==true))&&X(<>((LTLAPp1==true)))) U X(X([]((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.095: There are 208 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.095: State length is 319, there are 212 groups
pins2lts-mc-linux64( 0/ 8), 0.095: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.095: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.095: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.095: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.264: [Blue] ~66 levels ~960 states ~4264 transitions
pins2lts-mc-linux64( 2/ 8), 0.271: [Blue] ~125 levels ~1920 states ~9344 transitions
pins2lts-mc-linux64( 2/ 8), 0.276: [Blue] ~245 levels ~3840 states ~20640 transitions
pins2lts-mc-linux64( 0/ 8), 0.297: [Blue] ~467 levels ~7680 states ~21792 transitions
pins2lts-mc-linux64( 0/ 8), 0.323: [Blue] ~861 levels ~15360 states ~35384 transitions
pins2lts-mc-linux64( 0/ 8), 0.384: [Blue] ~1684 levels ~30720 states ~61456 transitions
pins2lts-mc-linux64( 0/ 8), 0.508: [Blue] ~2989 levels ~61440 states ~118312 transitions
pins2lts-mc-linux64( 0/ 8), 0.785: [Blue] ~2989 levels ~122880 states ~250680 transitions
pins2lts-mc-linux64( 2/ 8), 1.352: [Blue] ~2961 levels ~245760 states ~522784 transitions
pins2lts-mc-linux64( 2/ 8), 2.465: [Blue] ~2961 levels ~491520 states ~928928 transitions
pins2lts-mc-linux64( 2/ 8), 4.737: [Blue] ~2961 levels ~983040 states ~1733584 transitions
pins2lts-mc-linux64( 2/ 8), 9.513: [Blue] ~2961 levels ~1966080 states ~3646232 transitions
pins2lts-mc-linux64( 2/ 8), 18.501: [Blue] ~2961 levels ~3932160 states ~7506176 transitions
pins2lts-mc-linux64( 2/ 8), 36.540: [Blue] ~2961 levels ~7864320 states ~15228960 transitions
pins2lts-mc-linux64( 2/ 8), 76.384: [Blue] ~2961 levels ~15728640 states ~30593248 transitions
pins2lts-mc-linux64( 2/ 8), 96.254: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 96.277:
pins2lts-mc-linux64( 0/ 8), 96.277: Explored 16283601 states 42380013 transitions, fanout: 2.603
pins2lts-mc-linux64( 0/ 8), 96.277: Total exploration time 96.180 sec (96.130 sec minimum, 96.158 sec on average)
pins2lts-mc-linux64( 0/ 8), 96.277: States per second: 169303, Transitions per second: 440632
pins2lts-mc-linux64( 0/ 8), 96.277:
pins2lts-mc-linux64( 0/ 8), 96.277: State space has 14835802 states, 12090257 are accepting
pins2lts-mc-linux64( 0/ 8), 96.277: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 96.277: blue states: 16283601 (109.76%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 96.277: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 96.277: all-red states: 12094064 (81.52%), bogus 610303 (4.11%)
pins2lts-mc-linux64( 0/ 8), 96.277:
pins2lts-mc-linux64( 0/ 8), 96.277: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 96.277:
pins2lts-mc-linux64( 0/ 8), 96.277: Queue width: 8B, total height: 23932, memory: 0.18MB
pins2lts-mc-linux64( 0/ 8), 96.277: Tree memory: 369.2MB, 26.1 B/state, compr.: 2.0%
pins2lts-mc-linux64( 0/ 8), 96.277: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 96.277: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 96.277: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 96.277: Est. total memory use: 369.4MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((<>((LTLAPp0==true))&&X(<>((LTLAPp1==true)))) U X(X([]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5544435062779708252]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((<>((LTLAPp0==true))&&X(<>((LTLAPp1==true)))) U X(X([]((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5544435062779708252]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 16:22:25] [INFO ] Flatten gal took : 8 ms
[2021-05-17 16:22:25] [INFO ] Time to serialize gal into /tmp/LTLFireability14802481790984554064.gal : 2 ms
[2021-05-17 16:22:25] [INFO ] Time to serialize properties into /tmp/LTLFireability1155720074228597842.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/LTLFireability14802481790984554064.gal, -t, CGAL, -LTL, /tmp/LTLFireability1155720074228597842.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/LTLFireability14802481790984554064.gal -t CGAL -LTL /tmp/LTLFireability1155720074228597842.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((X(((F("(((r_0_58>=1)&&(r_1_58>=1))&&(p_1_59>=1))"))&&(X(F(!("((p_0_26>=1)&&(r_0_27>=1))")))))U(X(X(G("(((r_0_58>=1)&&(r_1_58>=1))&&(p_1_59>=1))")))))))
Formula 0 simplified : !X((F"(((r_0_58>=1)&&(r_1_58>=1))&&(p_1_59>=1))" & XF!"((p_0_26>=1)&&(r_0_27>=1))") U XXG"(((r_0_58>=1)&&(r_1_58>=1))&&(p_1_59>=1))")
Reverse transition relation is NOT exact ! Due to transitions t_0_100, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
7 unique states visited
3 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
5799 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,58.0492,1576508,1,0,11761,1.02534e+07,443,5905,10164,9.96612e+06,28695
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(F(((!("((p_0_26>=1)&&(r_0_27>=1))"))&&(("((p_0_26>=1)&&(r_0_27>=1))")||(G(F(!("(((r_0_80>=1)&&(r_1_80>=1))&&(p_1_81>=1))"))))))U((("((!((p_0_26>=1)&&(r_0_27>=1)))&&(!(((r_0_78>=1)&&(r_1_78>=1))&&(p_1_79>=1))))")&&(("((p_0_26>=1)&&(r_0_27>=1))")||(G(F(!("(((r_0_80>=1)&&(r_1_80>=1))&&(p_1_81>=1))"))))))||(G((!("((p_0_26>=1)&&(r_0_27>=1))"))&&(("((p_0_26>=1)&&(r_0_27>=1))")||(G(F(!("(((r_0_80>=1)&&(r_1_80>=1))&&(p_1_81>=1))"))))))))))))
Formula 1 simplified : !XF((!"((p_0_26>=1)&&(r_0_27>=1))" & ("((p_0_26>=1)&&(r_0_27>=1))" | GF!"(((r_0_80>=1)&&(r_1_80>=1))&&(p_1_81>=1))")) U (("((!((p_0_26>=1)&&(r_0_27>=1)))&&(!(((r_0_78>=1)&&(r_1_78>=1))&&(p_1_79>=1))))" & ("((p_0_26>=1)&&(r_0_27>=1))" | GF!"(((r_0_80>=1)&&(r_1_80>=1))&&(p_1_81>=1))")) | G(!"((p_0_26>=1)&&(r_0_27>=1))" & ("((p_0_26>=1)&&(r_0_27>=1))" | GF!"(((r_0_80>=1)&&(r_1_80>=1))&&(p_1_81>=1))"))))
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13431 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,192.359,2441688,1,0,12705,1.45779e+07,26,11576,4518,1.94381e+07,29933
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G(!("((p_0_33>=1)&&(r_0_34>=1))")))))
Formula 2 simplified : !FG!"((p_0_33>=1)&&(r_0_34>=1))"
Computing Next relation with stutter on 99 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
105312 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,1245.48,5751252,1,0,26821,3.40127e+07,18,27838,4541,5.21082e+07,10077
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.

BK_STOP 1621269799088

--------------------
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="ResAllocation-PT-R100C002"
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 ResAllocation-PT-R100C002, 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 r178-tajo-162089416400821"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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