Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277027100282.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is PolyORBNT-COL-S05J40, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 30 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 93K May 10 09:34 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 PolyORBNT-COL-S05J40-ReachabilityFireability-00
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-01
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-02
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-03
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-04
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-05
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-06
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-07
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-08
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-09
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-10
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-11
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-12
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-13
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-14
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655084587070

Running Version 0
[2022-06-13 01:43:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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]
[2022-06-13 01:43:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:43:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-06-13 01:43:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-13 01:43:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 690 ms
[2022-06-13 01:43:09] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-06-13 01:43:09] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-06-13 01:43:09] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-06-13 01:43:09] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-06-13 01:43:09] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-06-13 01:43:09] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-06-13 01:43:09] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2022-06-13 01:43:09] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 4 ms.
[2022-06-13 01:43:09] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12638607415967189902.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2022-06-13 01:43:09] [INFO ] Flatten gal took : 26 ms
[2022-06-13 01:43:09] [INFO ] Flatten gal took : 8 ms
[2022-06-13 01:43:09] [INFO ] Unfolded HLPN to a Petri net with 669 places and 975 transitions in 25 ms.
[2022-06-13 01:43:09] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_10576927618052924459.dot
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 40 transitions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 16) seen :8
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 224 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :3
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 226 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-13 01:43:11] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2022-06-13 01:43:11] [INFO ] Computed 102 place invariants in 92 ms
[2022-06-13 01:43:11] [INFO ] [Real]Absence check using 95 positive place invariants in 46 ms returned unsat
[2022-06-13 01:43:11] [INFO ] [Real]Absence check using 95 positive place invariants in 31 ms returned unsat
[2022-06-13 01:43:11] [INFO ] [Real]Absence check using 95 positive place invariants in 59 ms returned unsat
[2022-06-13 01:43:12] [INFO ] [Real]Absence check using 95 positive place invariants in 41 ms returned unsat
[2022-06-13 01:43:12] [INFO ] [Real]Absence check using 95 positive place invariants in 34 ms returned sat
[2022-06-13 01:43:12] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2022-06-13 01:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:12] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2022-06-13 01:43:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:43:12] [INFO ] [Nat]Absence check using 95 positive place invariants in 32 ms returned sat
[2022-06-13 01:43:12] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2022-06-13 01:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:13] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2022-06-13 01:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:43:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2022-06-13 01:43:13] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 88 ms.
[2022-06-13 01:43:13] [INFO ] Added : 18 causal constraints over 4 iterations in 437 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Incomplete Parikh walk after 5300 steps, including 243 resets, run finished after 27 ms. (steps per millisecond=196 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 12 out of 629 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 624 transition count 892
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 92 place count 581 transition count 891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 580 transition count 891
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 93 place count 580 transition count 848
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 179 place count 537 transition count 848
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 536 transition count 847
Applied a total of 181 rules in 181 ms. Remains 536 /629 variables (removed 93) and now considering 847/935 (removed 88) transitions.
[2022-06-13 01:43:14] [INFO ] Flow matrix only has 843 transitions (discarded 4 similar events)
// Phase 1: matrix 843 rows 536 cols
[2022-06-13 01:43:14] [INFO ] Computed 97 place invariants in 71 ms
[2022-06-13 01:43:14] [INFO ] Dead Transitions using invariants and state equation in 582 ms returned [295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 336, 337, 338, 339, 340, 342, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 371, 372, 373, 374, 375, 377, 380, 381, 382, 383, 384, 385, 387, 390, 394, 395, 396, 397, 398, 399, 400, 402, 405, 409, 414]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[414, 409, 405, 402, 400, 399, 398, 397, 396, 395, 394, 390, 387, 385, 384, 383, 382, 381, 380, 377, 375, 374, 373, 372, 371, 369, 368, 367, 366, 365, 364, 363, 362, 361, 360, 359, 358, 357, 356, 355, 354, 353, 352, 351, 350, 349, 348, 347, 346, 345, 342, 340, 339, 338, 337, 336, 334, 333, 332, 331, 330, 329, 328, 327, 326, 325, 324, 323, 322, 321, 320, 319, 318, 317, 316, 314, 313, 312, 311, 310, 309, 308, 307, 306, 305, 304, 303, 302, 301, 300, 299, 298, 297, 296, 295]
Starting structural reductions, iteration 1 : 536/629 places, 752/935 transitions.
Applied a total of 0 rules in 35 ms. Remains 536 /536 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 536/629 places, 752/935 transitions.
[2022-06-13 01:43:14] [INFO ] Flatten gal took : 98 ms
[2022-06-13 01:43:14] [INFO ] Flatten gal took : 79 ms
[2022-06-13 01:43:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18380899795014598701.gal : 23 ms
[2022-06-13 01:43:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2538796107580023935.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality18380899795014598701.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2538796107580023935.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality18380899795014598701.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2538796107580023935.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2538796107580023935.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 34
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :34 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 60
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :60 after 80
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :80 after 621
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :621 after 899
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :899 after 1338
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1338 after 2195
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2195 after 45557
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :45557 after 76520
Detected timeout of ITS tools.
[2022-06-13 01:43:30] [INFO ] Flatten gal took : 63 ms
[2022-06-13 01:43:30] [INFO ] Applying decomposition
[2022-06-13 01:43:30] [INFO ] Flatten gal took : 57 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/graph15041932210200396548.txt, -o, /tmp/graph15041932210200396548.bin, -w, /tmp/graph15041932210200396548.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/graph15041932210200396548.bin, -l, -1, -v, -w, /tmp/graph15041932210200396548.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:43:30] [INFO ] Decomposing Gal with order
[2022-06-13 01:43:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:43:30] [INFO ] Removed a total of 718 redundant transitions.
[2022-06-13 01:43:30] [INFO ] Flatten gal took : 290 ms
[2022-06-13 01:43:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 316 labels/synchronizations in 35 ms.
[2022-06-13 01:43:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality887779035051163515.gal : 14 ms
[2022-06-13 01:43:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12633050850126876233.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality887779035051163515.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12633050850126876233.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality887779035051163515.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12633050850126876233.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12633050850126876233.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 67
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :67 after 105
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :105 after 171
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :171 after 415061
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10392476089180154927
[2022-06-13 01:43:45] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10392476089180154927
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/ltsmin10392476089180154927]
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/ltsmin10392476089180154927] 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/ltsmin10392476089180154927] 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)
Incomplete random walk after 1000000 steps, including 42276 resets, run finished after 3307 ms. (steps per millisecond=302 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4532 resets, run finished after 2565 ms. (steps per millisecond=389 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5332869 steps, run timeout after 30001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 5332869 steps, saw 1691031 distinct states, run finished after 30006 ms. (steps per millisecond=177 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-13 01:44:22] [INFO ] Flow matrix only has 748 transitions (discarded 4 similar events)
// Phase 1: matrix 748 rows 536 cols
[2022-06-13 01:44:22] [INFO ] Computed 97 place invariants in 36 ms
[2022-06-13 01:44:22] [INFO ] [Real]Absence check using 90 positive place invariants in 22 ms returned sat
[2022-06-13 01:44:22] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 26 ms returned sat
[2022-06-13 01:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:44:23] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2022-06-13 01:44:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:44:23] [INFO ] [Nat]Absence check using 90 positive place invariants in 21 ms returned sat
[2022-06-13 01:44:23] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2022-06-13 01:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:44:23] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-06-13 01:44:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:44:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-13 01:44:24] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 1 ms to minimize.
[2022-06-13 01:44:24] [INFO ] Deduced a trap composed of 166 places in 176 ms of which 2 ms to minimize.
[2022-06-13 01:44:24] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 1 ms to minimize.
[2022-06-13 01:44:24] [INFO ] Deduced a trap composed of 181 places in 175 ms of which 9 ms to minimize.
[2022-06-13 01:44:24] [INFO ] Deduced a trap composed of 172 places in 164 ms of which 1 ms to minimize.
[2022-06-13 01:44:25] [INFO ] Deduced a trap composed of 178 places in 186 ms of which 3 ms to minimize.
[2022-06-13 01:44:25] [INFO ] Deduced a trap composed of 178 places in 164 ms of which 1 ms to minimize.
[2022-06-13 01:44:25] [INFO ] Deduced a trap composed of 181 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:44:25] [INFO ] Deduced a trap composed of 169 places in 164 ms of which 0 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 178 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 175 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 172 places in 168 ms of which 1 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 169 places in 156 ms of which 0 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:44:27] [INFO ] Deduced a trap composed of 178 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:44:27] [INFO ] Deduced a trap composed of 178 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:44:27] [INFO ] Deduced a trap composed of 169 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:44:27] [INFO ] Deduced a trap composed of 178 places in 158 ms of which 0 ms to minimize.
[2022-06-13 01:44:28] [INFO ] Deduced a trap composed of 181 places in 159 ms of which 1 ms to minimize.
[2022-06-13 01:44:28] [INFO ] Deduced a trap composed of 172 places in 155 ms of which 1 ms to minimize.
[2022-06-13 01:44:28] [INFO ] Deduced a trap composed of 175 places in 159 ms of which 2 ms to minimize.
[2022-06-13 01:44:28] [INFO ] Deduced a trap composed of 169 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:44:29] [INFO ] Deduced a trap composed of 178 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:44:29] [INFO ] Deduced a trap composed of 181 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:44:29] [INFO ] Deduced a trap composed of 178 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:44:29] [INFO ] Deduced a trap composed of 151 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:44:30] [INFO ] Deduced a trap composed of 178 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:44:30] [INFO ] Deduced a trap composed of 154 places in 164 ms of which 2 ms to minimize.
[2022-06-13 01:44:30] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:44:30] [INFO ] Deduced a trap composed of 184 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:44:30] [INFO ] Deduced a trap composed of 154 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:44:31] [INFO ] Deduced a trap composed of 181 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:44:31] [INFO ] Deduced a trap composed of 169 places in 146 ms of which 5 ms to minimize.
[2022-06-13 01:44:31] [INFO ] Deduced a trap composed of 169 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:44:31] [INFO ] Deduced a trap composed of 169 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:44:32] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:44:32] [INFO ] Deduced a trap composed of 184 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:44:32] [INFO ] Deduced a trap composed of 178 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:44:32] [INFO ] Deduced a trap composed of 157 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:44:32] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:44:33] [INFO ] Deduced a trap composed of 172 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:44:33] [INFO ] Deduced a trap composed of 178 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:44:33] [INFO ] Deduced a trap composed of 184 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:44:34] [INFO ] Deduced a trap composed of 181 places in 149 ms of which 9 ms to minimize.
[2022-06-13 01:44:34] [INFO ] Deduced a trap composed of 190 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:44:34] [INFO ] Deduced a trap composed of 157 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:44:34] [INFO ] Deduced a trap composed of 160 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:44:35] [INFO ] Deduced a trap composed of 163 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:44:35] [INFO ] Deduced a trap composed of 160 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:44:35] [INFO ] Deduced a trap composed of 169 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:44:35] [INFO ] Deduced a trap composed of 169 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:44:35] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:44:36] [INFO ] Deduced a trap composed of 157 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:44:36] [INFO ] Deduced a trap composed of 181 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:44:36] [INFO ] Deduced a trap composed of 172 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:44:37] [INFO ] Deduced a trap composed of 163 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:45:08] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2022-06-13 01:45:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Support contains 12 out of 536 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 536/536 places, 752/752 transitions.
Applied a total of 0 rules in 24 ms. Remains 536 /536 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 536/536 places, 752/752 transitions.
Starting structural reductions, iteration 0 : 536/536 places, 752/752 transitions.
Applied a total of 0 rules in 31 ms. Remains 536 /536 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2022-06-13 01:45:08] [INFO ] Flow matrix only has 748 transitions (discarded 4 similar events)
// Phase 1: matrix 748 rows 536 cols
[2022-06-13 01:45:08] [INFO ] Computed 97 place invariants in 13 ms
[2022-06-13 01:45:09] [INFO ] Implicit Places using invariants in 500 ms returned []
[2022-06-13 01:45:09] [INFO ] Flow matrix only has 748 transitions (discarded 4 similar events)
// Phase 1: matrix 748 rows 536 cols
[2022-06-13 01:45:09] [INFO ] Computed 97 place invariants in 18 ms
[2022-06-13 01:45:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:45:13] [INFO ] Implicit Places using invariants and state equation in 4705 ms returned []
Implicit Place search using SMT with State Equation took 5211 ms to find 0 implicit places.
[2022-06-13 01:45:14] [INFO ] Redundant transitions in 80 ms returned []
[2022-06-13 01:45:14] [INFO ] Flow matrix only has 748 transitions (discarded 4 similar events)
// Phase 1: matrix 748 rows 536 cols
[2022-06-13 01:45:14] [INFO ] Computed 97 place invariants in 13 ms
[2022-06-13 01:45:14] [INFO ] Dead Transitions using invariants and state equation in 465 ms returned []
Finished structural reductions, in 1 iterations. Remains : 536/536 places, 752/752 transitions.
Incomplete random walk after 100000 steps, including 4236 resets, run finished after 408 ms. (steps per millisecond=245 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-13 01:45:14] [INFO ] Flow matrix only has 748 transitions (discarded 4 similar events)
// Phase 1: matrix 748 rows 536 cols
[2022-06-13 01:45:14] [INFO ] Computed 97 place invariants in 13 ms
[2022-06-13 01:45:14] [INFO ] [Real]Absence check using 90 positive place invariants in 27 ms returned sat
[2022-06-13 01:45:14] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 14 ms returned sat
[2022-06-13 01:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:45:15] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2022-06-13 01:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:45:15] [INFO ] [Nat]Absence check using 90 positive place invariants in 22 ms returned sat
[2022-06-13 01:45:15] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2022-06-13 01:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:45:15] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2022-06-13 01:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:45:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-13 01:45:15] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:45:16] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:45:16] [INFO ] Deduced a trap composed of 160 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:45:16] [INFO ] Deduced a trap composed of 181 places in 200 ms of which 1 ms to minimize.
[2022-06-13 01:45:16] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 0 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 178 places in 166 ms of which 0 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 178 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 181 places in 160 ms of which 0 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 169 places in 164 ms of which 1 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 178 places in 165 ms of which 4 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 175 places in 167 ms of which 2 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 0 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 157 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 178 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:45:19] [INFO ] Deduced a trap composed of 178 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:45:19] [INFO ] Deduced a trap composed of 169 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:45:19] [INFO ] Deduced a trap composed of 178 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:45:20] [INFO ] Deduced a trap composed of 181 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:45:20] [INFO ] Deduced a trap composed of 172 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:45:20] [INFO ] Deduced a trap composed of 175 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:45:20] [INFO ] Deduced a trap composed of 169 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:45:20] [INFO ] Deduced a trap composed of 178 places in 153 ms of which 1 ms to minimize.
[2022-06-13 01:45:21] [INFO ] Deduced a trap composed of 181 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:45:21] [INFO ] Deduced a trap composed of 178 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:45:21] [INFO ] Deduced a trap composed of 151 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:45:21] [INFO ] Deduced a trap composed of 178 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:45:22] [INFO ] Deduced a trap composed of 154 places in 153 ms of which 8 ms to minimize.
[2022-06-13 01:45:22] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:45:22] [INFO ] Deduced a trap composed of 184 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:45:22] [INFO ] Deduced a trap composed of 154 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:45:22] [INFO ] Deduced a trap composed of 181 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:45:23] [INFO ] Deduced a trap composed of 169 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:45:23] [INFO ] Deduced a trap composed of 169 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:45:23] [INFO ] Deduced a trap composed of 169 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:45:23] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 0 ms to minimize.
[2022-06-13 01:45:24] [INFO ] Deduced a trap composed of 184 places in 141 ms of which 0 ms to minimize.
[2022-06-13 01:45:24] [INFO ] Deduced a trap composed of 178 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:45:24] [INFO ] Deduced a trap composed of 157 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:45:24] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:45:24] [INFO ] Deduced a trap composed of 172 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:45:25] [INFO ] Deduced a trap composed of 178 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:45:25] [INFO ] Deduced a trap composed of 184 places in 141 ms of which 0 ms to minimize.
[2022-06-13 01:45:25] [INFO ] Deduced a trap composed of 181 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:45:25] [INFO ] Deduced a trap composed of 190 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:45:26] [INFO ] Deduced a trap composed of 157 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:45:26] [INFO ] Deduced a trap composed of 160 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:45:26] [INFO ] Deduced a trap composed of 163 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:45:26] [INFO ] Deduced a trap composed of 160 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:45:27] [INFO ] Deduced a trap composed of 169 places in 143 ms of which 0 ms to minimize.
[2022-06-13 01:45:27] [INFO ] Deduced a trap composed of 169 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:45:27] [INFO ] Deduced a trap composed of 166 places in 141 ms of which 0 ms to minimize.
[2022-06-13 01:45:27] [INFO ] Deduced a trap composed of 157 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:45:28] [INFO ] Deduced a trap composed of 181 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:45:28] [INFO ] Deduced a trap composed of 172 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:45:28] [INFO ] Deduced a trap composed of 163 places in 135 ms of which 0 ms to minimize.
[2022-06-13 01:45:35] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 0 ms to minimize.
[2022-06-13 01:45:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 01:45:35] [INFO ] Flatten gal took : 48 ms
[2022-06-13 01:45:35] [INFO ] Flatten gal took : 54 ms
[2022-06-13 01:45:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3368471866755933906.gal : 5 ms
[2022-06-13 01:45:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11880848371051600811.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3368471866755933906.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11880848371051600811.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3368471866755933906.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11880848371051600811.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11880848371051600811.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 34
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :34 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 60
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :60 after 80
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :80 after 621
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :621 after 899
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :899 after 1338
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1338 after 2195
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2195 after 45557
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :45557 after 76520
Detected timeout of ITS tools.
[2022-06-13 01:45:50] [INFO ] Flatten gal took : 41 ms
[2022-06-13 01:45:50] [INFO ] Applying decomposition
[2022-06-13 01:45:50] [INFO ] Flatten gal took : 40 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/graph11711422166073555582.txt, -o, /tmp/graph11711422166073555582.bin, -w, /tmp/graph11711422166073555582.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/graph11711422166073555582.bin, -l, -1, -v, -w, /tmp/graph11711422166073555582.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:45:50] [INFO ] Decomposing Gal with order
[2022-06-13 01:45:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:45:51] [INFO ] Removed a total of 718 redundant transitions.
[2022-06-13 01:45:51] [INFO ] Flatten gal took : 139 ms
[2022-06-13 01:45:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 319 labels/synchronizations in 26 ms.
[2022-06-13 01:45:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17602356486398711281.gal : 6 ms
[2022-06-13 01:45:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6531096926639825975.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17602356486398711281.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6531096926639825975.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17602356486398711281.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6531096926639825975.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6531096926639825975.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :66 after 403
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17817335439369627736
[2022-06-13 01:46:06] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17817335439369627736
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/ltsmin17817335439369627736]
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/ltsmin17817335439369627736] 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/ltsmin17817335439369627736] 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)
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 536 transition count 748
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 536 transition count 747
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 535 transition count 747
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 535 transition count 746
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 534 transition count 746
Applied a total of 8 rules in 79 ms. Remains 534 /536 variables (removed 2) and now considering 746/752 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 746 rows 534 cols
[2022-06-13 01:46:07] [INFO ] Computed 97 place invariants in 13 ms
[2022-06-13 01:46:07] [INFO ] [Real]Absence check using 90 positive place invariants in 19 ms returned sat
[2022-06-13 01:46:07] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2022-06-13 01:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:46:07] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2022-06-13 01:46:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:46:07] [INFO ] [Nat]Absence check using 90 positive place invariants in 23 ms returned sat
[2022-06-13 01:46:07] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2022-06-13 01:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:46:08] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 179 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 155 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 1 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:46:10] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:46:10] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:46:10] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:46:10] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:46:10] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:46:11] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:46:11] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:46:11] [INFO ] Deduced a trap composed of 173 places in 166 ms of which 1 ms to minimize.
[2022-06-13 01:46:11] [INFO ] Deduced a trap composed of 157 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:46:12] [INFO ] Deduced a trap composed of 178 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:46:12] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:46:12] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 0 ms to minimize.
[2022-06-13 01:46:12] [INFO ] Deduced a trap composed of 167 places in 183 ms of which 1 ms to minimize.
[2022-06-13 01:46:13] [INFO ] Deduced a trap composed of 179 places in 163 ms of which 0 ms to minimize.
[2022-06-13 01:46:13] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 0 ms to minimize.
[2022-06-13 01:46:13] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 0 ms to minimize.
[2022-06-13 01:46:13] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:46:13] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 0 ms to minimize.
[2022-06-13 01:46:14] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:46:14] [INFO ] Deduced a trap composed of 161 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:46:14] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2022-06-13 01:46:15] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:46:15] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2022-06-13 01:46:15] [INFO ] Deduced a trap composed of 155 places in 155 ms of which 1 ms to minimize.
[2022-06-13 01:46:15] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:46:15] [INFO ] Deduced a trap composed of 185 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:46:16] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:46:16] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:46:16] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:46:16] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:46:17] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:46:17] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:46:19] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:46:19] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 1 ms to minimize.
[2022-06-13 01:46:19] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 0 ms to minimize.
[2022-06-13 01:46:19] [INFO ] Deduced a trap composed of 179 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:46:52] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 0 ms to minimize.
[2022-06-13 01:46:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 01:46:53] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5528049682142372588
[2022-06-13 01:46:53] [INFO ] Computing symmetric may disable matrix : 752 transitions.
[2022-06-13 01:46:53] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 01:46:53] [INFO ] Flatten gal took : 59 ms
[2022-06-13 01:46:53] [INFO ] Computing symmetric may enable matrix : 752 transitions.
[2022-06-13 01:46:53] [INFO ] Applying decomposition
[2022-06-13 01:46:53] [INFO ] Computation of Complete enable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 01:46:53] [INFO ] Flatten gal took : 51 ms
[2022-06-13 01:46:53] [INFO ] Input system was already deterministic with 752 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7029447190307083668.txt, -o, /tmp/graph7029447190307083668.bin, -w, /tmp/graph7029447190307083668.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/graph7029447190307083668.bin, -l, -1, -v, -w, /tmp/graph7029447190307083668.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:46:53] [INFO ] Decomposing Gal with order
[2022-06-13 01:46:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:46:53] [INFO ] Computing Do-Not-Accords matrix : 752 transitions.
[2022-06-13 01:46:53] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 01:46:53] [INFO ] Built C files in 315ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5528049682142372588
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/ltsmin5528049682142372588]
[2022-06-13 01:46:53] [INFO ] Removed a total of 718 redundant transitions.
[2022-06-13 01:46:53] [INFO ] Flatten gal took : 119 ms
[2022-06-13 01:46:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 23 ms.
[2022-06-13 01:46:53] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13763719006162050264.gal : 9 ms
[2022-06-13 01:46:53] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15035179258626927349.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability13763719006162050264.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability15035179258626927349.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability13763719006162050264.gal -t CGAL -reachable-file /tmp/ReachabilityFireability15035179258626927349.prop --nowitness
[2022-06-13 01:46:53] [INFO ] Ran tautology test, simplified 0 / 1 in 428 ms.
[2022-06-13 01:46:53] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(UNSAT) depth K=0 took 18 ms
Loading property file /tmp/ReachabilityFireability15035179258626927349.prop.
[2022-06-13 01:46:53] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(UNSAT) depth K=1 took 39 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 748 out of 752 initially.
// Phase 1: matrix 748 rows 536 cols
[2022-06-13 01:46:53] [INFO ] Computed 97 place invariants in 13 ms
inv : FetchJobE_6 + QueueJobB_6 + f3_6 + f2_6 + f1_6 + NotifyEventJobQueuedB_6 + AvailableJobId_6 = 1
inv : CreatedJobs_170 + CreatedJobs_171 + CreatedJobs_172 + CreatedJobs_173 + CreatedJobs_174 + AvailableJobId_34 = 1
inv : FetchJobE_3 + QueueJobB_3 + f3_3 + f2_3 + f1_3 + NotifyEventJobQueuedB_3 + AvailableJobId_3 = 1
inv : CreatedJobs_95 + CreatedJobs_96 + CreatedJobs_97 + CreatedJobs_98 + CreatedJobs_99 + AvailableJobId_19 = 1
inv : CreatedJobs_20 + CreatedJobs_21 + CreatedJobs_22 + CreatedJobs_23 + CreatedJobs_24 + AvailableJobId_4 = 1
inv : CreatedJobs_30 + CreatedJobs_31 + CreatedJobs_32 + CreatedJobs_33 + CreatedJobs_34 + AvailableJobId_6 = 1
inv : FetchJobE_25 + QueueJobB_25 + f3_25 + f2_25 + f1_25 + NotifyEventJobQueuedB_25 + AvailableJobId_25 = 1
inv : CreatedJobs_160 + CreatedJobs_161 + CreatedJobs_162 + CreatedJobs_163 + CreatedJobs_164 + AvailableJobId_32 = 1
inv : FetchJobE_9 + QueueJobB_9 + f3_9 + f2_9 + f1_9 + NotifyEventJobQueuedB_9 + AvailableJobId_9 = 1
inv : FetchJobE_31 + QueueJobB_31 + f3_31 + f2_31 + f1_31 + NotifyEventJobQueuedB_31 + AvailableJobId_31 = 1
inv : CreatedJobs_105 + CreatedJobs_106 + CreatedJobs_107 + CreatedJobs_108 + CreatedJobs_109 + AvailableJobId_21 = 1
inv : -12*NotifyEventJobQueuedB_0 - 12*NotifyEventJobQueuedB_1 - 12*NotifyEventJobQueuedB_2 - 12*NotifyEventJobQueuedB_3 - 12*NotifyEventJobQueuedB_4 - 12*NotifyEventJobQueuedB_5 - 12*NotifyEventJobQueuedB_6 - 12*NotifyEventJobQueuedB_7 - 12*NotifyEventJobQueuedB_8 - 12*NotifyEventJobQueuedB_9 - 12*NotifyEventJobQueuedB_10 - 12*NotifyEventJobQueuedB_11 - 12*NotifyEventJobQueuedB_12 - 12*NotifyEventJobQueuedB_13 - 12*NotifyEventJobQueuedB_14 - 12*NotifyEventJobQueuedB_15 - 12*NotifyEventJobQueuedB_16 - 12*NotifyEventJobQueuedB_17 - 12*NotifyEventJobQueuedB_18 - 12*NotifyEventJobQueuedB_19 - 12*NotifyEventJobQueuedB_20 - 12*NotifyEventJobQueuedB_21 - 12*NotifyEventJobQueuedB_22 - 12*NotifyEventJobQueuedB_23 - 12*NotifyEventJobQueuedB_24 - 12*NotifyEventJobQueuedB_25 - 12*NotifyEventJobQueuedB_26 - 12*NotifyEventJobQueuedB_27 - 12*NotifyEventJobQueuedB_28 - 12*NotifyEventJobQueuedB_29 - 12*NotifyEventJobQueuedB_30 - 12*NotifyEventJobQueuedB_31 - 12*NotifyEventJobQueuedB_32 - 12*NotifyEventJobQueuedB_33 - 12*NotifyEventJobQueuedB_34 - 12*NotifyEventJobQueuedB_35 - 12*NotifyEventJobQueuedB_36 - 12*NotifyEventJobQueuedB_37 - 12*NotifyEventJobQueuedB_38 - 12*NotifyEventJobQueuedB_39 - 12*NotifyEventJobQueuedB_40 + 12*NotifyEventEndOfCheckSourcesE_0 + 12*NotifyEventEndOfCheckSourcesB_0 + 3*place_523_0 + 4*place_522_0 + 6*place_521_0 + 12*place_520_0 + 12*place_518_0 + 12*place_500_0 + 3*place_462_0 + 4*place_460_0 + 6*place_458_0 + 12*place_456_0 - 12*AvailableJobId_0 - 12*AvailableJobId_1 - 12*AvailableJobId_2 - 12*AvailableJobId_3 - 12*AvailableJobId_4 - 12*AvailableJobId_5 - 12*AvailableJobId_6 - 12*AvailableJobId_7 - 12*AvailableJobId_8 - 12*AvailableJobId_9 - 12*AvailableJobId_10 - 12*AvailableJobId_11 - 12*AvailableJobId_12 - 12*AvailableJobId_13 - 12*AvailableJobId_14 - 12*AvailableJobId_15 - 12*AvailableJobId_16 - 12*AvailableJobId_17 - 12*AvailableJobId_18 - 12*AvailableJobId_19 - 12*AvailableJobId_20 - 12*AvailableJobId_21 - 12*AvailableJobId_22 - 12*AvailableJobId_23 - 12*AvailableJobId_24 - 12*AvailableJobId_25 - 12*AvailableJobId_26 - 12*AvailableJobId_27 - 12*AvailableJobId_28 - 12*AvailableJobId_29 - 12*AvailableJobId_30 - 12*AvailableJobId_31 - 12*AvailableJobId_32 - 12*AvailableJobId_33 - 12*AvailableJobId_34 - 12*AvailableJobId_35 - 12*AvailableJobId_36 - 12*AvailableJobId_37 - 12*AvailableJobId_38 - 12*AvailableJobId_39 - 12*AvailableJobId_40 + 12*Check_Sources_E_0 + 12*place_787_0 + 12*Schedule_Task_B_0 + 12*cJobCnt_0 = -360
inv : CreatedJobs_180 + CreatedJobs_181 + CreatedJobs_182 + CreatedJobs_183 + CreatedJobs_184 + AvailableJobId_36 = 1
inv : FetchJobE_22 + QueueJobB_22 + f3_22 + f2_22 + f1_22 + NotifyEventJobQueuedB_22 + AvailableJobId_22 = 1
inv : CreatedJobs_115 + CreatedJobs_116 + CreatedJobs_117 + CreatedJobs_118 + CreatedJobs_119 + AvailableJobId_23 = 1
inv : FetchJobE_34 + QueueJobB_34 + f3_34 + f2_34 + f1_34 + NotifyEventJobQueuedB_34 + AvailableJobId_34 = 1
inv : f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + mo1_0 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - f1_21 - f1_22 - f1_23 - f1_24 - f1_25 - f1_26 - f1_27 - f1_28 - f1_29 - f1_30 - f1_31 - f1_32 - f1_33 - f1_34 - f1_35 - f1_36 - f1_37 - f1_38 - f1_39 - f1_40 - mi1_0 = 0
inv : CreatedJobs_75 + CreatedJobs_76 + CreatedJobs_77 + CreatedJobs_78 + CreatedJobs_79 + AvailableJobId_15 = 1
inv : CreatedJobs_85 + CreatedJobs_86 + CreatedJobs_87 + CreatedJobs_88 + CreatedJobs_89 + AvailableJobId_17 = 1
inv : FetchJobE_15 + QueueJobB_15 + f3_15 + f2_15 + f1_15 + NotifyEventJobQueuedB_15 + AvailableJobId_15 = 1
inv : FetchJobE_0 + QueueJobB_0 + f3_0 + f2_0 + f1_0 + NotifyEventJobQueuedB_0 + AvailableJobId_0 = 1
inv : FetchJobE_40 + QueueJobB_40 + f3_40 + f2_40 + f1_40 + NotifyEventJobQueuedB_40 + AvailableJobId_40 = 1
inv : FetchJobE_16 + QueueJobB_16 + f3_16 + f2_16 + f1_16 + NotifyEventJobQueuedB_16 + AvailableJobId_16 = 1
inv : FetchJobE_32 + QueueJobB_32 + f3_32 + f2_32 + f1_32 + NotifyEventJobQueuedB_32 + AvailableJobId_32 = 1
inv : FetchJobE_10 + QueueJobB_10 + f3_10 + f2_10 + f1_10 + NotifyEventJobQueuedB_10 + AvailableJobId_10 = 1
inv : FetchJobE_13 + QueueJobB_13 + f3_13 + f2_13 + f1_13 + NotifyEventJobQueuedB_13 + AvailableJobId_13 = 1
inv : CreatedJobs_60 + CreatedJobs_61 + CreatedJobs_62 + CreatedJobs_63 + CreatedJobs_64 + AvailableJobId_12 = 1
inv : FetchJobE_29 + QueueJobB_29 + f3_29 + f2_29 + f1_29 + NotifyEventJobQueuedB_29 + AvailableJobId_29 = 1
inv : CreatedJobs_65 + CreatedJobs_66 + CreatedJobs_67 + CreatedJobs_68 + CreatedJobs_69 + AvailableJobId_13 = 1
inv : CreatedJobs_145 + CreatedJobs_146 + CreatedJobs_147 + CreatedJobs_148 + CreatedJobs_149 + AvailableJobId_29 = 1
inv : CreatedJobs_125 + CreatedJobs_126 + CreatedJobs_127 + CreatedJobs_128 + CreatedJobs_129 + AvailableJobId_25 = 1
inv : CreatedJobs_140 + CreatedJobs_141 + CreatedJobs_142 + CreatedJobs_143 + CreatedJobs_144 + AvailableJobId_28 = 1
inv : block_0 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 = 3
inv : -f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 - f3_21 - f3_22 - f3_23 - f3_24 - f3_25 - f3_26 - f3_27 - f3_28 - f3_29 - f3_30 - f3_31 - f3_32 - f3_33 - f3_34 - f3_35 - f3_36 - f3_37 - f3_38 - f3_39 - f3_40 + mo3_0 + f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + mi2_0 + mi1_0 = 1
inv : CreatedJobs_200 + CreatedJobs_201 + CreatedJobs_202 + CreatedJobs_203 + CreatedJobs_204 + AvailableJobId_40 = 1
inv : FetchJobE_26 + QueueJobB_26 + f3_26 + f2_26 + f1_26 + NotifyEventJobQueuedB_26 + AvailableJobId_26 = 1
inv : CreatedJobs_80 + CreatedJobs_81 + CreatedJobs_82 + CreatedJobs_83 + CreatedJobs_84 + AvailableJobId_16 = 1
inv : FetchJobE_12 + QueueJobB_12 + f3_12 + f2_12 + f1_12 + NotifyEventJobQueuedB_12 + AvailableJobId_12 = 1
inv : CreatedJobs_40 + CreatedJobs_41 + CreatedJobs_42 + CreatedJobs_43 + CreatedJobs_44 + AvailableJobId_8 = 1
inv : CreatedJobs_120 + CreatedJobs_121 + CreatedJobs_122 + CreatedJobs_123 + CreatedJobs_124 + AvailableJobId_24 = 1
inv : mo2_0 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 - f2_21 - f2_22 - f2_23 - f2_24 - f2_25 - f2_26 - f2_27 - f2_28 - f2_29 - f2_30 - f2_31 - f2_32 - f2_33 - f2_34 - f2_35 - f2_36 - f2_37 - f2_38 - f2_39 - f2_40 + f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 - mi2_0 = 0
inv : FetchJobE_27 + QueueJobB_27 + f3_27 + f2_27 + f1_27 + NotifyEventJobQueuedB_27 + AvailableJobId_27 = 1
inv : CreatedJobs_0 + CreatedJobs_1 + CreatedJobs_2 + CreatedJobs_3 + CreatedJobs_4 + AvailableJobId_0 = 1
inv : FetchJobE_11 + QueueJobB_11 + f3_11 + f2_11 + f1_11 + NotifyEventJobQueuedB_11 + AvailableJobId_11 = 1
inv : ModifiedSrc_1 + CreatedJobs_1 + CreatedJobs_6 + CreatedJobs_11 + CreatedJobs_16 + CreatedJobs_21 + CreatedJobs_26 + CreatedJobs_31 + CreatedJobs_36 + CreatedJobs_41 + CreatedJobs_46 + CreatedJobs_51 + CreatedJobs_56 + CreatedJobs_61 + CreatedJobs_66 + CreatedJobs_71 + CreatedJobs_76 + CreatedJobs_81 + CreatedJobs_86 + CreatedJobs_91 + CreatedJobs_96 + CreatedJobs_101 + CreatedJobs_106 + CreatedJobs_111 + CreatedJobs_116 + CreatedJobs_121 + CreatedJobs_126 + CreatedJobs_131 + CreatedJobs_136 + CreatedJobs_141 + CreatedJobs_146 + CreatedJobs_151 + CreatedJobs_156 + CreatedJobs_161 + CreatedJobs_166 + CreatedJobs_171 + CreatedJobs_176 + CreatedJobs_181 + CreatedJobs_186 + CreatedJobs_191 + CreatedJobs_196 + CreatedJobs_201 + place_482_1 + TheSour_1 = 1
inv : FetchJobE_28 + QueueJobB_28 + f3_28 + f2_28 + f1_28 + NotifyEventJobQueuedB_28 + AvailableJobId_28 = 1
inv : CreatedJobs_165 + CreatedJobs_166 + CreatedJobs_167 + CreatedJobs_168 + CreatedJobs_169 + AvailableJobId_33 = 1
inv : FetchJobE_39 + QueueJobB_39 + f3_39 + f2_39 + f1_39 + NotifyEventJobQueuedB_39 + AvailableJobId_39 = 1
inv : FetchJobE_17 + QueueJobB_17 + f3_17 + f2_17 + f1_17 + NotifyEventJobQueuedB_17 + AvailableJobId_17 = 1
inv : CreatedJobs_100 + CreatedJobs_101 + CreatedJobs_102 + CreatedJobs_103 + CreatedJobs_104 + AvailableJobId_20 = 1
inv : CreatedJobs_25 + CreatedJobs_26 + CreatedJobs_27 + CreatedJobs_28 + CreatedJobs_29 + AvailableJobId_5 = 1
inv : CreatedJobs_90 + CreatedJobs_91 + CreatedJobs_92 + CreatedJobs_93 + CreatedJobs_94 + AvailableJobId_18 = 1
inv : CreatedJobs_175 + CreatedJobs_176 + CreatedJobs_177 + CreatedJobs_178 + CreatedJobs_179 + AvailableJobId_35 = 1
inv : CreatedJobs_155 + CreatedJobs_156 + CreatedJobs_157 + CreatedJobs_158 + CreatedJobs_159 + AvailableJobId_31 = 1
inv : FetchJobE_14 + QueueJobB_14 + f3_14 + f2_14 + f1_14 + NotifyEventJobQueuedB_14 + AvailableJobId_14 = 1
inv : FetchJobE_30 + QueueJobB_30 + f3_30 + f2_30 + f1_30 + NotifyEventJobQueuedB_30 + AvailableJobId_30 = 1
inv : ModifiedSrc_3 + CreatedJobs_3 + CreatedJobs_8 + CreatedJobs_13 + CreatedJobs_18 + CreatedJobs_23 + CreatedJobs_28 + CreatedJobs_33 + CreatedJobs_38 + CreatedJobs_43 + CreatedJobs_48 + CreatedJobs_53 + CreatedJobs_58 + CreatedJobs_63 + CreatedJobs_68 + CreatedJobs_73 + CreatedJobs_78 + CreatedJobs_83 + CreatedJobs_88 + CreatedJobs_93 + CreatedJobs_98 + CreatedJobs_103 + CreatedJobs_108 + CreatedJobs_113 + CreatedJobs_118 + CreatedJobs_123 + CreatedJobs_128 + CreatedJobs_133 + CreatedJobs_138 + CreatedJobs_143 + CreatedJobs_148 + CreatedJobs_153 + CreatedJobs_158 + CreatedJobs_163 + CreatedJobs_168 + CreatedJobs_173 + CreatedJobs_178 + CreatedJobs_183 + CreatedJobs_188 + CreatedJobs_193 + CreatedJobs_198 + CreatedJobs_203 + place_482_3 + TheSour_3 = 1
inv : FetchJobE_8 + QueueJobB_8 + f3_8 + f2_8 + f1_8 + NotifyEventJobQueuedB_8 + AvailableJobId_8 = 1
inv : CreatedJobs_185 + CreatedJobs_186 + CreatedJobs_187 + CreatedJobs_188 + CreatedJobs_189 + AvailableJobId_37 = 1
inv : FetchJobE_1 + QueueJobB_1 + f3_1 + f2_1 + f1_1 + NotifyEventJobQueuedB_1 + AvailableJobId_1 = 1
inv : CreatedJobs_15 + CreatedJobs_16 + CreatedJobs_17 + CreatedJobs_18 + CreatedJobs_19 + AvailableJobId_3 = 1
inv : CreatedJobs_5 + CreatedJobs_6 + CreatedJobs_7 + CreatedJobs_8 + CreatedJobs_9 + AvailableJobId_1 = 1
inv : FetchJobE_23 + QueueJobB_23 + f3_23 + f2_23 + f1_23 + NotifyEventJobQueuedB_23 + AvailableJobId_23 = 1
inv : CreatedJobs_45 + CreatedJobs_46 + CreatedJobs_47 + CreatedJobs_48 + CreatedJobs_49 + AvailableJobId_9 = 1
inv : FetchJobE_33 + QueueJobB_33 + f3_33 + f2_33 + f1_33 + NotifyEventJobQueuedB_33 + AvailableJobId_33 = 1
inv : CreatedJobs_35 + CreatedJobs_36 + CreatedJobs_37 + CreatedJobs_38 + CreatedJobs_39 + AvailableJobId_7 = 1
inv : FetchJobE_7 + QueueJobB_7 + f3_7 + f2_7 + f1_7 + NotifyEventJobQueuedB_7 + AvailableJobId_7 = 1
inv : ModifiedSrc_2 + CreatedJobs_2 + CreatedJobs_7 + CreatedJobs_12 + CreatedJobs_17 + CreatedJobs_22 + CreatedJobs_27 + CreatedJobs_32 + CreatedJobs_37 + CreatedJobs_42 + CreatedJobs_47 + CreatedJobs_52 + CreatedJobs_57 + CreatedJobs_62 + CreatedJobs_67 + CreatedJobs_72 + CreatedJobs_77 + CreatedJobs_82 + CreatedJobs_87 + CreatedJobs_92 + CreatedJobs_97 + CreatedJobs_102 + CreatedJobs_107 + CreatedJobs_112 + CreatedJobs_117 + CreatedJobs_122 + CreatedJobs_127 + CreatedJobs_132 + CreatedJobs_137 + CreatedJobs_142 + CreatedJobs_147 + CreatedJobs_152 + CreatedJobs_157 + CreatedJobs_162 + CreatedJobs_167 + CreatedJobs_172 + CreatedJobs_177 + CreatedJobs_182 + CreatedJobs_187 + CreatedJobs_192 + CreatedJobs_197 + CreatedJobs_202 + place_482_2 + TheSour_2 = 1
inv : mi3_0 + mi2_0 + mi1_0 = 1
inv : FetchJobE_24 + QueueJobB_24 + f3_24 + f2_24 + f1_24 + NotifyEventJobQueuedB_24 + AvailableJobId_24 = 1
inv : FetchJobE_21 + QueueJobB_21 + f3_21 + f2_21 + f1_21 + NotifyEventJobQueuedB_21 + AvailableJobId_21 = 1
inv : CreatedJobs_135 + CreatedJobs_136 + CreatedJobs_137 + CreatedJobs_138 + CreatedJobs_139 + AvailableJobId_27 = 1
inv : CreatedJobs_130 + CreatedJobs_131 + CreatedJobs_132 + CreatedJobs_133 + CreatedJobs_134 + AvailableJobId_26 = 1
inv : FetchJobE_35 + QueueJobB_35 + f3_35 + f2_35 + f1_35 + NotifyEventJobQueuedB_35 + AvailableJobId_35 = 1
inv : CreatedJobs_70 + CreatedJobs_71 + CreatedJobs_72 + CreatedJobs_73 + CreatedJobs_74 + AvailableJobId_14 = 1
inv : CreatedJobs_55 + CreatedJobs_56 + CreatedJobs_57 + CreatedJobs_58 + CreatedJobs_59 + AvailableJobId_11 = 1
inv : CreatedJobs_195 + CreatedJobs_196 + CreatedJobs_197 + CreatedJobs_198 + CreatedJobs_199 + AvailableJobId_39 = 1
inv : FetchJobB_0 - QueueJobB_0 - QueueJobB_1 - QueueJobB_2 - QueueJobB_3 - QueueJobB_4 - QueueJobB_5 - QueueJobB_6 - QueueJobB_7 - QueueJobB_8 - QueueJobB_9 - QueueJobB_10 - QueueJobB_11 - QueueJobB_12 - QueueJobB_13 - QueueJobB_14 - QueueJobB_15 - QueueJobB_16 - QueueJobB_17 - QueueJobB_18 - QueueJobB_19 - QueueJobB_20 - QueueJobB_21 - QueueJobB_22 - QueueJobB_23 - QueueJobB_24 - QueueJobB_25 - QueueJobB_26 - QueueJobB_27 - QueueJobB_28 - QueueJobB_29 - QueueJobB_30 - QueueJobB_31 - QueueJobB_32 - QueueJobB_33 - QueueJobB_34 - QueueJobB_35 - QueueJobB_36 - QueueJobB_37 - QueueJobB_38 - QueueJobB_39 - QueueJobB_40 - f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 - f3_21 - f3_22 - f3_23 - f3_24 - f3_25 - f3_26 - f3_27 - f3_28 - f3_29 - f3_30 - f3_31 - f3_32 - f3_33 - f3_34 - f3_35 - f3_36 - f3_37 - f3_38 - f3_39 - f3_40 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 - f2_21 - f2_22 - f2_23 - f2_24 - f2_25 - f2_26 - f2_27 - f2_28 - f2_29 - f2_30 - f2_31 - f2_32 - f2_33 - f2_34 - f2_35 - f2_36 - f2_37 - f2_38 - f2_39 - f2_40 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - f1_21 - f1_22 - f1_23 - f1_24 - f1_25 - f1_26 - f1_27 - f1_28 - f1_29 - f1_30 - f1_31 - f1_32 - f1_33 - f1_34 - f1_35 - f1_36 - f1_37 - f1_38 - f1_39 - f1_40 - cJobCnt_0 = -10
inv : FetchJobE_2 + QueueJobB_2 + f3_2 + f2_2 + f1_2 + NotifyEventJobQueuedB_2 + AvailableJobId_2 = 1
inv : FetchJobE_5 + QueueJobB_5 + f3_5 + f2_5 + f1_5 + NotifyEventJobQueuedB_5 + AvailableJobId_5 = 1
inv : FetchJobE_38 + QueueJobB_38 + f3_38 + f2_38 + f1_38 + NotifyEventJobQueuedB_38 + AvailableJobId_38 = 1
inv : CreatedJobs_190 + CreatedJobs_191 + CreatedJobs_192 + CreatedJobs_193 + CreatedJobs_194 + AvailableJobId_38 = 1
inv : FetchJobE_18 + QueueJobB_18 + f3_18 + f2_18 + f1_18 + NotifyEventJobQueuedB_18 + AvailableJobId_18 = 1
inv : FetchJobE_19 + QueueJobB_19 + f3_19 + f2_19 + f1_19 + NotifyEventJobQueuedB_19 + AvailableJobId_19 = 1
inv : QueueJobE_0 + QueueJobB_0 + QueueJobB_1 + QueueJobB_2 + QueueJobB_3 + QueueJobB_4 + QueueJobB_5 + QueueJobB_6 + QueueJobB_7 + QueueJobB_8 + QueueJobB_9 + QueueJobB_10 + QueueJobB_11 + QueueJobB_12 + QueueJobB_13 + QueueJobB_14 + QueueJobB_15 + QueueJobB_16 + QueueJobB_17 + QueueJobB_18 + QueueJobB_19 + QueueJobB_20 + QueueJobB_21 + QueueJobB_22 + QueueJobB_23 + QueueJobB_24 + QueueJobB_25 + QueueJobB_26 + QueueJobB_27 + QueueJobB_28 + QueueJobB_29 + QueueJobB_30 + QueueJobB_31 + QueueJobB_32 + QueueJobB_33 + QueueJobB_34 + QueueJobB_35 + QueueJobB_36 + QueueJobB_37 + QueueJobB_38 + QueueJobB_39 + QueueJobB_40 + NotifyEventJobQueuedE_0 + NotifyEventJobQueuedB_0 + NotifyEventJobQueuedB_1 + NotifyEventJobQueuedB_2 + NotifyEventJobQueuedB_3 + NotifyEventJobQueuedB_4 + NotifyEventJobQueuedB_5 + NotifyEventJobQueuedB_6 + NotifyEventJobQueuedB_7 + NotifyEventJobQueuedB_8 + NotifyEventJobQueuedB_9 + NotifyEventJobQueuedB_10 + NotifyEventJobQueuedB_11 + NotifyEventJobQueuedB_12 + NotifyEventJobQueuedB_13 + NotifyEventJobQueuedB_14 + NotifyEventJobQueuedB_15 + NotifyEventJobQueuedB_16 + NotifyEventJobQueuedB_17 + NotifyEventJobQueuedB_18 + NotifyEventJobQueuedB_19 + NotifyEventJobQueuedB_20 + NotifyEventJobQueuedB_21 + NotifyEventJobQueuedB_22 + NotifyEventJobQueuedB_23 + NotifyEventJobQueuedB_24 + NotifyEventJobQueuedB_25 + NotifyEventJobQueuedB_26 + NotifyEventJobQueuedB_27 + NotifyEventJobQueuedB_28 + NotifyEventJobQueuedB_29 + NotifyEventJobQueuedB_30 + NotifyEventJobQueuedB_31 + NotifyEventJobQueuedB_32 + NotifyEventJobQueuedB_33 + NotifyEventJobQueuedB_34 + NotifyEventJobQueuedB_35 + NotifyEventJobQueuedB_36 + NotifyEventJobQueuedB_37 + NotifyEventJobQueuedB_38 + NotifyEventJobQueuedB_39 + NotifyEventJobQueuedB_40 + place_482_0 + place_482_1 + place_482_2 + place_482_3 + place_482_4 - place_462_0 - place_460_0 - place_458_0 - place_456_0 = 0
inv : CreatedJobs_10 + CreatedJobs_11 + CreatedJobs_12 + CreatedJobs_13 + CreatedJobs_14 + AvailableJobId_2 = 1
inv : FetchJobE_4 + QueueJobB_4 + f3_4 + f2_4 + f1_4 + NotifyEventJobQueuedB_4 + AvailableJobId_4 = 1
inv : CreatedJobs_150 + CreatedJobs_151 + CreatedJobs_152 + CreatedJobs_153 + CreatedJobs_154 + AvailableJobId_30 = 1
inv : 3*place_523_0 + 4*place_522_0 + 6*place_521_0 + 12*place_520_0 + 12*place_518_0 + 12*place_500_0 + 3*place_462_0 + 4*place_460_0 + 6*place_458_0 + 12*place_456_0 + 12*Check_Sources_E_0 + 12*CanInjectEvent_0 = 12
inv : CreatedJobs_110 + CreatedJobs_111 + CreatedJobs_112 + CreatedJobs_113 + CreatedJobs_114 + AvailableJobId_22 = 1
inv : FetchJobE_37 + QueueJobB_37 + f3_37 + f2_37 + f1_37 + NotifyEventJobQueuedB_37 + AvailableJobId_37 = 1
inv : JobCnt_0 + cJobCnt_0 = 10
inv : CreatedJobs_50 + CreatedJobs_51 + CreatedJobs_52 + CreatedJobs_53 + CreatedJobs_54 + AvailableJobId_10 = 1
inv : ModifiedSrc_4 + CreatedJobs_4 + CreatedJobs_9 + CreatedJobs_14 + CreatedJobs_19 + CreatedJobs_24 + CreatedJobs_29 + CreatedJobs_34 + CreatedJobs_39 + CreatedJobs_44 + CreatedJobs_49 + CreatedJobs_54 + CreatedJobs_59 + CreatedJobs_64 + CreatedJobs_69 + CreatedJobs_74 + CreatedJobs_79 + CreatedJobs_84 + CreatedJobs_89 + CreatedJobs_94 + CreatedJobs_99 + CreatedJobs_104 + CreatedJobs_109 + CreatedJobs_114 + CreatedJobs_119 + CreatedJobs_124 + CreatedJobs_129 + CreatedJobs_134 + CreatedJobs_139 + CreatedJobs_144 + CreatedJobs_149 + CreatedJobs_154 + CreatedJobs_159 + CreatedJobs_164 + CreatedJobs_169 + CreatedJobs_174 + CreatedJobs_179 + CreatedJobs_184 + CreatedJobs_189 + CreatedJobs_194 + CreatedJobs_199 + CreatedJobs_204 + place_482_4 + TheSour_4 = 1
inv : FetchJobE_20 + QueueJobB_20 + f3_20 + f2_20 + f1_20 + NotifyEventJobQueuedB_20 + AvailableJobId_20 = 1
inv : FetchJobE_36 + QueueJobB_36 + f3_36 + f2_36 + f1_36 + NotifyEventJobQueuedB_36 + AvailableJobId_36 = 1
inv : ModifiedSrc_0 - CreatedJobs_1 - CreatedJobs_2 - CreatedJobs_3 - CreatedJobs_4 - CreatedJobs_6 - CreatedJobs_7 - CreatedJobs_8 - CreatedJobs_9 - CreatedJobs_11 - CreatedJobs_12 - CreatedJobs_13 - CreatedJobs_14 - CreatedJobs_16 - CreatedJobs_17 - CreatedJobs_18 - CreatedJobs_19 - CreatedJobs_21 - CreatedJobs_22 - CreatedJobs_23 - CreatedJobs_24 - CreatedJobs_26 - CreatedJobs_27 - CreatedJobs_28 - CreatedJobs_29 - CreatedJobs_31 - CreatedJobs_32 - CreatedJobs_33 - CreatedJobs_34 - CreatedJobs_36 - CreatedJobs_37 - CreatedJobs_38 - CreatedJobs_39 - CreatedJobs_41 - CreatedJobs_42 - CreatedJobs_43 - CreatedJobs_44 - CreatedJobs_46 - CreatedJobs_47 - CreatedJobs_48 - CreatedJobs_49 - CreatedJobs_51 - CreatedJobs_52 - CreatedJobs_53 - CreatedJobs_54 - CreatedJobs_56 - CreatedJobs_57 - CreatedJobs_58 - CreatedJobs_59 - CreatedJobs_61 - CreatedJobs_62 - CreatedJobs_63 - CreatedJobs_64 - CreatedJobs_66 - CreatedJobs_67 - CreatedJobs_68 - CreatedJobs_69 - CreatedJobs_71 - CreatedJobs_72 - CreatedJobs_73 - CreatedJobs_74 - CreatedJobs_76 - CreatedJobs_77 - CreatedJobs_78 - CreatedJobs_79 - CreatedJobs_81 - CreatedJobs_82 - CreatedJobs_83 - CreatedJobs_84 - CreatedJobs_86 - CreatedJobs_87 - CreatedJobs_88 - CreatedJobs_89 - CreatedJobs_91 - CreatedJobs_92 - CreatedJobs_93 - CreatedJobs_94 - CreatedJobs_96 - CreatedJobs_97 - CreatedJobs_98 - CreatedJobs_99 - CreatedJobs_101 - CreatedJobs_102 - CreatedJobs_103 - CreatedJobs_104 - CreatedJobs_106 - CreatedJobs_107 - CreatedJobs_108 - CreatedJobs_109 - CreatedJobs_111 - CreatedJobs_112 - CreatedJobs_113 - CreatedJobs_114 - CreatedJobs_116 - CreatedJobs_117 - CreatedJobs_118 - CreatedJobs_119 - CreatedJobs_121 - CreatedJobs_122 - CreatedJobs_123 - CreatedJobs_124 - CreatedJobs_126 - CreatedJobs_127 - CreatedJobs_128 - CreatedJobs_129 - CreatedJobs_131 - CreatedJobs_132 - CreatedJobs_133 - CreatedJobs_134 - CreatedJobs_136 - CreatedJobs_137 - CreatedJobs_138 - CreatedJobs_139 - CreatedJobs_141 - CreatedJobs_142 - CreatedJobs_143 - CreatedJobs_144 - CreatedJobs_146 - CreatedJobs_147 - CreatedJobs_148 - CreatedJobs_149 - CreatedJobs_151 - CreatedJobs_152 - CreatedJobs_153 - CreatedJobs_154 - CreatedJobs_156 - CreatedJobs_157 - CreatedJobs_158 - CreatedJobs_159 - CreatedJobs_161 - CreatedJobs_162 - CreatedJobs_163 - CreatedJobs_164 - CreatedJobs_166 - CreatedJobs_167 - CreatedJobs_168 - CreatedJobs_169 - CreatedJobs_171 - CreatedJobs_172 - CreatedJobs_173 - CreatedJobs_174 - CreatedJobs_176 - CreatedJobs_177 - CreatedJobs_178 - CreatedJobs_179 - CreatedJobs_181 - CreatedJobs_182 - CreatedJobs_183 - CreatedJobs_184 - CreatedJobs_186 - CreatedJobs_187 - CreatedJobs_188 - CreatedJobs_189 - CreatedJobs_191 - CreatedJobs_192 - CreatedJobs_193 - CreatedJobs_194 - CreatedJobs_196 - CreatedJobs_197 - CreatedJobs_198 - CreatedJobs_199 - CreatedJobs_201 - CreatedJobs_202 - CreatedJobs_203 - CreatedJobs_204 + place_482_0 - AvailableJobId_0 - AvailableJobId_1 - AvailableJobId_2 - AvailableJobId_3 - AvailableJobId_4 - AvailableJobId_5 - AvailableJobId_6 - AvailableJobId_7 - AvailableJobId_8 - AvailableJobId_9 - AvailableJobId_10 - AvailableJobId_11 - AvailableJobId_12 - AvailableJobId_13 - AvailableJobId_14 - AvailableJobId_15 - AvailableJobId_16 - AvailableJobId_17 - AvailableJobId_18 - AvailableJobId_19 - AvailableJobId_20 - AvailableJobId_21 - AvailableJobId_22 - AvailableJobId_23 - AvailableJobId_24 - AvailableJobId_25 - AvailableJobId_26 - AvailableJobId_27 - AvailableJobId_28 - AvailableJobId_29 - AvailableJobId_30 - AvailableJobId_31 - AvailableJobId_32 - AvailableJobId_33 - AvailableJobId_34 - AvailableJobId_35 - AvailableJobId_36 - AvailableJobId_37 - AvailableJobId_38 - AvailableJobId_39 - AvailableJobId_40 + TheSour_0 = -40
Total of 97 invariants.
[2022-06-13 01:46:53] [INFO ] Computed 97 place invariants in 18 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 5937
[2022-06-13 01:46:54] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(UNSAT) depth K=2 took 579 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5937 after 106742
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :106742 after 112979
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :112979 after 131284
[2022-06-13 01:46:55] [INFO ] Proved 536 variables to be positive in 1634 ms
[2022-06-13 01:46:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityFireability-15
[2022-06-13 01:46:55] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(SAT) depth K=0 took 163 ms
[2022-06-13 01:46:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityFireability-15
[2022-06-13 01:46:56] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(SAT) depth K=1 took 784 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :131284 after 345758
Compilation finished in 6829 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5528049682142372588]
Link finished in 76 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTCOLS05J40ReachabilityFireability15==true], workingDir=/tmp/ltsmin5528049682142372588]
[2022-06-13 01:47:06] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(UNSAT) depth K=3 took 11833 ms
[2022-06-13 01:48:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityFireability-15
[2022-06-13 01:48:39] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(SAT) depth K=2 took 103347 ms
[2022-06-13 01:54:02] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(UNSAT) depth K=4 took 416790 ms
[2022-06-13 02:04:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityFireability-15
[2022-06-13 02:04:31] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(SAT) depth K=3 took 951764 ms
[2022-06-13 02:04:44] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(UNSAT) depth K=5 took 641365 ms
Detected timeout of ITS tools.
[2022-06-13 02:08:07] [INFO ] Applying decomposition
[2022-06-13 02:08:07] [INFO ] Flatten gal took : 95 ms
[2022-06-13 02:08:07] [INFO ] Decomposing Gal with order
[2022-06-13 02:08:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 02:08:08] [INFO ] Removed a total of 2721 redundant transitions.
[2022-06-13 02:08:08] [INFO ] Flatten gal took : 329 ms
[2022-06-13 02:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2022-06-13 02:08:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14477802791511816069.gal : 39 ms
[2022-06-13 02:08:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7423071783902480433.prop : 9 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability14477802791511816069.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability7423071783902480433.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability14477802791511816069.gal -t CGAL -reachable-file /tmp/ReachabilityFireability7423071783902480433.prop --nowitness
Loading property file /tmp/ReachabilityFireability7423071783902480433.prop.
[2022-06-13 02:19:24] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(UNSAT) depth K=6 took 880357 ms
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.104: Initializing POR dependencies: labels 753, guards 752
pins2lts-mc-linux64( 2/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 3.394: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 3.461: "PolyORBNTCOLS05J40ReachabilityFireability15==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 3.445: "PolyORBNTCOLS05J40ReachabilityFireability15==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 3.453: "PolyORBNTCOLS05J40ReachabilityFireability15==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 3.461: "PolyORBNTCOLS05J40ReachabilityFireability15==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 3.445: "PolyORBNTCOLS05J40ReachabilityFireability15==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 3.445: "PolyORBNTCOLS05J40ReachabilityFireability15==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 3.445: "PolyORBNTCOLS05J40ReachabilityFireability15==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.458: "PolyORBNTCOLS05J40ReachabilityFireability15==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.461: There are 753 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.461: State length is 536, there are 752 groups
pins2lts-mc-linux64( 0/ 8), 3.461: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.461: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.461: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 3.461: Visible groups: 48 / 752, labels: 1 / 753
pins2lts-mc-linux64( 0/ 8), 3.461: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 3.461: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 3.867: ~7 levels ~960 states ~3440 transitions
pins2lts-mc-linux64( 0/ 8), 3.885: ~8 levels ~1920 states ~4400 transitions
pins2lts-mc-linux64( 0/ 8), 4.247: ~9 levels ~3840 states ~33536 transitions
pins2lts-mc-linux64( 0/ 8), 4.725: ~9 levels ~7680 states ~57064 transitions
pins2lts-mc-linux64( 0/ 8), 5.144: ~9 levels ~15360 states ~79600 transitions
pins2lts-mc-linux64( 6/ 8), 7.639: ~4 levels ~30720 states ~216136 transitions
pins2lts-mc-linux64( 6/ 8), 9.959: ~5 levels ~61440 states ~331864 transitions
pins2lts-mc-linux64( 6/ 8), 15.880: ~5 levels ~122880 states ~513400 transitions
pins2lts-mc-linux64( 6/ 8), 26.958: ~6 levels ~245760 states ~849920 transitions
pins2lts-mc-linux64( 6/ 8), 43.413: ~7 levels ~491520 states ~1470432 transitions
pins2lts-mc-linux64( 6/ 8), 57.803: ~9 levels ~983040 states ~2203032 transitions
pins2lts-mc-linux64( 6/ 8), 98.131: ~15 levels ~1966080 states ~4148344 transitions
pins2lts-mc-linux64( 6/ 8), 243.719: ~18 levels ~3932160 states ~9348984 transitions
pins2lts-mc-linux64( 6/ 8), 561.678: ~35 levels ~7864320 states ~21435800 transitions
pins2lts-mc-linux64( 6/ 8), 902.846: ~39 levels ~15728640 states ~37415024 transitions
pins2lts-mc-linux64( 6/ 8), 1865.070: ~66 levels ~31457280 states ~78565960 transitions
pins2lts-mc-linux64( 5/ 8), 2451.905: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2452.042:
pins2lts-mc-linux64( 0/ 8), 2452.042: mean standard work distribution: 63.2% (states) 15.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 2452.042:
pins2lts-mc-linux64( 0/ 8), 2452.042: Explored 16705238 states 113035468 transitions, fanout: 6.766
pins2lts-mc-linux64( 0/ 8), 2452.042: Total exploration time 2448.580 sec (2448.460 sec minimum, 2448.479 sec on average)
pins2lts-mc-linux64( 0/ 8), 2452.042: States per second: 6822, Transitions per second: 46164
pins2lts-mc-linux64( 0/ 8), 2452.042: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 2452.042:
pins2lts-mc-linux64( 0/ 8), 2452.042: Queue width: 8B, total height: 22315280, memory: 170.25MB
pins2lts-mc-linux64( 0/ 8), 2452.042: Tree memory: 553.7MB, 14.9 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 2452.042: Tree fill ratio (roots/leafs): 29.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2452.042: Stored 759 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2452.042: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2452.042: Est. total memory use: 724.0MB (~1194.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTCOLS05J40ReachabilityFireability15==true], workingDir=/tmp/ltsmin5528049682142372588]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTCOLS05J40ReachabilityFireability15==true], workingDir=/tmp/ltsmin5528049682142372588]
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.
[2022-06-13 02:29:22] [INFO ] Flatten gal took : 31 ms
[2022-06-13 02:29:22] [INFO ] Input system was already deterministic with 752 transitions.
[2022-06-13 02:29:22] [INFO ] Transformed 536 places.
[2022-06-13 02:29:22] [INFO ] Transformed 752 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-13 02:29:53] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6544996572705456760.gal : 3 ms
[2022-06-13 02:29:53] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1532961876041108691.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability6544996572705456760.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability1532961876041108691.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability6544996572705456760.gal -t CGAL -reachable-file /tmp/ReachabilityFireability1532961876041108691.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability1532961876041108691.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 211
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :211 after 264
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :264 after 17533
[2022-06-13 02:34:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityFireability-15
[2022-06-13 02:34:13] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(SAT) depth K=4 took 1781248 ms
[2022-06-13 02:40:26] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityFireability-15(UNSAT) depth K=7 took 1261599 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is PolyORBNT-COL-S05J40, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277027100282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;