fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r126-tajo-158961390700638
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for PolyORBNT-PT-S05J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.610 3600000.00 10526915.00 6166.80 FTTF?TFFTTFTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390700638.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-PT-S05J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390700638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.5K Apr 12 05:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 05:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 05:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 11 05:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 10 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 10 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 9 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 9 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 24 05:37 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-PT-S05J20-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589843100371

[2020-05-18 23:05:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 23:05:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 23:05:02] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2020-05-18 23:05:02] [INFO ] Transformed 349 places.
[2020-05-18 23:05:02] [INFO ] Transformed 1210 transitions.
[2020-05-18 23:05:02] [INFO ] Parsed PT model containing 349 places and 1210 transitions in 216 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 703 resets, run finished after 115 ms. (steps per millisecond=86 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-18 23:05:02] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2020-05-18 23:05:02] [INFO ] Computed 62 place invariants in 42 ms
[2020-05-18 23:05:03] [INFO ] [Real]Absence check using 42 positive place invariants in 29 ms returned sat
[2020-05-18 23:05:03] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 13 ms returned unsat
[2020-05-18 23:05:03] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2020-05-18 23:05:03] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 18 ms returned sat
[2020-05-18 23:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:03] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2020-05-18 23:05:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:05:03] [INFO ] [Nat]Absence check using 42 positive place invariants in 24 ms returned sat
[2020-05-18 23:05:03] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 20 ms returned sat
[2020-05-18 23:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:04] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2020-05-18 23:05:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 23:05:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 284 ms returned sat
[2020-05-18 23:05:05] [INFO ] Deduced a trap composed of 205 places in 242 ms
[2020-05-18 23:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 592 ms
[2020-05-18 23:05:05] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2020-05-18 23:05:05] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 29 ms returned sat
[2020-05-18 23:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:06] [INFO ] [Real]Absence check using state equation in 1009 ms returned sat
[2020-05-18 23:05:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:05:06] [INFO ] [Nat]Absence check using 42 positive place invariants in 25 ms returned sat
[2020-05-18 23:05:06] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 27 ms returned sat
[2020-05-18 23:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:09] [INFO ] [Nat]Absence check using state equation in 2786 ms returned sat
[2020-05-18 23:05:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2020-05-18 23:05:09] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 80 ms.
[2020-05-18 23:05:10] [INFO ] Added : 33 causal constraints over 7 iterations in 868 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-05-18 23:05:10] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned unsat
[2020-05-18 23:05:10] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2020-05-18 23:05:10] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 21 ms returned sat
[2020-05-18 23:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:11] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2020-05-18 23:05:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:05:11] [INFO ] [Nat]Absence check using 42 positive place invariants in 42 ms returned sat
[2020-05-18 23:05:11] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 28 ms returned unsat
[2020-05-18 23:05:11] [INFO ] [Real]Absence check using 42 positive place invariants in 61 ms returned sat
[2020-05-18 23:05:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 32 ms returned sat
[2020-05-18 23:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:12] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2020-05-18 23:05:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:05:12] [INFO ] [Nat]Absence check using 42 positive place invariants in 27 ms returned sat
[2020-05-18 23:05:12] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 28 ms returned sat
[2020-05-18 23:05:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 23:05:17] [INFO ] [Nat]Absence check using state equation in 4906 ms returned (error "Solver has unexpectedly terminated")
[2020-05-18 23:05:17] [INFO ] [Real]Absence check using 42 positive place invariants in 29 ms returned sat
[2020-05-18 23:05:17] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 24 ms returned sat
[2020-05-18 23:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:18] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2020-05-18 23:05:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:05:18] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2020-05-18 23:05:18] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 19 ms returned sat
[2020-05-18 23:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:05:20] [INFO ] [Nat]Absence check using state equation in 1861 ms returned sat
[2020-05-18 23:05:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2020-05-18 23:05:20] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 69 ms.
[2020-05-18 23:05:22] [INFO ] Added : 23 causal constraints over 5 iterations in 1883 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-05-18 23:05:22] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2020-05-18 23:05:22] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 6 ms returned unsat
[2020-05-18 23:05:22] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2020-05-18 23:05:22] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned unsat
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 3000 steps, including 289 resets, run finished after 41 ms. (steps per millisecond=73 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 5100 steps, including 243 resets, run finished after 34 ms. (steps per millisecond=150 ) properties seen :[0, 0] could not realise parikh vector
Support contains 134 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 344 transition count 531
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 53 place count 320 transition count 531
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 53 place count 320 transition count 509
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 97 place count 298 transition count 509
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 298 transition count 509
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 297 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 295 transition count 506
Applied a total of 104 rules in 125 ms. Remains 295 /349 variables (removed 54) and now considering 506/555 (removed 49) transitions.
[2020-05-18 23:05:22] [INFO ] Flow matrix only has 502 transitions (discarded 4 similar events)
// Phase 1: matrix 502 rows 295 cols
[2020-05-18 23:05:22] [INFO ] Computed 57 place invariants in 19 ms
[2020-05-18 23:05:23] [INFO ] Dead Transitions using invariants and state equation in 865 ms returned [273, 274, 275, 277, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 291, 292, 293, 294, 296, 297, 298, 299, 300, 303, 304, 305, 306, 307, 309, 310, 311, 312, 313, 314, 315, 316, 318, 319, 320, 321, 322, 323, 325, 326, 328, 329, 332, 333, 335, 336, 337, 338, 340, 341, 342, 343, 344, 346, 347, 348, 349, 350, 351, 352, 354, 355, 356, 357, 360, 361, 362, 363, 365, 366, 369, 370, 371, 372, 373, 374, 375, 377, 381, 384, 385, 386, 388, 390, 391, 392, 393, 394, 395, 396]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[396, 395, 394, 393, 392, 391, 390, 388, 386, 385, 384, 381, 377, 375, 374, 373, 372, 371, 370, 369, 366, 365, 363, 362, 361, 360, 357, 356, 355, 354, 352, 351, 350, 349, 348, 347, 346, 344, 343, 342, 341, 340, 338, 337, 336, 335, 333, 332, 329, 328, 326, 325, 323, 322, 321, 320, 319, 318, 316, 315, 314, 313, 312, 311, 310, 309, 307, 306, 305, 304, 303, 300, 299, 298, 297, 296, 294, 293, 292, 291, 289, 288, 287, 286, 285, 284, 283, 282, 281, 280, 279, 277, 275, 274, 273]
Starting structural reductions, iteration 1 : 295/349 places, 411/555 transitions.
Applied a total of 0 rules in 20 ms. Remains 295 /295 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 295/349 places, 411/555 transitions.
Incomplete random walk after 1000000 steps, including 74347 resets, run finished after 2654 ms. (steps per millisecond=376 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 31250 resets, run finished after 2649 ms. (steps per millisecond=377 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19070 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 6440925 steps, run timeout after 30001 ms. (steps per millisecond=214 ) properties seen :[0, 0]
Probabilistic random walk after 6440925 steps, saw 1714360 distinct states, run finished after 30001 ms. (steps per millisecond=214 ) properties seen :[0, 0]
[2020-05-18 23:06:00] [INFO ] Flow matrix only has 407 transitions (discarded 4 similar events)
// Phase 1: matrix 407 rows 295 cols
[2020-05-18 23:06:00] [INFO ] Computed 57 place invariants in 9 ms
[2020-05-18 23:06:00] [INFO ] [Real]Absence check using 44 positive place invariants in 24 ms returned sat
[2020-05-18 23:06:00] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 13 ms returned sat
[2020-05-18 23:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:06:00] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-05-18 23:06:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:06:00] [INFO ] [Nat]Absence check using 44 positive place invariants in 22 ms returned sat
[2020-05-18 23:06:00] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 15 ms returned sat
[2020-05-18 23:06:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:06:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 23:06:09] [INFO ] [Nat]Absence check using state equation in 9282 ms returned unknown
[2020-05-18 23:06:09] [INFO ] [Real]Absence check using 44 positive place invariants in 21 ms returned sat
[2020-05-18 23:06:09] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 13 ms returned sat
[2020-05-18 23:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:06:10] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2020-05-18 23:06:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:06:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 31 ms returned sat
[2020-05-18 23:06:10] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 10 ms returned sat
[2020-05-18 23:06:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:06:11] [INFO ] [Nat]Absence check using state equation in 1023 ms returned unsat
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 131 out of 295 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 295/295 places, 411/411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 295 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 294 transition count 410
Applied a total of 2 rules in 17 ms. Remains 294 /295 variables (removed 1) and now considering 410/411 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/295 places, 410/411 transitions.
Incomplete random walk after 1000000 steps, including 72761 resets, run finished after 2537 ms. (steps per millisecond=394 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 32258 resets, run finished after 1958 ms. (steps per millisecond=510 ) properties seen :[0]
Interrupted probabilistic random walk after 7131062 steps, run timeout after 30001 ms. (steps per millisecond=237 ) properties seen :[0]
Probabilistic random walk after 7131062 steps, saw 1903895 distinct states, run finished after 30001 ms. (steps per millisecond=237 ) properties seen :[0]
[2020-05-18 23:06:46] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-05-18 23:06:46] [INFO ] Computed 57 place invariants in 5 ms
[2020-05-18 23:06:46] [INFO ] [Real]Absence check using 44 positive place invariants in 33 ms returned sat
[2020-05-18 23:06:46] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 21 ms returned sat
[2020-05-18 23:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:06:46] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2020-05-18 23:06:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:06:46] [INFO ] [Nat]Absence check using 44 positive place invariants in 35 ms returned sat
[2020-05-18 23:06:46] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 22 ms returned sat
[2020-05-18 23:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:06:47] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2020-05-18 23:06:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 23:06:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 647 ms returned sat
[2020-05-18 23:06:48] [INFO ] Deduced a trap composed of 96 places in 177 ms
[2020-05-18 23:06:48] [INFO ] Deduced a trap composed of 93 places in 169 ms
[2020-05-18 23:06:48] [INFO ] Deduced a trap composed of 92 places in 181 ms
[2020-05-18 23:06:48] [INFO ] Deduced a trap composed of 91 places in 155 ms
[2020-05-18 23:06:48] [INFO ] Deduced a trap composed of 98 places in 164 ms
[2020-05-18 23:06:49] [INFO ] Deduced a trap composed of 98 places in 173 ms
[2020-05-18 23:06:49] [INFO ] Deduced a trap composed of 92 places in 137 ms
[2020-05-18 23:06:49] [INFO ] Deduced a trap composed of 95 places in 129 ms
[2020-05-18 23:06:49] [INFO ] Deduced a trap composed of 103 places in 145 ms
[2020-05-18 23:06:49] [INFO ] Deduced a trap composed of 98 places in 137 ms
[2020-05-18 23:06:50] [INFO ] Deduced a trap composed of 92 places in 140 ms
[2020-05-18 23:06:50] [INFO ] Deduced a trap composed of 89 places in 147 ms
[2020-05-18 23:06:50] [INFO ] Deduced a trap composed of 103 places in 144 ms
[2020-05-18 23:06:50] [INFO ] Deduced a trap composed of 93 places in 149 ms
[2020-05-18 23:06:50] [INFO ] Deduced a trap composed of 87 places in 138 ms
[2020-05-18 23:06:51] [INFO ] Deduced a trap composed of 95 places in 184 ms
[2020-05-18 23:06:51] [INFO ] Deduced a trap composed of 98 places in 164 ms
[2020-05-18 23:06:51] [INFO ] Deduced a trap composed of 93 places in 138 ms
[2020-05-18 23:06:51] [INFO ] Deduced a trap composed of 92 places in 174 ms
[2020-05-18 23:06:51] [INFO ] Deduced a trap composed of 98 places in 166 ms
[2020-05-18 23:06:52] [INFO ] Deduced a trap composed of 91 places in 157 ms
[2020-05-18 23:06:52] [INFO ] Deduced a trap composed of 100 places in 169 ms
[2020-05-18 23:06:52] [INFO ] Deduced a trap composed of 96 places in 133 ms
[2020-05-18 23:06:52] [INFO ] Deduced a trap composed of 89 places in 148 ms
[2020-05-18 23:06:52] [INFO ] Deduced a trap composed of 97 places in 139 ms
[2020-05-18 23:06:53] [INFO ] Deduced a trap composed of 98 places in 161 ms
[2020-05-18 23:06:53] [INFO ] Deduced a trap composed of 93 places in 195 ms
[2020-05-18 23:06:53] [INFO ] Deduced a trap composed of 87 places in 148 ms
[2020-05-18 23:06:53] [INFO ] Deduced a trap composed of 99 places in 130 ms
[2020-05-18 23:06:53] [INFO ] Deduced a trap composed of 104 places in 174 ms
[2020-05-18 23:06:54] [INFO ] Deduced a trap composed of 91 places in 147 ms
[2020-05-18 23:06:54] [INFO ] Deduced a trap composed of 96 places in 161 ms
[2020-05-18 23:06:54] [INFO ] Deduced a trap composed of 88 places in 158 ms
[2020-05-18 23:06:54] [INFO ] Deduced a trap composed of 98 places in 159 ms
[2020-05-18 23:06:55] [INFO ] Deduced a trap composed of 95 places in 167 ms
[2020-05-18 23:06:55] [INFO ] Deduced a trap composed of 102 places in 156 ms
[2020-05-18 23:06:55] [INFO ] Deduced a trap composed of 98 places in 161 ms
[2020-05-18 23:06:55] [INFO ] Deduced a trap composed of 95 places in 132 ms
[2020-05-18 23:06:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 23:07:32] [INFO ] Deduced a trap composed of 2 places in 232 ms
[2020-05-18 23:07:32] [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 closed (> (+ s12 s287) 0)") while checking expression at index 0
Support contains 131 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 410/410 transitions.
Applied a total of 0 rules in 16 ms. Remains 294 /294 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 410/410 transitions.
Starting structural reductions, iteration 0 : 294/294 places, 410/410 transitions.
Applied a total of 0 rules in 15 ms. Remains 294 /294 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2020-05-18 23:07:32] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-05-18 23:07:32] [INFO ] Computed 57 place invariants in 7 ms
[2020-05-18 23:07:32] [INFO ] Implicit Places using invariants in 457 ms returned []
[2020-05-18 23:07:32] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-05-18 23:07:32] [INFO ] Computed 57 place invariants in 22 ms
[2020-05-18 23:07:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 23:07:34] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2474 ms to find 0 implicit places.
[2020-05-18 23:07:34] [INFO ] Redundant transitions in 51 ms returned []
[2020-05-18 23:07:34] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-05-18 23:07:34] [INFO ] Computed 57 place invariants in 9 ms
[2020-05-18 23:07:35] [INFO ] Dead Transitions using invariants and state equation in 685 ms returned []
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 410/410 transitions.
Incomplete random walk after 100000 steps, including 7232 resets, run finished after 403 ms. (steps per millisecond=248 ) properties seen :[0]
[2020-05-18 23:07:35] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2020-05-18 23:07:35] [INFO ] Computed 57 place invariants in 6 ms
[2020-05-18 23:07:35] [INFO ] [Real]Absence check using 44 positive place invariants in 33 ms returned sat
[2020-05-18 23:07:35] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 21 ms returned sat
[2020-05-18 23:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:07:36] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2020-05-18 23:07:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:07:36] [INFO ] [Nat]Absence check using 44 positive place invariants in 34 ms returned sat
[2020-05-18 23:07:36] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 22 ms returned sat
[2020-05-18 23:07:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:07:36] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2020-05-18 23:07:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 23:07:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 485 ms returned sat
[2020-05-18 23:07:37] [INFO ] Deduced a trap composed of 96 places in 145 ms
[2020-05-18 23:07:37] [INFO ] Deduced a trap composed of 93 places in 126 ms
[2020-05-18 23:07:37] [INFO ] Deduced a trap composed of 92 places in 125 ms
[2020-05-18 23:07:37] [INFO ] Deduced a trap composed of 91 places in 128 ms
[2020-05-18 23:07:38] [INFO ] Deduced a trap composed of 98 places in 126 ms
[2020-05-18 23:07:38] [INFO ] Deduced a trap composed of 98 places in 133 ms
[2020-05-18 23:07:38] [INFO ] Deduced a trap composed of 92 places in 145 ms
[2020-05-18 23:07:38] [INFO ] Deduced a trap composed of 95 places in 152 ms
[2020-05-18 23:07:38] [INFO ] Deduced a trap composed of 103 places in 114 ms
[2020-05-18 23:07:38] [INFO ] Deduced a trap composed of 98 places in 146 ms
[2020-05-18 23:07:39] [INFO ] Deduced a trap composed of 92 places in 112 ms
[2020-05-18 23:07:39] [INFO ] Deduced a trap composed of 89 places in 107 ms
[2020-05-18 23:07:39] [INFO ] Deduced a trap composed of 103 places in 175 ms
[2020-05-18 23:07:39] [INFO ] Deduced a trap composed of 93 places in 153 ms
[2020-05-18 23:07:39] [INFO ] Deduced a trap composed of 87 places in 124 ms
[2020-05-18 23:07:40] [INFO ] Deduced a trap composed of 95 places in 157 ms
[2020-05-18 23:07:40] [INFO ] Deduced a trap composed of 98 places in 146 ms
[2020-05-18 23:07:40] [INFO ] Deduced a trap composed of 93 places in 123 ms
[2020-05-18 23:07:40] [INFO ] Deduced a trap composed of 92 places in 165 ms
[2020-05-18 23:07:40] [INFO ] Deduced a trap composed of 98 places in 168 ms
[2020-05-18 23:07:41] [INFO ] Deduced a trap composed of 91 places in 159 ms
[2020-05-18 23:07:41] [INFO ] Deduced a trap composed of 100 places in 162 ms
[2020-05-18 23:07:41] [INFO ] Deduced a trap composed of 96 places in 143 ms
[2020-05-18 23:07:41] [INFO ] Deduced a trap composed of 89 places in 157 ms
[2020-05-18 23:07:41] [INFO ] Deduced a trap composed of 97 places in 116 ms
[2020-05-18 23:07:41] [INFO ] Deduced a trap composed of 98 places in 120 ms
[2020-05-18 23:07:42] [INFO ] Deduced a trap composed of 93 places in 162 ms
[2020-05-18 23:07:42] [INFO ] Deduced a trap composed of 87 places in 120 ms
[2020-05-18 23:07:42] [INFO ] Deduced a trap composed of 99 places in 153 ms
[2020-05-18 23:07:42] [INFO ] Deduced a trap composed of 104 places in 153 ms
[2020-05-18 23:07:42] [INFO ] Deduced a trap composed of 91 places in 117 ms
[2020-05-18 23:07:43] [INFO ] Deduced a trap composed of 96 places in 156 ms
[2020-05-18 23:07:43] [INFO ] Deduced a trap composed of 88 places in 163 ms
[2020-05-18 23:07:43] [INFO ] Deduced a trap composed of 98 places in 128 ms
[2020-05-18 23:07:43] [INFO ] Deduced a trap composed of 95 places in 160 ms
[2020-05-18 23:07:44] [INFO ] Deduced a trap composed of 102 places in 164 ms
[2020-05-18 23:07:44] [INFO ] Deduced a trap composed of 98 places in 121 ms
[2020-05-18 23:07:44] [INFO ] Deduced a trap composed of 95 places in 119 ms
[2020-05-18 23:07:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 23:07:56] [INFO ] Deduced a trap composed of 2 places in 222 ms
[2020-05-18 23:07:56] [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 closed (> (+ s12 s287) 0)") while checking expression at index 0
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 294 transition count 406
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 294 transition count 401
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 289 transition count 401
Applied a total of 14 rules in 24 ms. Remains 289 /294 variables (removed 5) and now considering 401/410 (removed 9) transitions.
// Phase 1: matrix 401 rows 289 cols
[2020-05-18 23:07:56] [INFO ] Computed 57 place invariants in 6 ms
[2020-05-18 23:07:56] [INFO ] [Real]Absence check using 43 positive place invariants in 28 ms returned sat
[2020-05-18 23:07:56] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 18 ms returned sat
[2020-05-18 23:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 23:07:57] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2020-05-18 23:07:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 23:07:57] [INFO ] [Nat]Absence check using 43 positive place invariants in 32 ms returned sat
[2020-05-18 23:07:57] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 32 ms returned sat
[2020-05-18 23:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 23:07:58] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2020-05-18 23:07:58] [INFO ] Deduced a trap composed of 86 places in 161 ms
[2020-05-18 23:07:58] [INFO ] Deduced a trap composed of 93 places in 129 ms
[2020-05-18 23:07:58] [INFO ] Deduced a trap composed of 92 places in 141 ms
[2020-05-18 23:07:58] [INFO ] Deduced a trap composed of 95 places in 117 ms
[2020-05-18 23:08:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 23:08:03] [INFO ] Deduced a trap composed of 89 places in 117 ms
[2020-05-18 23:08:03] [INFO ] Deduced a trap composed of 87 places in 146 ms
[2020-05-18 23:08:03] [INFO ] Deduced a trap composed of 86 places in 149 ms
[2020-05-18 23:08:04] [INFO ] Deduced a trap composed of 107 places in 170 ms
[2020-05-18 23:08:04] [INFO ] Deduced a trap composed of 98 places in 142 ms
[2020-05-18 23:08:04] [INFO ] Deduced a trap composed of 95 places in 191 ms
[2020-05-18 23:08:04] [INFO ] Deduced a trap composed of 95 places in 159 ms
[2020-05-18 23:08:05] [INFO ] Deduced a trap composed of 92 places in 186 ms
[2020-05-18 23:08:05] [INFO ] Deduced a trap composed of 98 places in 160 ms
[2020-05-18 23:08:05] [INFO ] Deduced a trap composed of 89 places in 157 ms
[2020-05-18 23:08:06] [INFO ] Deduced a trap composed of 109 places in 149 ms
[2020-05-18 23:08:06] [INFO ] Deduced a trap composed of 101 places in 169 ms
[2020-05-18 23:08:06] [INFO ] Deduced a trap composed of 92 places in 121 ms
[2020-05-18 23:08:07] [INFO ] Deduced a trap composed of 101 places in 155 ms
[2020-05-18 23:08:07] [INFO ] Deduced a trap composed of 92 places in 181 ms
[2020-05-18 23:08:07] [INFO ] Deduced a trap composed of 95 places in 165 ms
[2020-05-18 23:08:08] [INFO ] Deduced a trap composed of 101 places in 157 ms
[2020-05-18 23:08:08] [INFO ] Deduced a trap composed of 108 places in 153 ms
[2020-05-18 23:08:08] [INFO ] Deduced a trap composed of 89 places in 125 ms
[2020-05-18 23:08:08] [INFO ] Deduced a trap composed of 90 places in 160 ms
[2020-05-18 23:08:11] [INFO ] Deduced a trap composed of 98 places in 167 ms
[2020-05-18 23:08:11] [INFO ] Deduced a trap composed of 98 places in 150 ms
[2020-05-18 23:08:13] [INFO ] Deduced a trap composed of 111 places in 177 ms
[2020-05-18 23:08:14] [INFO ] Deduced a trap composed of 95 places in 180 ms
[2020-05-18 23:08:15] [INFO ] Deduced a trap composed of 93 places in 166 ms
[2020-05-18 23:08:15] [INFO ] Deduced a trap composed of 89 places in 167 ms
[2020-05-18 23:08:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 23:08:19] [INFO ] Deduced a trap composed of 83 places in 156 ms
[2020-05-18 23:08:20] [INFO ] Deduced a trap composed of 92 places in 166 ms
[2020-05-18 23:08:20] [INFO ] Deduced a trap composed of 92 places in 162 ms
[2020-05-18 23:08:21] [INFO ] Deduced a trap composed of 95 places in 167 ms
[2020-05-18 23:08:21] [INFO ] Deduced a trap composed of 92 places in 154 ms
[2020-05-18 23:08:22] [INFO ] Deduced a trap composed of 98 places in 166 ms
[2020-05-18 23:08:22] [INFO ] Deduced a trap composed of 101 places in 148 ms
[2020-05-18 23:08:22] [INFO ] Deduced a trap composed of 89 places in 171 ms
[2020-05-18 23:08:23] [INFO ] Deduced a trap composed of 89 places in 158 ms
[2020-05-18 23:08:23] [INFO ] Deduced a trap composed of 98 places in 159 ms
[2020-05-18 23:08:23] [INFO ] Deduced a trap composed of 92 places in 118 ms
[2020-05-18 23:08:24] [INFO ] Deduced a trap composed of 99 places in 151 ms
[2020-05-18 23:08:25] [INFO ] Deduced a trap composed of 84 places in 178 ms
[2020-05-18 23:08:25] [INFO ] Deduced a trap composed of 104 places in 152 ms
[2020-05-18 23:08:25] [INFO ] Deduced a trap composed of 96 places in 158 ms
[2020-05-18 23:08:26] [INFO ] Deduced a trap composed of 83 places in 166 ms
[2020-05-18 23:08:26] [INFO ] Deduced a trap composed of 99 places in 154 ms
[2020-05-18 23:08:26] [INFO ] Deduced a trap composed of 95 places in 114 ms
[2020-05-18 23:08:27] [INFO ] Deduced a trap composed of 98 places in 173 ms
[2020-05-18 23:08:28] [INFO ] Deduced a trap composed of 92 places in 164 ms
[2020-05-18 23:08:28] [INFO ] Deduced a trap composed of 92 places in 157 ms
[2020-05-18 23:08:28] [INFO ] Deduced a trap composed of 89 places in 162 ms
[2020-05-18 23:08:28] [INFO ] Deduced a trap composed of 92 places in 158 ms
[2020-05-18 23:08:28] [INFO ] Deduced a trap composed of 101 places in 174 ms
[2020-05-18 23:08:29] [INFO ] Deduced a trap composed of 92 places in 172 ms
[2020-05-18 23:08:29] [INFO ] Deduced a trap composed of 89 places in 170 ms
[2020-05-18 23:08:31] [INFO ] Deduced a trap composed of 98 places in 175 ms
[2020-05-18 23:08:32] [INFO ] Deduced a trap composed of 93 places in 169 ms
[2020-05-18 23:08:32] [INFO ] Deduced a trap composed of 98 places in 150 ms
[2020-05-18 23:08:32] [INFO ] Deduced a trap composed of 98 places in 132 ms
[2020-05-18 23:08:33] [INFO ] Deduced a trap composed of 102 places in 172 ms
[2020-05-18 23:08:33] [INFO ] Deduced a trap composed of 102 places in 148 ms
[2020-05-18 23:08:36] [INFO ] Deduced a trap composed of 96 places in 169 ms
[2020-05-18 23:08:37] [INFO ] Deduced a trap composed of 90 places in 173 ms
[2020-05-18 23:08:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 23:08:42] [INFO ] Deduced a trap composed of 99 places in 165 ms
[2020-05-18 23:08:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 23:08:42] [INFO ] Deduced a trap composed of 7 places in 167 ms
[2020-05-18 23:08:42] [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 closed (> (+ s0 s44 s69 s105 s159 s251 s276) 0)") while checking expression at index 0
[2020-05-18 23:08:42] [INFO ] Flatten gal took : 101 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 23:08:43] [INFO ] Applying decomposition
[2020-05-18 23:08:43] [INFO ] Flatten gal took : 130 ms
[2020-05-18 23:08:43] [INFO ] Input system was already deterministic with 410 transitions.
[2020-05-18 23:08:43] [INFO ] Input system was already deterministic with 410 transitions.
[2020-05-18 23:08:43] [INFO ] Flatten gal took : 106 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph4723331924916084808.txt, -o, /tmp/graph4723331924916084808.bin, -w, /tmp/graph4723331924916084808.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4723331924916084808.bin, -l, -1, -v, -w, /tmp/graph4723331924916084808.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 23:08:43] [INFO ] Decomposing Gal with order
[2020-05-18 23:08:43] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-18 23:08:43] [INFO ] Ran tautology test, simplified 0 / 1 in 295 ms.
Normalized transition count is 406 out of 410 initially.
// Phase 1: matrix 406 rows 294 cols
[2020-05-18 23:08:43] [INFO ] Computed 57 place invariants in 16 ms
inv : FetchJobE_1_11 + f2_11 + AvailableJobId_11 + NotifyEventJobQueuedB_1_11 + QueueJobB_1_11 + f3_11 + f1_11 = 1
inv : -CreatedJobs_7_4 + NotifyEventJobQueuedB_1_7 - CreatedJobs_7_5 + f3_7 - CreatedJobs_7_2 + f1_7 + FetchJobE_1_7 + f2_7 - CreatedJobs_7_1 - CreatedJobs_7_3 + QueueJobB_1_7 = 0
inv : CreatedJobs_19_4 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + AvailableJobId_19 + CreatedJobs_19_5 = 1
inv : CreatedJobs_3_1 + AvailableJobId_3 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_2 = 1
inv : 4*place_522_1 + 3*place_462 + 12*Check_Sources_E_1 + 12*CanInjectEvent + 12*place_456 + 4*place_460 + 3*place_523_1 + 6*place_458 + 6*place_521_1 = 12
inv : CreatedJobs_4_4 + AvailableJobId_4 + CreatedJobs_4_3 + CreatedJobs_4_2 + CreatedJobs_4_1 + CreatedJobs_4_5 = 1
inv : -2*f3_4 - 2*f3_13 - f2_16 - f2_2 - 2*f3_0 - f2_10 + mi1 - 2*f3_14 - 2*f3_7 - 2*f3_6 - 2*f3_1 - f2_11 - f2_15 - 2*f3_15 - f2_1 - 2*f3_20 - f2_18 - 2*f3_19 - f2_8 - f2_0 - f2_17 - 2*f3_9 - 2*f3_18 - f2_9 - mo1 - 2*f3_8 - f2_13 - 2*f3_17 - 2*f3_10 - f2_5 - 2*f3_3 - f2_19 - 2*f3_16 - 2*f3_2 - f2_12 - f2_7 - 2*f3_11 - f2_6 - f2_20 - f2_4 - 2*f3_5 - 2*f3_12 - block - f2_3 - f2_14 = -3
inv : NotifyEventJobQueuedB_1_14 + f3_14 + QueueJobB_1_14 + f1_14 + AvailableJobId_14 + FetchJobE_1_14 + f2_14 = 1
inv : 12*QueueJobB_1_8 - 12*AvailableJobId_16 - 12*f3_4 - 12*AvailableJobId_2 - 12*f2_16 - 12*f2_2 + 4*place_522_1 - 12*f2_10 - 12*AvailableJobId_10 + 3*place_462 + 12*QueueJobB_1_9 + 12*QueueJobB_1_15 - 12*f1_2 + 12*QueueJobB_1_1 - 12*f1_16 + 12*QueueJobB_1_14 - 12*f2_11 - 12*AvailableJobId_4 + 12*place_787_1 - 12*AvailableJobId_11 - 12*f2_18 - 12*NotifyEventJobQueuedB_1_11 + 12*FetchJobE_1_19 - 12*f1_3 + 12*Check_Sources_E_1 - 12*AvailableJobId_3 + 12*place_782_1 - 12*NotifyEventJobQueuedB_1_2 - 12*f2_17 - 12*f1_4 - 12*f3_18 - 12*NotifyEventJobQueuedB_1_10 + 12*Try_Check_Sources_B_1 + 12*FetchJobE_1_12 - 12*f1_5 + 12*Schedule_Task_B_1 - 12*NotifyEventJobQueuedB_1_17 + 12*QueueJobB_1_13 + 12*place_456 + 12*FetchJobE_1_0 - 12*NotifyEventJobQueuedB_1_18 + 12*FetchJobE_1_7 - 12*f3_17 - 12*f3_10 + 12*QueueJobB_1_12 + 12*Check_Sources_B_1 - 12*f2_5 - 12*f3_3 - 12*NotifyEventJobQueuedB_1_16 + 12*FetchJobE_1_1 + 12*FetchJobE_1_13 + 12*QueueJobB_1_6 + 12*QueueJobB_1_19 - 12*f3_16 + 12*FetchJobE_1_20 - 12*f3_2 - 12*f3_11 + 12*FetchJobE_1_6 - 12*NotifyEventJobQueuedB_1_3 - 12*NotifyEventJobQueuedB_1_4 - 12*f1_11 - 12*AvailableJobId_18 + 12*QueueJobB_1_20 - 12*AvailableJobId_5 + 4*place_460 + 12*FetchJobE_1_14 - 12*f1_17 - 12*f1_10 + 12*FetchJobE_1_9 - 12*f2_4 - 12*f3_5 + 12*FetchJobE_1_15 + 12*QueueJobB_1_7 + 12*QueueJobB_1_0 - 12*block - 12*NotifyEventJobQueuedB_1_5 + 3*place_523_1 - 12*f2_3 + 6*place_458 - 12*AvailableJobId_17 + 12*FetchJobE_1_8 - 12*f1_18 + 6*place_521_1 + 12*cJobCnt = -12
inv : CreatedJobs_8_2 + CreatedJobs_8_5 + CreatedJobs_8_1 + CreatedJobs_8_4 + AvailableJobId_8 + CreatedJobs_8_3 = 1
inv : CreatedJobs_20_5 + CreatedJobs_20_4 + AvailableJobId_20 + CreatedJobs_20_1 + CreatedJobs_20_3 + CreatedJobs_20_2 = 1
inv : -QueueJobB_1_8 + FetchJobB_1 - QueueJobB_1_18 - QueueJobB_1_16 - QueueJobB_1_2 - QueueJobB_1_9 - QueueJobB_1_15 - QueueJobB_1_1 - QueueJobB_1_14 - QueueJobB_1_3 - QueueJobB_1_4 - QueueJobB_1_13 - QueueJobB_1_5 - QueueJobB_1_12 - QueueJobB_1_6 - QueueJobB_1_19 - QueueJobB_1_11 - QueueJobB_1_20 - QueueJobB_1_17 - QueueJobB_1_10 - QueueJobB_1_7 - QueueJobB_1_0 + block - cJobCnt = -7
inv : CreatedJobs_14_4 + CreatedJobs_14_5 + CreatedJobs_14_3 + CreatedJobs_14_2 + AvailableJobId_14 + CreatedJobs_14_1 = 1
inv : CreatedJobs_7_4 + CreatedJobs_2_4 - CreatedJobs_14_5 - CreatedJobs_14_3 - AvailableJobId_4 + CreatedJobs_15_4 + CreatedJobs_16_4 - CreatedJobs_13_5 - CreatedJobs_14_2 + CreatedJobs_9_4 + CreatedJobs_20_4 + place_482_1_4 + CreatedJobs_0_4 - CreatedJobs_13_3 + CreatedJobs_8_4 + CreatedJobs_1_4 + CreatedJobs_17_4 - CreatedJobs_4_3 + DataOnSrc_4 - CreatedJobs_6_1 - CreatedJobs_6_2 - CreatedJobs_19_1 - AvailableJobId_6 - CreatedJobs_6_5 + CreatedJobs_18_4 - AvailableJobId_13 - CreatedJobs_13_1 - CreatedJobs_19_2 - CreatedJobs_19_3 - AvailableJobId_19 - CreatedJobs_13_2 - CreatedJobs_4_2 + CreatedJobs_10_4 - CreatedJobs_6_3 + CreatedJobs_3_4 - CreatedJobs_4_1 - AvailableJobId_14 - CreatedJobs_4_5 + CreatedJobs_11_4 + CreatedJobs_12_4 - CreatedJobs_19_5 - CreatedJobs_14_1 + ModifiedSrc_4 + CreatedJobs_5_4 = -4
inv : AvailableJobId_2 + f2_2 + QueueJobB_1_2 + f1_2 + FetchJobE_1_2 + NotifyEventJobQueuedB_1_2 + f3_2 = 1
inv : f1_19 + f3_4 + f1_0 + f3_13 + f1_15 + f2_16 + f2_2 + f1_1 + f3_0 + f1_8 + f2_10 + f3_14 + f3_7 + f3_6 + f1_2 + f3_1 + f1_16 + f2_11 + f2_15 + f3_15 + f2_1 + f3_20 + f2_18 + f3_19 + f1_3 + f2_8 + f1_7 + f2_0 + f1_6 + f1_13 + f2_17 + f1_4 + f3_9 + f3_18 + f1_5 + f1_14 + f2_9 + f3_8 + f2_13 + f3_17 + f3_10 + f2_5 + f3_3 + f2_19 + f3_16 + f3_2 + f2_12 + f2_7 + f3_11 + f1_12 + f1_11 + f2_6 + f2_20 + f1_17 + f1_10 + f2_4 + f3_5 + f3_12 + block + f2_3 + f1_18 + f1_9 + f2_14 + f1_20 = 3
inv : CreatedJobs_9_1 + AvailableJobId_9 + CreatedJobs_9_3 + CreatedJobs_9_2 + CreatedJobs_9_4 + CreatedJobs_9_5 = 1
inv : -AvailableJobId_9 - AvailableJobId_16 - CreatedJobs_16_2 + CreatedJobs_2_1 - CreatedJobs_9_3 - CreatedJobs_16_3 - CreatedJobs_9_2 - CreatedJobs_16_4 + CreatedJobs_1_1 - CreatedJobs_9_4 - CreatedJobs_17_2 + CreatedJobs_11_1 - AvailableJobId_3 - CreatedJobs_3_3 + CreatedJobs_8_1 - CreatedJobs_16_5 + CreatedJobs_10_1 + TheSour_1 + CreatedJobs_0_1 - CreatedJobs_17_4 + CreatedJobs_6_1 + CreatedJobs_19_1 - CreatedJobs_18_4 + CreatedJobs_13_1 - CreatedJobs_18_2 + place_482_1_1 + CreatedJobs_20_1 - CreatedJobs_3_4 + CreatedJobs_7_1 + CreatedJobs_12_1 + CreatedJobs_4_1 - CreatedJobs_3_5 - AvailableJobId_18 - CreatedJobs_17_5 - CreatedJobs_18_5 + ModifiedSrc_1 - CreatedJobs_17_3 + CreatedJobs_15_1 - CreatedJobs_3_2 - CreatedJobs_9_5 + CreatedJobs_14_1 - CreatedJobs_18_3 - AvailableJobId_17 + CreatedJobs_5_1 = -4
inv : FetchJobE_1_5 + f1_5 + QueueJobB_1_5 + f2_5 + AvailableJobId_5 + f3_5 + NotifyEventJobQueuedB_1_5 = 1
inv : CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_17_3 + AvailableJobId_17 = 1
inv : f3_4 + FetchJobE_1_4 + AvailableJobId_4 + f1_4 + QueueJobB_1_4 + NotifyEventJobQueuedB_1_4 + f2_4 = 1
inv : AvailableJobId_9 + QueueJobB_1_9 + NotifyEventJobQueuedB_1_9 + f3_9 + f2_9 + FetchJobE_1_9 + f1_9 = 1
inv : CreatedJobs_2_2 + CreatedJobs_16_2 + CreatedJobs_10_2 - CreatedJobs_8_5 + CreatedJobs_9_2 + CreatedJobs_7_2 + CreatedJobs_14_2 + TheSour_2 + CreatedJobs_17_2 - CreatedJobs_8_1 + CreatedJobs_15_2 - CreatedJobs_8_4 + CreatedJobs_6_2 + CreatedJobs_19_2 + place_482_1_2 + CreatedJobs_13_2 + CreatedJobs_5_2 + CreatedJobs_18_2 + CreatedJobs_4_2 + CreatedJobs_0_2 + CreatedJobs_11_2 - AvailableJobId_8 + CreatedJobs_1_2 + CreatedJobs_20_2 + CreatedJobs_3_2 + ModifiedSrc_2 + CreatedJobs_12_2 - CreatedJobs_8_3 = 0
inv : CreatedJobs_16_1 + AvailableJobId_16 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 = 1
inv : f1_3 + QueueJobB_1_3 + AvailableJobId_3 + FetchJobE_1_3 + f3_3 + NotifyEventJobQueuedB_1_3 + f2_3 = 1
inv : AvailableJobId_7 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_7_2 + CreatedJobs_7_1 + CreatedJobs_7_3 = 1
inv : mo1 + mo2 + mo3 = 1
inv : f3_13 + NotifyEventJobQueuedB_1_13 + f1_13 + QueueJobB_1_13 + f2_13 + AvailableJobId_13 + FetchJobE_1_13 = 1
inv : FetchJobE_1_17 + f2_17 + NotifyEventJobQueuedB_1_17 + f3_17 + QueueJobB_1_17 + f1_17 + AvailableJobId_17 = 1
inv : NotifyEventJobQueuedB_1_12 + FetchJobE_1_12 + QueueJobB_1_12 - CreatedJobs_12_3 + f2_12 - CreatedJobs_12_1 + f1_12 + f3_12 - CreatedJobs_12_5 - CreatedJobs_12_4 - CreatedJobs_12_2 = 0
inv : AvailableJobId_12 + CreatedJobs_12_3 + CreatedJobs_12_1 + CreatedJobs_12_5 + CreatedJobs_12_4 + CreatedJobs_12_2 = 1
inv : JobCnt + cJobCnt = 10
inv : f3_4 + f3_13 - f2_16 - f2_2 + f3_0 - f2_10 + f3_14 + f3_7 + f3_6 + f3_1 - f2_11 - f2_15 + f3_15 - f2_1 + f3_20 + mi3 - f2_18 + f3_19 - f2_8 - f2_0 - f2_17 + f3_9 + f3_18 - f2_9 + f3_8 - f2_13 + f3_17 + f3_10 - f2_5 + f3_3 - f2_19 + f3_16 + f3_2 - f2_12 - f2_7 + f3_11 - f2_6 - f2_20 - f2_4 + f3_5 + f3_12 - f2_3 - mo3 - f2_14 = 0
inv : CreatedJobs_5_5 + CreatedJobs_5_3 + CreatedJobs_5_2 + AvailableJobId_5 + CreatedJobs_5_4 + CreatedJobs_5_1 = 1
inv : CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_13_3 + AvailableJobId_13 + CreatedJobs_13_1 + CreatedJobs_13_2 = 1
inv : f3_20 + NotifyEventJobQueuedB_1_20 + AvailableJobId_20 + FetchJobE_1_20 + QueueJobB_1_20 + f2_20 + f1_20 = 1
inv : f1_0 + NotifyEventJobQueuedB_1_0 + f3_0 + f2_0 + FetchJobE_1_0 + AvailableJobId_0 + QueueJobB_1_0 = 1
inv : QueueJobB_1_18 + FetchJobE_1_18 + f2_18 + f3_18 + NotifyEventJobQueuedB_1_18 + AvailableJobId_18 + f1_18 = 1
inv : -CreatedJobs_2_2 - CreatedJobs_2_1 - AvailableJobId_2 - CreatedJobs_2_4 + ModifiedSrc_3 + CreatedJobs_9_3 + CreatedJobs_16_3 + CreatedJobs_14_3 - CreatedJobs_15_4 - CreatedJobs_1_1 - AvailableJobId_1 + CreatedJobs_3_3 - CreatedJobs_15_2 + DataOnSrc_3 + CreatedJobs_13_3 + place_482_1_3 - CreatedJobs_1_4 - CreatedJobs_15_5 + CreatedJobs_4_3 + CreatedJobs_5_3 + CreatedJobs_12_3 + CreatedJobs_19_3 + CreatedJobs_11_3 + CreatedJobs_6_3 + CreatedJobs_20_3 - AvailableJobId_15 + CreatedJobs_10_3 + CreatedJobs_7_3 + CreatedJobs_17_3 + CreatedJobs_0_3 - CreatedJobs_1_2 - CreatedJobs_2_5 - CreatedJobs_15_1 + CreatedJobs_18_3 - CreatedJobs_1_5 + CreatedJobs_8_3 = -2
inv : AvailableJobId_16 + FetchJobE_1_16 + QueueJobB_1_16 + f2_16 + f1_16 + NotifyEventJobQueuedB_1_16 + f3_16 = 1
inv : CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_2 + CreatedJobs_15_5 + AvailableJobId_15 + CreatedJobs_15_1 = 1
inv : -f3_4 - f1_0 - f3_13 - f1_15 - f2_16 - f2_2 - f1_1 - f3_0 - f1_8 - f2_10 - f3_14 - f3_7 - f3_6 + NotifyEventJobQueuedB_1_19 - f1_2 - f3_1 - f1_16 - f2_11 - f2_15 - f3_15 - f2_1 - f3_20 - f2_18 + FetchJobE_1_19 - f1_3 - f2_8 - f1_7 - f2_0 - f1_6 - f1_13 - f2_17 - f1_4 - f3_9 - f3_18 - f1_5 - f1_14 - f2_9 - f3_8 - f2_13 - f3_17 - f3_10 - f2_5 - f3_3 + AvailableJobId_19 + QueueJobB_1_19 - f3_16 - f3_2 - f2_12 - f2_7 - f3_11 - f1_12 - f1_11 - f2_6 - f2_20 - f1_17 - f1_10 - f2_4 - f3_5 - f3_12 - block - f2_3 - f1_18 - f1_9 - f2_14 - f1_20 = -2
inv : f3_4 + f3_13 + 2*f2_16 + 2*f2_2 + f3_0 + 2*f2_10 + f3_14 + f3_7 + f3_6 + f3_1 + 2*f2_11 + 2*f2_15 + f3_15 + 2*f2_1 + f3_20 + mi2 + 2*f2_18 + f3_19 + 2*f2_8 + 2*f2_0 + 2*f2_17 + f3_9 + f3_18 + 2*f2_9 + mo1 + f3_8 + 2*f2_13 + f3_17 + f3_10 + 2*f2_5 + f3_3 + 2*f2_19 + f3_16 + f3_2 + 2*f2_12 + 2*f2_7 + f3_11 + 2*f2_6 + 2*f2_20 + 2*f2_4 + f3_5 + f3_12 + block + 2*f2_3 + mo3 + 2*f2_14 = 4
inv : f1_15 + QueueJobB_1_15 + f2_15 + f3_15 + NotifyEventJobQueuedB_1_15 + AvailableJobId_15 + FetchJobE_1_15 = 1
inv : CreatedJobs_6_4 + CreatedJobs_6_1 + CreatedJobs_6_2 + AvailableJobId_6 + CreatedJobs_6_5 + CreatedJobs_6_3 = 1
inv : CreatedJobs_0_5 + CreatedJobs_0_4 + CreatedJobs_0_1 + AvailableJobId_0 + CreatedJobs_0_2 + CreatedJobs_0_3 = 1
inv : CreatedJobs_11_5 + AvailableJobId_11 + CreatedJobs_11_1 + CreatedJobs_11_3 + CreatedJobs_11_2 + CreatedJobs_11_4 = 1
inv : NotifyEventJobQueuedB_1_6 + f3_6 + f1_6 + AvailableJobId_6 + QueueJobB_1_6 + FetchJobE_1_6 + f2_6 = 1
inv : CreatedJobs_2_3 + CreatedJobs_2_2 + CreatedJobs_2_1 + AvailableJobId_2 + CreatedJobs_2_4 + CreatedJobs_2_5 = 1
inv : CreatedJobs_10_5 + AvailableJobId_10 + CreatedJobs_10_2 + CreatedJobs_10_1 + CreatedJobs_10_4 + CreatedJobs_10_3 = 1
inv : place_482_1_5 + CreatedJobs_7_5 - AvailableJobId_10 - CreatedJobs_10_2 + CreatedJobs_14_5 + CreatedJobs_8_5 - AvailableJobId_11 + CreatedJobs_13_5 - CreatedJobs_20_4 - CreatedJobs_11_1 - CreatedJobs_0_4 + CreatedJobs_16_5 - CreatedJobs_10_1 - CreatedJobs_0_1 + CreatedJobs_15_5 - CreatedJobs_5_3 + CreatedJobs_6_5 - AvailableJobId_20 - CreatedJobs_5_2 - CreatedJobs_11_3 - AvailableJobId_0 - CreatedJobs_10_4 - CreatedJobs_20_1 - CreatedJobs_20_3 + CreatedJobs_3_5 - CreatedJobs_0_2 + CreatedJobs_4_5 - CreatedJobs_11_2 - AvailableJobId_5 + CreatedJobs_17_5 + CreatedJobs_18_5 - CreatedJobs_11_4 - CreatedJobs_10_3 - CreatedJobs_0_3 + ModifiedSrc_5 + CreatedJobs_12_5 + CreatedJobs_2_5 - CreatedJobs_20_2 + CreatedJobs_19_5 + CreatedJobs_9_5 - CreatedJobs_5_4 - CreatedJobs_5_1 + CreatedJobs_1_5 + TheSour_5 = -4
inv : QueueJobB_1_8 + f1_8 + NotifyEventJobQueuedB_1_8 + f2_8 + f3_8 + AvailableJobId_8 + FetchJobE_1_8 = 1
inv : -AvailableJobId_9 + QueueJobB_1_18 + f3_4 + CreatedJobs_7_4 + QueueJobB_1_16 + f2_16 + f2_2 + QueueJobB_1_2 + place_482_1_5 + f2_10 + CreatedJobs_7_5 - place_462 + f1_2 + f1_16 + f2_11 + CreatedJobs_7_2 + f2_18 + NotifyEventJobQueuedB_1_11 - FetchJobE_1_19 + f1_3 + QueueJobB_1_3 - AvailableJobId_1 + place_482_1_4 + NotifyEventJobQueuedB_1_2 + f2_17 + f1_4 + QueueJobE_1 + place_482_1_3 + QueueJobB_1_4 + f3_18 + NotifyEventJobQueuedB_1_10 - FetchJobE_1_12 + f1_5 + NotifyEventJobQueuedB_1_17 - place_456 - FetchJobE_1_0 + NotifyEventJobQueuedB_1_18 - FetchJobE_1_7 + f3_17 - AvailableJobId_6 - AvailableJobId_13 + f3_10 - AvailableJobId_20 + place_482_1_2 + QueueJobB_1_5 + f2_5 + f3_3 + CreatedJobs_12_3 + NotifyEventJobQueuedB_1_16 - FetchJobE_1_1 - FetchJobE_1_13 + NotifyEventJobQueuedE_1 - AvailableJobId_19 + f3_16 - FetchJobE_1_20 + f3_2 - AvailableJobId_0 + place_482_1_1 + QueueJobB_1_11 + f3_11 - FetchJobE_1_6 + CreatedJobs_7_1 + CreatedJobs_12_1 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + f1_11 - AvailableJobId_14 - place_460 - FetchJobE_1_14 - AvailableJobId_15 + CreatedJobs_7_3 + QueueJobB_1_17 + f1_17 + f1_10 + QueueJobB_1_10 - FetchJobE_1_9 + f2_4 - AvailableJobId_8 + f3_5 + CreatedJobs_12_5 - FetchJobE_1_15 + CreatedJobs_12_4 + block + NotifyEventJobQueuedB_1_5 + f2_3 - place_458 - FetchJobE_1_8 + f1_18 + CreatedJobs_12_2 = -7
inv : CreatedJobs_1_3 + CreatedJobs_1_1 + AvailableJobId_1 + CreatedJobs_1_4 + CreatedJobs_1_2 + CreatedJobs_1_5 = 1
inv : CreatedJobs_18_1 + CreatedJobs_18_4 + CreatedJobs_18_2 + AvailableJobId_18 + CreatedJobs_18_5 + CreatedJobs_18_3 = 1
inv : f1_1 + QueueJobB_1_1 + f3_1 + f2_1 + AvailableJobId_1 + NotifyEventJobQueuedB_1_1 + FetchJobE_1_1 = 1
inv : f2_10 + AvailableJobId_10 + FetchJobE_1_10 + NotifyEventJobQueuedB_1_10 + f3_10 + f1_10 + QueueJobB_1_10 = 1
Total of 57 invariants.
[2020-05-18 23:08:43] [INFO ] Computed 57 place invariants in 41 ms
[2020-05-18 23:08:43] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=0 took 33 ms
[2020-05-18 23:08:43] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=1 took 51 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 406 out of 410 initially.
// Phase 1: matrix 406 rows 294 cols
[2020-05-18 23:08:43] [INFO ] Computed 57 place invariants in 5 ms
inv : FetchJobE_1_11 + f2_11 + AvailableJobId_11 + NotifyEventJobQueuedB_1_11 + QueueJobB_1_11 + f3_11 + f1_11 = 1
inv : -CreatedJobs_7_4 + NotifyEventJobQueuedB_1_7 - CreatedJobs_7_5 + f3_7 - CreatedJobs_7_2 + f1_7 + FetchJobE_1_7 + f2_7 - CreatedJobs_7_1 - CreatedJobs_7_3 + QueueJobB_1_7 = 0
inv : CreatedJobs_19_4 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + AvailableJobId_19 + CreatedJobs_19_5 = 1
inv : CreatedJobs_3_1 + AvailableJobId_3 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_2 = 1
inv : 4*place_522_1 + 3*place_462 + 12*Check_Sources_E_1 + 12*CanInjectEvent + 12*place_456 + 4*place_460 + 3*place_523_1 + 6*place_458 + 6*place_521_1 = 12
inv : CreatedJobs_4_4 + AvailableJobId_4 + CreatedJobs_4_3 + CreatedJobs_4_2 + CreatedJobs_4_1 + CreatedJobs_4_5 = 1
inv : -2*f3_4 - 2*f3_13 - f2_16 - f2_2 - 2*f3_0 - f2_10 + mi1 - 2*f3_14 - 2*f3_7 - 2*f3_6 - 2*f3_1 - f2_11 - f2_15 - 2*f3_15 - f2_1 - 2*f3_20 - f2_18 - 2*f3_19 - f2_8 - f2_0 - f2_17 - 2*f3_9 - 2*f3_18 - f2_9 - mo1 - 2*f3_8 - f2_13 - 2*f3_17 - 2*f3_10 - f2_5 - 2*f3_3 - f2_19 - 2*f3_16 - 2*f3_2 - f2_12 - f2_7 - 2*f3_11 - f2_6 - f2_20 - f2_4 - 2*f3_5 - 2*f3_12 - block - f2_3 - f2_14 = -3
inv : NotifyEventJobQueuedB_1_14 + f3_14 + QueueJobB_1_14 + f1_14 + AvailableJobId_14 + FetchJobE_1_14 + f2_14 = 1
inv : 12*QueueJobB_1_8 - 12*AvailableJobId_16 - 12*f3_4 - 12*AvailableJobId_2 - 12*f2_16 - 12*f2_2 + 4*place_522_1 - 12*f2_10 - 12*AvailableJobId_10 + 3*place_462 + 12*QueueJobB_1_9 + 12*QueueJobB_1_15 - 12*f1_2 + 12*QueueJobB_1_1 - 12*f1_16 + 12*QueueJobB_1_14 - 12*f2_11 - 12*AvailableJobId_4 + 12*place_787_1 - 12*AvailableJobId_11 - 12*f2_18 - 12*NotifyEventJobQueuedB_1_11 + 12*FetchJobE_1_19 - 12*f1_3 + 12*Check_Sources_E_1 - 12*AvailableJobId_3 + 12*place_782_1 - 12*NotifyEventJobQueuedB_1_2 - 12*f2_17 - 12*f1_4 - 12*f3_18 - 12*NotifyEventJobQueuedB_1_10 + 12*Try_Check_Sources_B_1 + 12*FetchJobE_1_12 - 12*f1_5 + 12*Schedule_Task_B_1 - 12*NotifyEventJobQueuedB_1_17 + 12*QueueJobB_1_13 + 12*place_456 + 12*FetchJobE_1_0 - 12*NotifyEventJobQueuedB_1_18 + 12*FetchJobE_1_7 - 12*f3_17 - 12*f3_10 + 12*QueueJobB_1_12 + 12*Check_Sources_B_1 - 12*f2_5 - 12*f3_3 - 12*NotifyEventJobQueuedB_1_16 + 12*FetchJobE_1_1 + 12*FetchJobE_1_13 + 12*QueueJobB_1_6 + 12*QueueJobB_1_19 - 12*f3_16 + 12*FetchJobE_1_20 - 12*f3_2 - 12*f3_11 + 12*FetchJobE_1_6 - 12*NotifyEventJobQueuedB_1_3 - 12*NotifyEventJobQueuedB_1_4 - 12*f1_11 - 12*AvailableJobId_18 + 12*QueueJobB_1_20 - 12*AvailableJobId_5 + 4*place_460 + 12*FetchJobE_1_14 - 12*f1_17 - 12*f1_10 + 12*FetchJobE_1_9 - 12*f2_4 - 12*f3_5 + 12*FetchJobE_1_15 + 12*QueueJobB_1_7 + 12*QueueJobB_1_0 - 12*block - 12*NotifyEventJobQueuedB_1_5 + 3*place_523_1 - 12*f2_3 + 6*place_458 - 12*AvailableJobId_17 + 12*FetchJobE_1_8 - 12*f1_18 + 6*place_521_1 + 12*cJobCnt = -12
inv : CreatedJobs_8_2 + CreatedJobs_8_5 + CreatedJobs_8_1 + CreatedJobs_8_4 + AvailableJobId_8 + CreatedJobs_8_3 = 1
inv : CreatedJobs_20_5 + CreatedJobs_20_4 + AvailableJobId_20 + CreatedJobs_20_1 + CreatedJobs_20_3 + CreatedJobs_20_2 = 1
inv : -QueueJobB_1_8 + FetchJobB_1 - QueueJobB_1_18 - QueueJobB_1_16 - QueueJobB_1_2 - QueueJobB_1_9 - QueueJobB_1_15 - QueueJobB_1_1 - QueueJobB_1_14 - QueueJobB_1_3 - QueueJobB_1_4 - QueueJobB_1_13 - QueueJobB_1_5 - QueueJobB_1_12 - QueueJobB_1_6 - QueueJobB_1_19 - QueueJobB_1_11 - QueueJobB_1_20 - QueueJobB_1_17 - QueueJobB_1_10 - QueueJobB_1_7 - QueueJobB_1_0 + block - cJobCnt = -7
inv : CreatedJobs_14_4 + CreatedJobs_14_5 + CreatedJobs_14_3 + CreatedJobs_14_2 + AvailableJobId_14 + CreatedJobs_14_1 = 1
inv : CreatedJobs_7_4 + CreatedJobs_2_4 - CreatedJobs_14_5 - CreatedJobs_14_3 - AvailableJobId_4 + CreatedJobs_15_4 + CreatedJobs_16_4 - CreatedJobs_13_5 - CreatedJobs_14_2 + CreatedJobs_9_4 + CreatedJobs_20_4 + place_482_1_4 + CreatedJobs_0_4 - CreatedJobs_13_3 + CreatedJobs_8_4 + CreatedJobs_1_4 + CreatedJobs_17_4 - CreatedJobs_4_3 + DataOnSrc_4 - CreatedJobs_6_1 - CreatedJobs_6_2 - CreatedJobs_19_1 - AvailableJobId_6 - CreatedJobs_6_5 + CreatedJobs_18_4 - AvailableJobId_13 - CreatedJobs_13_1 - CreatedJobs_19_2 - CreatedJobs_19_3 - AvailableJobId_19 - CreatedJobs_13_2 - CreatedJobs_4_2 + CreatedJobs_10_4 - CreatedJobs_6_3 + CreatedJobs_3_4 - CreatedJobs_4_1 - AvailableJobId_14 - CreatedJobs_4_5 + CreatedJobs_11_4 + CreatedJobs_12_4 - CreatedJobs_19_5 - CreatedJobs_14_1 + ModifiedSrc_4 + CreatedJobs_5_4 = -4
inv : AvailableJobId_2 + f2_2 + QueueJobB_1_2 + f1_2 + FetchJobE_1_2 + NotifyEventJobQueuedB_1_2 + f3_2 = 1
inv : f1_19 + f3_4 + f1_0 + f3_13 + f1_15 + f2_16 + f2_2 + f1_1 + f3_0 + f1_8 + f2_10 + f3_14 + f3_7 + f3_6 + f1_2 + f3_1 + f1_16 + f2_11 + f2_15 + f3_15 + f2_1 + f3_20 + f2_18 + f3_19 + f1_3 + f2_8 + f1_7 + f2_0 + f1_6 + f1_13 + f2_17 + f1_4 + f3_9 + f3_18 + f1_5 + f1_14 + f2_9 + f3_8 + f2_13 + f3_17 + f3_10 + f2_5 + f3_3 + f2_19 + f3_16 + f3_2 + f2_12 + f2_7 + f3_11 + f1_12 + f1_11 + f2_6 + f2_20 + f1_17 + f1_10 + f2_4 + f3_5 + f3_12 + block + f2_3 + f1_18 + f1_9 + f2_14 + f1_20 = 3
inv : CreatedJobs_9_1 + AvailableJobId_9 + CreatedJobs_9_3 + CreatedJobs_9_2 + CreatedJobs_9_4 + CreatedJobs_9_5 = 1
inv : -AvailableJobId_9 - AvailableJobId_16 - CreatedJobs_16_2 + CreatedJobs_2_1 - CreatedJobs_9_3 - CreatedJobs_16_3 - CreatedJobs_9_2 - CreatedJobs_16_4 + CreatedJobs_1_1 - CreatedJobs_9_4 - CreatedJobs_17_2 + CreatedJobs_11_1 - AvailableJobId_3 - CreatedJobs_3_3 + CreatedJobs_8_1 - CreatedJobs_16_5 + CreatedJobs_10_1 + TheSour_1 + CreatedJobs_0_1 - CreatedJobs_17_4 + CreatedJobs_6_1 + CreatedJobs_19_1 - CreatedJobs_18_4 + CreatedJobs_13_1 - CreatedJobs_18_2 + place_482_1_1 + CreatedJobs_20_1 - CreatedJobs_3_4 + CreatedJobs_7_1 + CreatedJobs_12_1 + CreatedJobs_4_1 - CreatedJobs_3_5 - AvailableJobId_18 - CreatedJobs_17_5 - CreatedJobs_18_5 + ModifiedSrc_1 - CreatedJobs_17_3 + CreatedJobs_15_1 - CreatedJobs_3_2 - CreatedJobs_9_5 + CreatedJobs_14_1 - CreatedJobs_18_3 - AvailableJobId_17 + CreatedJobs_5_1 = -4
inv : FetchJobE_1_5 + f1_5 + QueueJobB_1_5 + f2_5 + AvailableJobId_5 + f3_5 + NotifyEventJobQueuedB_1_5 = 1
inv : CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_17_3 + AvailableJobId_17 = 1
inv : f3_4 + FetchJobE_1_4 + AvailableJobId_4 + f1_4 + QueueJobB_1_4 + NotifyEventJobQueuedB_1_4 + f2_4 = 1
inv : AvailableJobId_9 + QueueJobB_1_9 + NotifyEventJobQueuedB_1_9 + f3_9 + f2_9 + FetchJobE_1_9 + f1_9 = 1
inv : CreatedJobs_2_2 + CreatedJobs_16_2 + CreatedJobs_10_2 - CreatedJobs_8_5 + CreatedJobs_9_2 + CreatedJobs_7_2 + CreatedJobs_14_2 + TheSour_2 + CreatedJobs_17_2 - CreatedJobs_8_1 + CreatedJobs_15_2 - CreatedJobs_8_4 + CreatedJobs_6_2 + CreatedJobs_19_2 + place_482_1_2 + CreatedJobs_13_2 + CreatedJobs_5_2 + CreatedJobs_18_2 + CreatedJobs_4_2 + CreatedJobs_0_2 + CreatedJobs_11_2 - AvailableJobId_8 + CreatedJobs_1_2 + CreatedJobs_20_2 + CreatedJobs_3_2 + ModifiedSrc_2 + CreatedJobs_12_2 - CreatedJobs_8_3 = 0
inv : CreatedJobs_16_1 + AvailableJobId_16 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 = 1
inv : f1_3 + QueueJobB_1_3 + AvailableJobId_3 + FetchJobE_1_3 + f3_3 + NotifyEventJobQueuedB_1_3 + f2_3 = 1
inv : AvailableJobId_7 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_7_2 + CreatedJobs_7_1 + CreatedJobs_7_3 = 1
inv : mo1 + mo2 + mo3 = 1
inv : f3_13 + NotifyEventJobQueuedB_1_13 + f1_13 + QueueJobB_1_13 + f2_13 + AvailableJobId_13 + FetchJobE_1_13 = 1
inv : FetchJobE_1_17 + f2_17 + NotifyEventJobQueuedB_1_17 + f3_17 + QueueJobB_1_17 + f1_17 + AvailableJobId_17 = 1
inv : NotifyEventJobQueuedB_1_12 + FetchJobE_1_12 + QueueJobB_1_12 - CreatedJobs_12_3 + f2_12 - CreatedJobs_12_1 + f1_12 + f3_12 - CreatedJobs_12_5 - CreatedJobs_12_4 - CreatedJobs_12_2 = 0
inv : AvailableJobId_12 + CreatedJobs_12_3 + CreatedJobs_12_1 + CreatedJobs_12_5 + CreatedJobs_12_4 + CreatedJobs_12_2 = 1
inv : JobCnt + cJobCnt = 10
inv : f3_4 + f3_13 - f2_16 - f2_2 + f3_0 - f2_10 + f3_14 + f3_7 + f3_6 + f3_1 - f2_11 - f2_15 + f3_15 - f2_1 + f3_20 + mi3 - f2_18 + f3_19 - f2_8 - f2_0 - f2_17 + f3_9 + f3_18 - f2_9 + f3_8 - f2_13 + f3_17 + f3_10 - f2_5 + f3_3 - f2_19 + f3_16 + f3_2 - f2_12 - f2_7 + f3_11 - f2_6 - f2_20 - f2_4 + f3_5 + f3_12 - f2_3 - mo3 - f2_14 = 0
inv : CreatedJobs_5_5 + CreatedJobs_5_3 + CreatedJobs_5_2 + AvailableJobId_5 + CreatedJobs_5_4 + CreatedJobs_5_1 = 1
inv : CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_13_3 + AvailableJobId_13 + CreatedJobs_13_1 + CreatedJobs_13_2 = 1
inv : f3_20 + NotifyEventJobQueuedB_1_20 + AvailableJobId_20 + FetchJobE_1_20 + QueueJobB_1_20 + f2_20 + f1_20 = 1
inv : f1_0 + NotifyEventJobQueuedB_1_0 + f3_0 + f2_0 + FetchJobE_1_0 + AvailableJobId_0 + QueueJobB_1_0 = 1
inv : QueueJobB_1_18 + FetchJobE_1_18 + f2_18 + f3_18 + NotifyEventJobQueuedB_1_18 + AvailableJobId_18 + f1_18 = 1
inv : -CreatedJobs_2_2 - CreatedJobs_2_1 - AvailableJobId_2 - CreatedJobs_2_4 + ModifiedSrc_3 + CreatedJobs_9_3 + CreatedJobs_16_3 + CreatedJobs_14_3 - CreatedJobs_15_4 - CreatedJobs_1_1 - AvailableJobId_1 + CreatedJobs_3_3 - CreatedJobs_15_2 + DataOnSrc_3 + CreatedJobs_13_3 + place_482_1_3 - CreatedJobs_1_4 - CreatedJobs_15_5 + CreatedJobs_4_3 + CreatedJobs_5_3 + CreatedJobs_12_3 + CreatedJobs_19_3 + CreatedJobs_11_3 + CreatedJobs_6_3 + CreatedJobs_20_3 - AvailableJobId_15 + CreatedJobs_10_3 + CreatedJobs_7_3 + CreatedJobs_17_3 + CreatedJobs_0_3 - CreatedJobs_1_2 - CreatedJobs_2_5 - CreatedJobs_15_1 + CreatedJobs_18_3 - CreatedJobs_1_5 + CreatedJobs_8_3 = -2
inv : AvailableJobId_16 + FetchJobE_1_16 + QueueJobB_1_16 + f2_16 + f1_16 + NotifyEventJobQueuedB_1_16 + f3_16 = 1
inv : CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_2 + CreatedJobs_15_5 + AvailableJobId_15 + CreatedJobs_15_1 = 1
inv : -f3_4 - f1_0 - f3_13 - f1_15 - f2_16 - f2_2 - f1_1 - f3_0 - f1_8 - f2_10 - f3_14 - f3_7 - f3_6 + NotifyEventJobQueuedB_1_19 - f1_2 - f3_1 - f1_16 - f2_11 - f2_15 - f3_15 - f2_1 - f3_20 - f2_18 + FetchJobE_1_19 - f1_3 - f2_8 - f1_7 - f2_0 - f1_6 - f1_13 - f2_17 - f1_4 - f3_9 - f3_18 - f1_5 - f1_14 - f2_9 - f3_8 - f2_13 - f3_17 - f3_10 - f2_5 - f3_3 + AvailableJobId_19 + QueueJobB_1_19 - f3_16 - f3_2 - f2_12 - f2_7 - f3_11 - f1_12 - f1_11 - f2_6 - f2_20 - f1_17 - f1_10 - f2_4 - f3_5 - f3_12 - block - f2_3 - f1_18 - f1_9 - f2_14 - f1_20 = -2
inv : f3_4 + f3_13 + 2*f2_16 + 2*f2_2 + f3_0 + 2*f2_10 + f3_14 + f3_7 + f3_6 + f3_1 + 2*f2_11 + 2*f2_15 + f3_15 + 2*f2_1 + f3_20 + mi2 + 2*f2_18 + f3_19 + 2*f2_8 + 2*f2_0 + 2*f2_17 + f3_9 + f3_18 + 2*f2_9 + mo1 + f3_8 + 2*f2_13 + f3_17 + f3_10 + 2*f2_5 + f3_3 + 2*f2_19 + f3_16 + f3_2 + 2*f2_12 + 2*f2_7 + f3_11 + 2*f2_6 + 2*f2_20 + 2*f2_4 + f3_5 + f3_12 + block + 2*f2_3 + mo3 + 2*f2_14 = 4
inv : f1_15 + QueueJobB_1_15 + f2_15 + f3_15 + NotifyEventJobQueuedB_1_15 + AvailableJobId_15 + FetchJobE_1_15 = 1
inv : CreatedJobs_6_4 + CreatedJobs_6_1 + CreatedJobs_6_2 + AvailableJobId_6 + CreatedJobs_6_5 + CreatedJobs_6_3 = 1
inv : CreatedJobs_0_5 + CreatedJobs_0_4 + CreatedJobs_0_1 + AvailableJobId_0 + CreatedJobs_0_2 + CreatedJobs_0_3 = 1
inv : CreatedJobs_11_5 + AvailableJobId_11 + CreatedJobs_11_1 + CreatedJobs_11_3 + CreatedJobs_11_2 + CreatedJobs_11_4 = 1
inv : NotifyEventJobQueuedB_1_6 + f3_6 + f1_6 + AvailableJobId_6 + QueueJobB_1_6 + FetchJobE_1_6 + f2_6 = 1
inv : CreatedJobs_2_3 + CreatedJobs_2_2 + CreatedJobs_2_1 + AvailableJobId_2 + CreatedJobs_2_4 + CreatedJobs_2_5 = 1
inv : CreatedJobs_10_5 + AvailableJobId_10 + CreatedJobs_10_2 + CreatedJobs_10_1 + CreatedJobs_10_4 + CreatedJobs_10_3 = 1
inv : place_482_1_5 + CreatedJobs_7_5 - AvailableJobId_10 - CreatedJobs_10_2 + CreatedJobs_14_5 + CreatedJobs_8_5 - AvailableJobId_11 + CreatedJobs_13_5 - CreatedJobs_20_4 - CreatedJobs_11_1 - CreatedJobs_0_4 + CreatedJobs_16_5 - CreatedJobs_10_1 - CreatedJobs_0_1 + CreatedJobs_15_5 - CreatedJobs_5_3 + CreatedJobs_6_5 - AvailableJobId_20 - CreatedJobs_5_2 - CreatedJobs_11_3 - AvailableJobId_0 - CreatedJobs_10_4 - CreatedJobs_20_1 - CreatedJobs_20_3 + CreatedJobs_3_5 - CreatedJobs_0_2 + CreatedJobs_4_5 - CreatedJobs_11_2 - AvailableJobId_5 + CreatedJobs_17_5 + CreatedJobs_18_5 - CreatedJobs_11_4 - CreatedJobs_10_3 - CreatedJobs_0_3 + ModifiedSrc_5 + CreatedJobs_12_5 + CreatedJobs_2_5 - CreatedJobs_20_2 + CreatedJobs_19_5 + CreatedJobs_9_5 - CreatedJobs_5_4 - CreatedJobs_5_1 + CreatedJobs_1_5 + TheSour_5 = -4
inv : QueueJobB_1_8 + f1_8 + NotifyEventJobQueuedB_1_8 + f2_8 + f3_8 + AvailableJobId_8 + FetchJobE_1_8 = 1
inv : -AvailableJobId_9 + QueueJobB_1_18 + f3_4 + CreatedJobs_7_4 + QueueJobB_1_16 + f2_16 + f2_2 + QueueJobB_1_2 + place_482_1_5 + f2_10 + CreatedJobs_7_5 - place_462 + f1_2 + f1_16 + f2_11 + CreatedJobs_7_2 + f2_18 + NotifyEventJobQueuedB_1_11 - FetchJobE_1_19 + f1_3 + QueueJobB_1_3 - AvailableJobId_1 + place_482_1_4 + NotifyEventJobQueuedB_1_2 + f2_17 + f1_4 + QueueJobE_1 + place_482_1_3 + QueueJobB_1_4 + f3_18 + NotifyEventJobQueuedB_1_10 - FetchJobE_1_12 + f1_5 + NotifyEventJobQueuedB_1_17 - place_456 - FetchJobE_1_0 + NotifyEventJobQueuedB_1_18 - FetchJobE_1_7 + f3_17 - AvailableJobId_6 - AvailableJobId_13 + f3_10 - AvailableJobId_20 + place_482_1_2 + QueueJobB_1_5 + f2_5 + f3_3 + CreatedJobs_12_3 + NotifyEventJobQueuedB_1_16 - FetchJobE_1_1 - FetchJobE_1_13 + NotifyEventJobQueuedE_1 - AvailableJobId_19 + f3_16 - FetchJobE_1_20 + f3_2 - AvailableJobId_0 + place_482_1_1 + QueueJobB_1_11 + f3_11 - FetchJobE_1_6 + CreatedJobs_7_1 + CreatedJobs_12_1 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + f1_11 - AvailableJobId_14 - place_460 - FetchJobE_1_14 - AvailableJobId_15 + CreatedJobs_7_3 + QueueJobB_1_17 + f1_17 + f1_10 + QueueJobB_1_10 - FetchJobE_1_9 + f2_4 - AvailableJobId_8 + f3_5 + CreatedJobs_12_5 - FetchJobE_1_15 + CreatedJobs_12_4 + block + NotifyEventJobQueuedB_1_5 + f2_3 - place_458 - FetchJobE_1_8 + f1_18 + CreatedJobs_12_2 = -7
inv : CreatedJobs_1_3 + CreatedJobs_1_1 + AvailableJobId_1 + CreatedJobs_1_4 + CreatedJobs_1_2 + CreatedJobs_1_5 = 1
inv : CreatedJobs_18_1 + CreatedJobs_18_4 + CreatedJobs_18_2 + AvailableJobId_18 + CreatedJobs_18_5 + CreatedJobs_18_3 = 1
inv : f1_1 + QueueJobB_1_1 + f3_1 + f2_1 + AvailableJobId_1 + NotifyEventJobQueuedB_1_1 + FetchJobE_1_1 = 1
inv : f2_10 + AvailableJobId_10 + FetchJobE_1_10 + NotifyEventJobQueuedB_1_10 + f3_10 + f1_10 + QueueJobB_1_10 = 1
Total of 57 invariants.
[2020-05-18 23:08:43] [INFO ] Computed 57 place invariants in 14 ms
[2020-05-18 23:08:43] [INFO ] Removed a total of 488 redundant transitions.
[2020-05-18 23:08:43] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=2 took 214 ms
[2020-05-18 23:08:43] [INFO ] Flatten gal took : 320 ms
[2020-05-18 23:08:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 11 ms.
[2020-05-18 23:08:43] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 7 ms
[2020-05-18 23:08:43] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : PolyORBNT-PT-S05J20-ReachabilityCardinality-04 with value :(((((((((((((((((((((((gu1.f1_19+gu1.f1_0)+gu1.f1_15)+gu1.f1_1)+gu1.f1_8)+gu1.f1_2)+gu1.f1_16)+gu1.f1_3)+gu1.f1_7)+gu1.f1_6)+gu1.f1_13)+gu1.f1_4)+gu1.f1_5)+gu1.f1_14)+gu1.f1_12)+gu1.f1_11)+gu1.f1_17)+gu1.f1_10)+gu1.f1_18)+gu1.f1_9)+gu1.f1_20)<=gu1.place_782_1)||(gu32.NotifyEventJobQueuedE_1<=((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu32.CreatedJobs_9_1+gu32.CreatedJobs_2_3)+gu32.CreatedJobs_16_1)+gu32.CreatedJobs_10_5)+gu32.CreatedJobs_20_5)+gu32.CreatedJobs_2_2)+gu32.CreatedJobs_16_2)+gu32.CreatedJobs_2_1)+gu32.CreatedJobs_7_4)+gu32.CreatedJobs_4_4)+gu32.CreatedJobs_2_4)+gu32.CreatedJobs_9_3)+gu32.CreatedJobs_13_4)+gu32.CreatedJobs_11_5)+gu32.CreatedJobs_16_3)+gu32.CreatedJobs_7_5)+gu32.CreatedJobs_1_3)+gu32.CreatedJobs_17_1)+gu32.CreatedJobs_0_5)+gu32.CreatedJobs_8_2)+gu32.CreatedJobs_10_2)+gu32.CreatedJobs_3_1)+gu32.CreatedJobs_14_4)+gu32.CreatedJobs_14_5)+gu32.CreatedJobs_8_5)+gu32.CreatedJobs_15_3)+gu32.CreatedJobs_14_3)+gu32.CreatedJobs_9_2)+gu32.CreatedJobs_15_4)+gu32.CreatedJobs_7_2)+gu32.CreatedJobs_16_4)+gu32.CreatedJobs_1_1)+gu32.CreatedJobs_13_5)+gu32.CreatedJobs_14_2)+gu32.CreatedJobs_6_4)+gu32.CreatedJobs_9_4)+gu32.CreatedJobs_20_4)+gu32.CreatedJobs_17_2)+gu32.CreatedJobs_11_1)+gu32.CreatedJobs_0_4)+gu32.CreatedJobs_3_3)+gu32.CreatedJobs_8_1)+gu32.CreatedJobs_15_2)+gu32.CreatedJobs_16_5)+gu32.CreatedJobs_13_3)+gu32.CreatedJobs_10_1)+gu32.CreatedJobs_8_4)+gu32.CreatedJobs_5_5)+gu32.CreatedJobs_18_1)+gu32.CreatedJobs_19_4)+gu32.CreatedJobs_1_4)+gu32.CreatedJobs_0_1)+gu32.CreatedJobs_17_4)+gu32.CreatedJobs_15_5)+gu32.CreatedJobs_4_3)+gu32.CreatedJobs_5_3)+gu32.CreatedJobs_6_1)+gu32.CreatedJobs_6_2)+gu32.CreatedJobs_19_1)+gu32.CreatedJobs_6_5)+gu32.CreatedJobs_18_4)+gu32.CreatedJobs_13_1)+gu32.CreatedJobs_19_2)+gu32.CreatedJobs_12_3)+gu32.CreatedJobs_19_3)+gu32.CreatedJobs_13_2)+gu32.CreatedJobs_5_2)+gu32.CreatedJobs_11_3)+gu32.CreatedJobs_18_2)+gu32.CreatedJobs_4_2)+gu32.CreatedJobs_10_4)+gu32.CreatedJobs_6_3)+gu32.CreatedJobs_20_1)+gu32.CreatedJobs_3_4)+gu32.CreatedJobs_7_1)+gu32.CreatedJobs_12_1)+gu32.CreatedJobs_20_3)+gu32.CreatedJobs_4_1)+gu32.CreatedJobs_3_5)+gu32.CreatedJobs_0_2)+gu32.CreatedJobs_4_5)+gu32.CreatedJobs_11_2)+gu32.CreatedJobs_17_5)+gu32.CreatedJobs_18_5)+gu32.CreatedJobs_11_4)+gu32.CreatedJobs_10_3)+gu32.CreatedJobs_7_3)+gu32.CreatedJobs_17_3)+gu32.CreatedJobs_0_3)+gu32.CreatedJobs_1_2)+gu32.CreatedJobs_12_5)+gu32.CreatedJobs_12_4)+gu32.CreatedJobs_2_5)+gu32.CreatedJobs_20_2)+gu32.CreatedJobs_19_5)+gu32.CreatedJobs_15_1)+gu32.CreatedJobs_3_2)+gu32.CreatedJobs_9_5)+gu32.CreatedJobs_14_1)+gu32.CreatedJobs_18_3)+gu32.CreatedJobs_5_4)+gu32.CreatedJobs_5_1)+gu32.CreatedJobs_1_5)+gu32.CreatedJobs_12_2)+gu32.CreatedJobs_8_3)))||((gi2.gu13.Check_Sources_B_1>=2)&&(gi2.gu10.place_787_1<=gi2.gu10.mi2)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
[2020-05-18 23:08:44] [INFO ] Proved 294 variables to be positive in 1066 ms
[2020-05-18 23:08:44] [INFO ] Computing symmetric may disable matrix : 410 transitions.
[2020-05-18 23:08:44] [INFO ] Computation of disable matrix completed :0/410 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 23:08:44] [INFO ] Computation of Complete disable matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 23:08:44] [INFO ] Computing symmetric may enable matrix : 410 transitions.
[2020-05-18 23:08:44] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 23:08:44] [INFO ] Proved 294 variables to be positive in 1103 ms
[2020-05-18 23:08:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-PT-S05J20-ReachabilityCardinality-04
[2020-05-18 23:08:44] [INFO ] KInduction solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(SAT) depth K=0 took 21 ms
[2020-05-18 23:08:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-PT-S05J20-ReachabilityCardinality-04
[2020-05-18 23:08:46] [INFO ] KInduction solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(SAT) depth K=1 took 1308 ms
SDD proceeding with computation, new max is 1024
[2020-05-18 23:08:47] [INFO ] Computing symmetric co enabling matrix : 410 transitions.
[2020-05-18 23:08:48] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=3 took 4904 ms
[2020-05-18 23:08:49] [INFO ] Computation of co-enabling matrix(0/410) took 1231 ms. Total solver calls (SAT/UNSAT): 359(345/14)
[2020-05-18 23:08:52] [INFO ] Computation of co-enabling matrix(5/410) took 5151 ms. Total solver calls (SAT/UNSAT): 1930(1664/266)
[2020-05-18 23:08:56] [INFO ] Computation of co-enabling matrix(8/410) took 8553 ms. Total solver calls (SAT/UNSAT): 2996(2608/388)
[2020-05-18 23:08:59] [INFO ] Computation of co-enabling matrix(13/410) took 11886 ms. Total solver calls (SAT/UNSAT): 4620(4127/493)
[2020-05-18 23:08:59] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=4 took 11231 ms
[2020-05-18 23:09:02] [INFO ] Computation of co-enabling matrix(18/410) took 15183 ms. Total solver calls (SAT/UNSAT): 5896(5135/761)
[2020-05-18 23:09:06] [INFO ] Computation of co-enabling matrix(26/410) took 19059 ms. Total solver calls (SAT/UNSAT): 7935(6959/976)
[2020-05-18 23:09:10] [INFO ] Computation of co-enabling matrix(32/410) took 23163 ms. Total solver calls (SAT/UNSAT): 9488(8333/1155)
[2020-05-18 23:09:14] [INFO ] Computation of co-enabling matrix(37/410) took 27042 ms. Total solver calls (SAT/UNSAT): 10897(9524/1373)
[2020-05-18 23:09:18] [INFO ] Computation of co-enabling matrix(43/410) took 30462 ms. Total solver calls (SAT/UNSAT): 12333(10818/1515)
[2020-05-18 23:09:21] [INFO ] Computation of co-enabling matrix(48/410) took 33838 ms. Total solver calls (SAT/UNSAT): 13879(12216/1663)
[2020-05-18 23:09:25] [INFO ] Computation of co-enabling matrix(53/410) took 37657 ms. Total solver calls (SAT/UNSAT): 15370(13476/1894)
[2020-05-18 23:09:28] [INFO ] Computation of co-enabling matrix(58/410) took 41078 ms. Total solver calls (SAT/UNSAT): 16867(14828/2039)
[2020-05-18 23:09:32] [INFO ] Computation of co-enabling matrix(64/410) took 44678 ms. Total solver calls (SAT/UNSAT): 18591(16417/2174)
[2020-05-18 23:09:36] [INFO ] Computation of co-enabling matrix(68/410) took 48398 ms. Total solver calls (SAT/UNSAT): 19779(17469/2310)
[2020-05-18 23:09:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-PT-S05J20-ReachabilityCardinality-04
[2020-05-18 23:09:38] [INFO ] KInduction solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(SAT) depth K=2 took 52105 ms
[2020-05-18 23:09:39] [INFO ] Computation of co-enabling matrix(72/410) took 51672 ms. Total solver calls (SAT/UNSAT): 20929(18515/2414)
[2020-05-18 23:09:43] [INFO ] Computation of co-enabling matrix(79/410) took 55479 ms. Total solver calls (SAT/UNSAT): 22895(20305/2590)
[2020-05-18 23:09:46] [INFO ] Computation of co-enabling matrix(83/410) took 58930 ms. Total solver calls (SAT/UNSAT): 23963(21276/2687)
[2020-05-18 23:09:50] [INFO ] Computation of co-enabling matrix(89/410) took 62223 ms. Total solver calls (SAT/UNSAT): 25530(22731/2799)
[2020-05-18 23:09:53] [INFO ] Computation of co-enabling matrix(99/410) took 65969 ms. Total solver calls (SAT/UNSAT): 27726(24765/2961)
[2020-05-18 23:09:57] [INFO ] Computation of co-enabling matrix(106/410) took 69365 ms. Total solver calls (SAT/UNSAT): 29435(26343/3092)
[2020-05-18 23:10:00] [INFO ] Computation of co-enabling matrix(111/410) took 72885 ms. Total solver calls (SAT/UNSAT): 30695(27475/3220)
[2020-05-18 23:10:03] [INFO ] Computation of co-enabling matrix(119/410) took 76022 ms. Total solver calls (SAT/UNSAT): 32295(28855/3440)
[2020-05-18 23:10:07] [INFO ] Computation of co-enabling matrix(124/410) took 79583 ms. Total solver calls (SAT/UNSAT): 33470(29950/3520)
[2020-05-18 23:10:10] [INFO ] Computation of co-enabling matrix(130/410) took 83203 ms. Total solver calls (SAT/UNSAT): 34837(31211/3626)
[2020-05-18 23:10:14] [INFO ] Computation of co-enabling matrix(139/410) took 86716 ms. Total solver calls (SAT/UNSAT): 36452(32619/3833)
[2020-05-18 23:10:17] [INFO ] Computation of co-enabling matrix(144/410) took 89785 ms. Total solver calls (SAT/UNSAT): 37575(33658/3917)
[2020-05-18 23:10:20] [INFO ] Computation of co-enabling matrix(152/410) took 93142 ms. Total solver calls (SAT/UNSAT): 39142(35125/4017)
[2020-05-18 23:10:23] [INFO ] Computation of co-enabling matrix(157/410) took 96210 ms. Total solver calls (SAT/UNSAT): 40150(36027/4123)
[2020-05-18 23:10:27] [INFO ] Computation of co-enabling matrix(167/410) took 99315 ms. Total solver calls (SAT/UNSAT): 41779(37497/4282)
[2020-05-18 23:10:30] [INFO ] Computation of co-enabling matrix(174/410) took 102475 ms. Total solver calls (SAT/UNSAT): 43016(38636/4380)
[2020-05-18 23:10:33] [INFO ] Computation of co-enabling matrix(181/410) took 105664 ms. Total solver calls (SAT/UNSAT): 44212(39746/4466)
[2020-05-18 23:10:36] [INFO ] Computation of co-enabling matrix(190/410) took 109062 ms. Total solver calls (SAT/UNSAT): 45581(40963/4618)
SDD proceeding with computation, new max is 2048
[2020-05-18 23:10:40] [INFO ] Computation of co-enabling matrix(202/410) took 112429 ms. Total solver calls (SAT/UNSAT): 47420(42604/4816)
[2020-05-18 23:10:43] [INFO ] Computation of co-enabling matrix(213/410) took 115534 ms. Total solver calls (SAT/UNSAT): 48809(43851/4958)
[2020-05-18 23:10:46] [INFO ] Computation of co-enabling matrix(223/410) took 118699 ms. Total solver calls (SAT/UNSAT): 50077(44999/5078)
[2020-05-18 23:10:49] [INFO ] Computation of co-enabling matrix(235/410) took 121756 ms. Total solver calls (SAT/UNSAT): 51271(46060/5211)
[2020-05-18 23:10:52] [INFO ] Computation of co-enabling matrix(244/410) took 124969 ms. Total solver calls (SAT/UNSAT): 52346(47078/5268)
[2020-05-18 23:10:56] [INFO ] Computation of co-enabling matrix(258/410) took 128277 ms. Total solver calls (SAT/UNSAT): 53600(48226/5374)
[2020-05-18 23:10:59] [INFO ] Computation of co-enabling matrix(272/410) took 131318 ms. Total solver calls (SAT/UNSAT): 54910(49461/5449)
[2020-05-18 23:11:00] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=5 took 120615 ms
[2020-05-18 23:11:02] [INFO ] Computation of co-enabling matrix(290/410) took 134461 ms. Total solver calls (SAT/UNSAT): 56914(51393/5521)
[2020-05-18 23:11:05] [INFO ] Computation of co-enabling matrix(311/410) took 137520 ms. Total solver calls (SAT/UNSAT): 58575(52991/5584)
[2020-05-18 23:11:08] [INFO ] Computation of co-enabling matrix(335/410) took 140612 ms. Total solver calls (SAT/UNSAT): 60061(54430/5631)
[2020-05-18 23:11:11] [INFO ] Computation of co-enabling matrix(384/410) took 143635 ms. Total solver calls (SAT/UNSAT): 61335(55608/5727)
[2020-05-18 23:11:12] [INFO ] Computation of Finished co-enabling matrix. took 144322 ms. Total solver calls (SAT/UNSAT): 61512(55739/5773)
[2020-05-18 23:11:12] [INFO ] Computing Do-Not-Accords matrix : 410 transitions.
[2020-05-18 23:11:15] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:630)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 23:11:19] [INFO ] Built C files in 156465ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 4466 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTPTS05J20ReachabilityCardinality04==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTPTS05J20ReachabilityCardinality04==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBNTPTS05J20ReachabilityCardinality04==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
[2020-05-18 23:13:35] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=6 took 154638 ms
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
[2020-05-18 23:20:03] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=7 took 388816 ms
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
Detected timeout of ITS tools.
[2020-05-18 23:29:57] [INFO ] Flatten gal took : 37 ms
[2020-05-18 23:29:57] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 16 ms
[2020-05-18 23:29:57] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : PolyORBNT-PT-S05J20-ReachabilityCardinality-04 with value :(((((((((((((((((((((((f1_19+f1_0)+f1_15)+f1_1)+f1_8)+f1_2)+f1_16)+f1_3)+f1_7)+f1_6)+f1_13)+f1_4)+f1_5)+f1_14)+f1_12)+f1_11)+f1_17)+f1_10)+f1_18)+f1_9)+f1_20)<=place_782_1)||(NotifyEventJobQueuedE_1<=((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((CreatedJobs_9_1+CreatedJobs_2_3)+CreatedJobs_16_1)+CreatedJobs_10_5)+CreatedJobs_20_5)+CreatedJobs_2_2)+CreatedJobs_16_2)+CreatedJobs_2_1)+CreatedJobs_7_4)+CreatedJobs_4_4)+CreatedJobs_2_4)+CreatedJobs_9_3)+CreatedJobs_13_4)+CreatedJobs_11_5)+CreatedJobs_16_3)+CreatedJobs_7_5)+CreatedJobs_1_3)+CreatedJobs_17_1)+CreatedJobs_0_5)+CreatedJobs_8_2)+CreatedJobs_10_2)+CreatedJobs_3_1)+CreatedJobs_14_4)+CreatedJobs_14_5)+CreatedJobs_8_5)+CreatedJobs_15_3)+CreatedJobs_14_3)+CreatedJobs_9_2)+CreatedJobs_15_4)+CreatedJobs_7_2)+CreatedJobs_16_4)+CreatedJobs_1_1)+CreatedJobs_13_5)+CreatedJobs_14_2)+CreatedJobs_6_4)+CreatedJobs_9_4)+CreatedJobs_20_4)+CreatedJobs_17_2)+CreatedJobs_11_1)+CreatedJobs_0_4)+CreatedJobs_3_3)+CreatedJobs_8_1)+CreatedJobs_15_2)+CreatedJobs_16_5)+CreatedJobs_13_3)+CreatedJobs_10_1)+CreatedJobs_8_4)+CreatedJobs_5_5)+CreatedJobs_18_1)+CreatedJobs_19_4)+CreatedJobs_1_4)+CreatedJobs_0_1)+CreatedJobs_17_4)+CreatedJobs_15_5)+CreatedJobs_4_3)+CreatedJobs_5_3)+CreatedJobs_6_1)+CreatedJobs_6_2)+CreatedJobs_19_1)+CreatedJobs_6_5)+CreatedJobs_18_4)+CreatedJobs_13_1)+CreatedJobs_19_2)+CreatedJobs_12_3)+CreatedJobs_19_3)+CreatedJobs_13_2)+CreatedJobs_5_2)+CreatedJobs_11_3)+CreatedJobs_18_2)+CreatedJobs_4_2)+CreatedJobs_10_4)+CreatedJobs_6_3)+CreatedJobs_20_1)+CreatedJobs_3_4)+CreatedJobs_7_1)+CreatedJobs_12_1)+CreatedJobs_20_3)+CreatedJobs_4_1)+CreatedJobs_3_5)+CreatedJobs_0_2)+CreatedJobs_4_5)+CreatedJobs_11_2)+CreatedJobs_17_5)+CreatedJobs_18_5)+CreatedJobs_11_4)+CreatedJobs_10_3)+CreatedJobs_7_3)+CreatedJobs_17_3)+CreatedJobs_0_3)+CreatedJobs_1_2)+CreatedJobs_12_5)+CreatedJobs_12_4)+CreatedJobs_2_5)+CreatedJobs_20_2)+CreatedJobs_19_5)+CreatedJobs_15_1)+CreatedJobs_3_2)+CreatedJobs_9_5)+CreatedJobs_14_1)+CreatedJobs_18_3)+CreatedJobs_5_4)+CreatedJobs_5_1)+CreatedJobs_1_5)+CreatedJobs_12_2)+CreatedJobs_8_3)))||((Check_Sources_B_1>=2)&&(place_787_1<=mi2)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
[2020-05-18 23:34:28] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=8 took 864472 ms
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
Detected timeout of ITS tools.
[2020-05-18 23:51:10] [INFO ] Flatten gal took : 30 ms
[2020-05-18 23:51:10] [INFO ] Input system was already deterministic with 410 transitions.
[2020-05-18 23:51:10] [INFO ] Transformed 294 places.
[2020-05-18 23:51:10] [INFO ] Transformed 410 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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//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
[2020-05-18 23:51:40] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 9 ms
[2020-05-18 23:51:40] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.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 ReachabilityCardinality.prop.
Read [invariant] property : PolyORBNT-PT-S05J20-ReachabilityCardinality-04 with value :(((((((((((((((((((((((f1_19+f1_0)+f1_15)+f1_1)+f1_8)+f1_2)+f1_16)+f1_3)+f1_7)+f1_6)+f1_13)+f1_4)+f1_5)+f1_14)+f1_12)+f1_11)+f1_17)+f1_10)+f1_18)+f1_9)+f1_20)<=place_782_1)||(NotifyEventJobQueuedE_1<=((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((CreatedJobs_9_1+CreatedJobs_2_3)+CreatedJobs_16_1)+CreatedJobs_10_5)+CreatedJobs_20_5)+CreatedJobs_2_2)+CreatedJobs_16_2)+CreatedJobs_2_1)+CreatedJobs_7_4)+CreatedJobs_4_4)+CreatedJobs_2_4)+CreatedJobs_9_3)+CreatedJobs_13_4)+CreatedJobs_11_5)+CreatedJobs_16_3)+CreatedJobs_7_5)+CreatedJobs_1_3)+CreatedJobs_17_1)+CreatedJobs_0_5)+CreatedJobs_8_2)+CreatedJobs_10_2)+CreatedJobs_3_1)+CreatedJobs_14_4)+CreatedJobs_14_5)+CreatedJobs_8_5)+CreatedJobs_15_3)+CreatedJobs_14_3)+CreatedJobs_9_2)+CreatedJobs_15_4)+CreatedJobs_7_2)+CreatedJobs_16_4)+CreatedJobs_1_1)+CreatedJobs_13_5)+CreatedJobs_14_2)+CreatedJobs_6_4)+CreatedJobs_9_4)+CreatedJobs_20_4)+CreatedJobs_17_2)+CreatedJobs_11_1)+CreatedJobs_0_4)+CreatedJobs_3_3)+CreatedJobs_8_1)+CreatedJobs_15_2)+CreatedJobs_16_5)+CreatedJobs_13_3)+CreatedJobs_10_1)+CreatedJobs_8_4)+CreatedJobs_5_5)+CreatedJobs_18_1)+CreatedJobs_19_4)+CreatedJobs_1_4)+CreatedJobs_0_1)+CreatedJobs_17_4)+CreatedJobs_15_5)+CreatedJobs_4_3)+CreatedJobs_5_3)+CreatedJobs_6_1)+CreatedJobs_6_2)+CreatedJobs_19_1)+CreatedJobs_6_5)+CreatedJobs_18_4)+CreatedJobs_13_1)+CreatedJobs_19_2)+CreatedJobs_12_3)+CreatedJobs_19_3)+CreatedJobs_13_2)+CreatedJobs_5_2)+CreatedJobs_11_3)+CreatedJobs_18_2)+CreatedJobs_4_2)+CreatedJobs_10_4)+CreatedJobs_6_3)+CreatedJobs_20_1)+CreatedJobs_3_4)+CreatedJobs_7_1)+CreatedJobs_12_1)+CreatedJobs_20_3)+CreatedJobs_4_1)+CreatedJobs_3_5)+CreatedJobs_0_2)+CreatedJobs_4_5)+CreatedJobs_11_2)+CreatedJobs_17_5)+CreatedJobs_18_5)+CreatedJobs_11_4)+CreatedJobs_10_3)+CreatedJobs_7_3)+CreatedJobs_17_3)+CreatedJobs_0_3)+CreatedJobs_1_2)+CreatedJobs_12_5)+CreatedJobs_12_4)+CreatedJobs_2_5)+CreatedJobs_20_2)+CreatedJobs_19_5)+CreatedJobs_15_1)+CreatedJobs_3_2)+CreatedJobs_9_5)+CreatedJobs_14_1)+CreatedJobs_18_3)+CreatedJobs_5_4)+CreatedJobs_5_1)+CreatedJobs_1_5)+CreatedJobs_12_2)+CreatedJobs_8_3)))||((Check_Sources_B_1>=2)&&(place_787_1<=mi2)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
[2020-05-19 00:04:24] [INFO ] BMC solution for property PolyORBNT-PT-S05J20-ReachabilityCardinality-04(UNSAT) depth K=9 took 1795969 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-PT-S05J20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tajo-158961390700638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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