Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.4K Jun 7 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 16:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 16:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 7 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q8m004-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654737528991

Running Version 0
[2022-06-09 01:18:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 01:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 01:18:51] [INFO ] Load time of PNML (sax parser for PT used): 897 ms
[2022-06-09 01:18:51] [INFO ] Transformed 754 places.
[2022-06-09 01:18:51] [INFO ] Transformed 27370 transitions.
[2022-06-09 01:18:51] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1050 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 95 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 85 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 1103240 steps, run timeout after 30001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 1103240 steps, saw 658423 distinct states, run finished after 30006 ms. (steps per millisecond=36 ) properties seen :{}
Running SMT prover for 8 properties.
[2022-06-09 01:19:22] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 01:19:22] [INFO ] Computed 10 place invariants in 36 ms
[2022-06-09 01:19:22] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-06-09 01:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:23] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2022-06-09 01:19:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:23] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2022-06-09 01:19:23] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 01:19:24] [INFO ] [Nat]Added 316 Read/Feed constraints in 181 ms returned sat
[2022-06-09 01:19:24] [INFO ] Deduced a trap composed of 57 places in 505 ms of which 6 ms to minimize.
[2022-06-09 01:19:25] [INFO ] Deduced a trap composed of 101 places in 449 ms of which 2 ms to minimize.
[2022-06-09 01:19:25] [INFO ] Deduced a trap composed of 48 places in 444 ms of which 2 ms to minimize.
[2022-06-09 01:19:26] [INFO ] Deduced a trap composed of 135 places in 471 ms of which 1 ms to minimize.
[2022-06-09 01:19:26] [INFO ] Deduced a trap composed of 133 places in 518 ms of which 1 ms to minimize.
[2022-06-09 01:19:27] [INFO ] Deduced a trap composed of 23 places in 439 ms of which 1 ms to minimize.
[2022-06-09 01:19:27] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 0 ms to minimize.
[2022-06-09 01:19:28] [INFO ] Deduced a trap composed of 142 places in 465 ms of which 0 ms to minimize.
[2022-06-09 01:19:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-09 01:19:28] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:29] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2022-06-09 01:19:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:29] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2022-06-09 01:19:29] [INFO ] [Nat]Added 316 Read/Feed constraints in 198 ms returned sat
[2022-06-09 01:19:30] [INFO ] Deduced a trap composed of 57 places in 464 ms of which 1 ms to minimize.
[2022-06-09 01:19:30] [INFO ] Deduced a trap composed of 56 places in 442 ms of which 0 ms to minimize.
[2022-06-09 01:19:31] [INFO ] Deduced a trap composed of 123 places in 427 ms of which 1 ms to minimize.
[2022-06-09 01:19:31] [INFO ] Deduced a trap composed of 131 places in 409 ms of which 1 ms to minimize.
[2022-06-09 01:19:32] [INFO ] Deduced a trap composed of 19 places in 324 ms of which 1 ms to minimize.
[2022-06-09 01:19:32] [INFO ] Deduced a trap composed of 55 places in 257 ms of which 0 ms to minimize.
[2022-06-09 01:19:33] [INFO ] Deduced a trap composed of 14 places in 298 ms of which 1 ms to minimize.
[2022-06-09 01:19:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3374 ms
[2022-06-09 01:19:33] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 305 ms.
[2022-06-09 01:19:34] [INFO ] Added : 20 causal constraints over 4 iterations in 915 ms. Result :unknown
[2022-06-09 01:19:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:34] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2022-06-09 01:19:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:35] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2022-06-09 01:19:35] [INFO ] [Nat]Added 316 Read/Feed constraints in 178 ms returned sat
[2022-06-09 01:19:35] [INFO ] Deduced a trap composed of 38 places in 412 ms of which 1 ms to minimize.
[2022-06-09 01:19:36] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 0 ms to minimize.
[2022-06-09 01:19:36] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 0 ms to minimize.
[2022-06-09 01:19:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1341 ms
[2022-06-09 01:19:36] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 207 ms.
[2022-06-09 01:19:39] [INFO ] Added : 100 causal constraints over 20 iterations in 3013 ms. Result :unknown
[2022-06-09 01:19:39] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:40] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-06-09 01:19:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-09 01:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:40] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2022-06-09 01:19:41] [INFO ] [Nat]Added 316 Read/Feed constraints in 185 ms returned sat
[2022-06-09 01:19:41] [INFO ] Deduced a trap composed of 40 places in 393 ms of which 0 ms to minimize.
[2022-06-09 01:19:42] [INFO ] Deduced a trap composed of 59 places in 458 ms of which 0 ms to minimize.
[2022-06-09 01:19:42] [INFO ] Deduced a trap composed of 57 places in 396 ms of which 1 ms to minimize.
[2022-06-09 01:19:43] [INFO ] Deduced a trap composed of 82 places in 411 ms of which 1 ms to minimize.
[2022-06-09 01:19:43] [INFO ] Deduced a trap composed of 20 places in 404 ms of which 1 ms to minimize.
[2022-06-09 01:19:43] [INFO ] Deduced a trap composed of 16 places in 400 ms of which 1 ms to minimize.
[2022-06-09 01:19:44] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:19:44] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 1 ms to minimize.
[2022-06-09 01:19:45] [INFO ] Deduced a trap composed of 24 places in 356 ms of which 0 ms to minimize.
[2022-06-09 01:19:45] [INFO ] Deduced a trap composed of 15 places in 545 ms of which 1 ms to minimize.
[2022-06-09 01:19:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-09 01:19:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:46] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2022-06-09 01:19:46] [INFO ] [Real]Added 316 Read/Feed constraints in 150 ms returned sat
[2022-06-09 01:19:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:47] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2022-06-09 01:19:47] [INFO ] [Nat]Added 316 Read/Feed constraints in 191 ms returned sat
[2022-06-09 01:19:47] [INFO ] Deduced a trap composed of 105 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 68 places in 341 ms of which 2 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 67 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 1 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Deduced a trap composed of 104 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:19:50] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 5 ms to minimize.
[2022-06-09 01:19:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3044 ms
[2022-06-09 01:19:50] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 293 ms.
[2022-06-09 01:19:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-09 01:19:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2022-06-09 01:19:51] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2022-06-09 01:19:51] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 1584700 steps, including 36886 resets, run finished after 12567 ms. (steps per millisecond=126 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1947700 steps, including 30417 resets, run finished after 14305 ms. (steps per millisecond=136 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 16 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 350 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
[2022-06-09 01:20:19] [INFO ] Flatten gal took : 480 ms
[2022-06-09 01:20:20] [INFO ] Flatten gal took : 198 ms
[2022-06-09 01:20:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13836409412352744421.gal : 92 ms
[2022-06-09 01:20:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9960068202662291152.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13836409412352744421.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9960068202662291152.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13836409412352744421.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9960068202662291152.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9960068202662291152.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 49
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :49 after 214
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :214 after 539
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :539 after 1184
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1184 after 2469
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2469 after 5034
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :5034 after 10159
Detected timeout of ITS tools.
[2022-06-09 01:20:35] [INFO ] Flatten gal took : 176 ms
[2022-06-09 01:20:35] [INFO ] Applying decomposition
[2022-06-09 01:20:35] [INFO ] Flatten gal took : 174 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7361279662012682250.txt, -o, /tmp/graph7361279662012682250.bin, -w, /tmp/graph7361279662012682250.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7361279662012682250.bin, -l, -1, -v, -w, /tmp/graph7361279662012682250.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:20:36] [INFO ] Decomposing Gal with order
[2022-06-09 01:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:20:36] [INFO ] Removed a total of 308 redundant transitions.
[2022-06-09 01:20:36] [INFO ] Flatten gal took : 429 ms
[2022-06-09 01:20:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 380 labels/synchronizations in 53 ms.
[2022-06-09 01:20:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8518262407414535017.gal : 25 ms
[2022-06-09 01:20:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7997272845900424492.prop : 72 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8518262407414535017.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7997272845900424492.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8518262407414535017.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7997272845900424492.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7997272845900424492.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 20
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :20 after 124
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :124 after 449
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :449 after 1094
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1094 after 2379
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2379 after 4944
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :4944 after 10069
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17175710085084170360
[2022-06-09 01:20:52] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17175710085084170360
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17175710085084170360]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17175710085084170360] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17175710085084170360] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6196 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2010 ms. (steps per millisecond=497 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2255 ms. (steps per millisecond=443 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2259 ms. (steps per millisecond=442 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2058 ms. (steps per millisecond=485 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1490138 steps, run timeout after 30001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 1490138 steps, saw 808009 distinct states, run finished after 30002 ms. (steps per millisecond=49 ) properties seen :{}
Running SMT prover for 5 properties.
[2022-06-09 01:21:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:40] [INFO ] Computed 8 place invariants in 25 ms
[2022-06-09 01:21:40] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2022-06-09 01:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:40] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2022-06-09 01:21:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:41] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-09 01:21:41] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:21:41] [INFO ] [Nat]Added 296 Read/Feed constraints in 203 ms returned sat
[2022-06-09 01:21:42] [INFO ] Deduced a trap composed of 98 places in 348 ms of which 1 ms to minimize.
[2022-06-09 01:21:42] [INFO ] Deduced a trap composed of 95 places in 425 ms of which 0 ms to minimize.
[2022-06-09 01:21:42] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 0 ms to minimize.
[2022-06-09 01:21:43] [INFO ] Deduced a trap composed of 58 places in 336 ms of which 1 ms to minimize.
[2022-06-09 01:21:43] [INFO ] Deduced a trap composed of 62 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:21:44] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:21:44] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 1 ms to minimize.
[2022-06-09 01:21:44] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2022-06-09 01:21:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3373 ms
[2022-06-09 01:21:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 209 ms.
[2022-06-09 01:21:48] [INFO ] Added : 105 causal constraints over 21 iterations in 3294 ms. Result :sat
[2022-06-09 01:21:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:48] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-06-09 01:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:49] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-06-09 01:21:49] [INFO ] [Nat]Added 296 Read/Feed constraints in 186 ms returned sat
[2022-06-09 01:21:50] [INFO ] Deduced a trap composed of 19 places in 360 ms of which 0 ms to minimize.
[2022-06-09 01:21:50] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 0 ms to minimize.
[2022-06-09 01:21:50] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 1 ms to minimize.
[2022-06-09 01:21:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1155 ms
[2022-06-09 01:21:51] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 204 ms.
[2022-06-09 01:21:54] [INFO ] Added : 121 causal constraints over 25 iterations in 3882 ms. Result :sat
[2022-06-09 01:21:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:55] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-06-09 01:21:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:55] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2022-06-09 01:21:56] [INFO ] [Nat]Added 296 Read/Feed constraints in 190 ms returned sat
[2022-06-09 01:21:56] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 0 ms to minimize.
[2022-06-09 01:21:56] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 0 ms to minimize.
[2022-06-09 01:21:57] [INFO ] Deduced a trap composed of 72 places in 404 ms of which 0 ms to minimize.
[2022-06-09 01:21:57] [INFO ] Deduced a trap composed of 57 places in 378 ms of which 0 ms to minimize.
[2022-06-09 01:21:58] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 1 ms to minimize.
[2022-06-09 01:21:58] [INFO ] Deduced a trap composed of 15 places in 376 ms of which 0 ms to minimize.
[2022-06-09 01:21:59] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 0 ms to minimize.
[2022-06-09 01:21:59] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2022-06-09 01:21:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3306 ms
[2022-06-09 01:21:59] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 271 ms.
[2022-06-09 01:22:03] [INFO ] Added : 112 causal constraints over 23 iterations in 3754 ms. Result :sat
[2022-06-09 01:22:03] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:03] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-06-09 01:22:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:04] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2022-06-09 01:22:04] [INFO ] [Nat]Added 296 Read/Feed constraints in 198 ms returned sat
[2022-06-09 01:22:04] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 4 ms to minimize.
[2022-06-09 01:22:05] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2022-06-09 01:22:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 785 ms
[2022-06-09 01:22:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 205 ms.
[2022-06-09 01:22:08] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 0 ms to minimize.
[2022-06-09 01:22:09] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 0 ms to minimize.
[2022-06-09 01:22:09] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 0 ms to minimize.
[2022-06-09 01:22:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1112 ms
[2022-06-09 01:22:09] [INFO ] Added : 98 causal constraints over 21 iterations in 4636 ms. Result :sat
[2022-06-09 01:22:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:10] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2022-06-09 01:22:10] [INFO ] [Real]Added 296 Read/Feed constraints in 163 ms returned sat
[2022-06-09 01:22:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:11] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2022-06-09 01:22:11] [INFO ] [Nat]Added 296 Read/Feed constraints in 200 ms returned sat
[2022-06-09 01:22:11] [INFO ] Deduced a trap composed of 93 places in 354 ms of which 0 ms to minimize.
[2022-06-09 01:22:12] [INFO ] Deduced a trap composed of 97 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:22:12] [INFO ] Deduced a trap composed of 26 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:22:13] [INFO ] Deduced a trap composed of 83 places in 341 ms of which 4 ms to minimize.
[2022-06-09 01:22:13] [INFO ] Deduced a trap composed of 93 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:22:14] [INFO ] Deduced a trap composed of 95 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:22:14] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:22:14] [INFO ] Deduced a trap composed of 89 places in 319 ms of which 1 ms to minimize.
[2022-06-09 01:22:15] [INFO ] Deduced a trap composed of 89 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:22:15] [INFO ] Deduced a trap composed of 89 places in 330 ms of which 3 ms to minimize.
[2022-06-09 01:22:16] [INFO ] Deduced a trap composed of 64 places in 360 ms of which 1 ms to minimize.
[2022-06-09 01:22:16] [INFO ] Deduced a trap composed of 64 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:22:16] [INFO ] Deduced a trap composed of 90 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:22:17] [INFO ] Deduced a trap composed of 93 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:22:17] [INFO ] Deduced a trap composed of 92 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:18] [INFO ] Deduced a trap composed of 95 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:18] [INFO ] Deduced a trap composed of 94 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:22:19] [INFO ] Deduced a trap composed of 93 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:22:19] [INFO ] Deduced a trap composed of 93 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:22:19] [INFO ] Deduced a trap composed of 92 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:22:20] [INFO ] Deduced a trap composed of 92 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:22:20] [INFO ] Deduced a trap composed of 93 places in 353 ms of which 1 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 92 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 97 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 96 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:22:22] [INFO ] Deduced a trap composed of 96 places in 363 ms of which 0 ms to minimize.
[2022-06-09 01:22:22] [INFO ] Deduced a trap composed of 96 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 96 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 96 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 96 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 96 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 96 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:22:25] [INFO ] Deduced a trap composed of 97 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:22:25] [INFO ] Deduced a trap composed of 94 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:22:26] [INFO ] Deduced a trap composed of 94 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:22:26] [INFO ] Deduced a trap composed of 93 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 93 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 94 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 93 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:22:28] [INFO ] Deduced a trap composed of 94 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:28] [INFO ] Deduced a trap composed of 93 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:22:29] [INFO ] Deduced a trap composed of 60 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:22:29] [INFO ] Deduced a trap composed of 93 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:22:29] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:30] [INFO ] Deduced a trap composed of 89 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:22:30] [INFO ] Deduced a trap composed of 93 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:22:31] [INFO ] Deduced a trap composed of 89 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:22:31] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:22:32] [INFO ] Deduced a trap composed of 94 places in 307 ms of which 1 ms to minimize.
[2022-06-09 01:22:32] [INFO ] Deduced a trap composed of 94 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:22:32] [INFO ] Deduced a trap composed of 94 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:22:33] [INFO ] Deduced a trap composed of 94 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:22:33] [INFO ] Deduced a trap composed of 94 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 94 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 82 places in 300 ms of which 0 ms to minimize.
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 81 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 62 places in 303 ms of which 0 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 81 places in 305 ms of which 1 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 0 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 0 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 95 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 95 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 92 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 93 places in 315 ms of which 1 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 93 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 27403 ms
[2022-06-09 01:22:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 200 ms.
[2022-06-09 01:22:42] [INFO ] Deduced a trap composed of 92 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:22:43] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:22:43] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:22:44] [INFO ] Deduced a trap composed of 93 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:22:44] [INFO ] Deduced a trap composed of 94 places in 315 ms of which 1 ms to minimize.
[2022-06-09 01:22:45] [INFO ] Deduced a trap composed of 93 places in 315 ms of which 1 ms to minimize.
[2022-06-09 01:22:45] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:22:46] [INFO ] Deduced a trap composed of 67 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:22:46] [INFO ] Deduced a trap composed of 67 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:22:46] [INFO ] Deduced a trap composed of 15 places in 316 ms of which 1 ms to minimize.
[2022-06-09 01:22:47] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:22:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5090 ms
[2022-06-09 01:22:48] [INFO ] Added : 109 causal constraints over 24 iterations in 9153 ms. Result :sat
Incomplete Parikh walk after 1188900 steps, including 1000 resets, run finished after 9444 ms. (steps per millisecond=125 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1345500 steps, including 1000 resets, run finished after 11640 ms. (steps per millisecond=115 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1572600 steps, including 1000 resets, run finished after 12216 ms. (steps per millisecond=128 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1003800 steps, including 1002 resets, run finished after 6982 ms. (steps per millisecond=143 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1090800 steps, including 1000 resets, run finished after 8480 ms. (steps per millisecond=128 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 16 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:23:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:37] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:23:37] [INFO ] Implicit Places using invariants in 542 ms returned []
[2022-06-09 01:23:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:37] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 01:23:38] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:23:44] [INFO ] Implicit Places using invariants and state equation in 6845 ms returned []
Implicit Place search using SMT with State Equation took 7391 ms to find 0 implicit places.
[2022-06-09 01:23:44] [INFO ] Redundant transitions in 296 ms returned []
[2022-06-09 01:23:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:44] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:23:45] [INFO ] Dead Transitions using invariants and state equation in 1039 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100000 steps, including 3 resets, run finished after 700 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-09 01:23:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:23:46] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:23:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:47] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2022-06-09 01:23:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:47] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2022-06-09 01:23:47] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:23:47] [INFO ] [Nat]Added 296 Read/Feed constraints in 202 ms returned sat
[2022-06-09 01:23:48] [INFO ] Deduced a trap composed of 98 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:23:48] [INFO ] Deduced a trap composed of 95 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:23:48] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:23:49] [INFO ] Deduced a trap composed of 58 places in 356 ms of which 0 ms to minimize.
[2022-06-09 01:23:49] [INFO ] Deduced a trap composed of 62 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 24 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 61 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2022-06-09 01:23:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3262 ms
[2022-06-09 01:23:51] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 440 ms.
[2022-06-09 01:23:54] [INFO ] Added : 105 causal constraints over 21 iterations in 3589 ms. Result :sat
[2022-06-09 01:23:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:55] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2022-06-09 01:23:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-09 01:23:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:55] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2022-06-09 01:23:55] [INFO ] [Nat]Added 296 Read/Feed constraints in 186 ms returned sat
[2022-06-09 01:23:56] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 0 ms to minimize.
[2022-06-09 01:23:56] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2022-06-09 01:23:56] [INFO ] Deduced a trap composed of 58 places in 241 ms of which 0 ms to minimize.
[2022-06-09 01:23:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1165 ms
[2022-06-09 01:23:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 195 ms.
[2022-06-09 01:24:00] [INFO ] Added : 121 causal constraints over 25 iterations in 3936 ms. Result :sat
[2022-06-09 01:24:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:01] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2022-06-09 01:24:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:24:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:02] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2022-06-09 01:24:02] [INFO ] [Nat]Added 296 Read/Feed constraints in 192 ms returned sat
[2022-06-09 01:24:02] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 1 ms to minimize.
[2022-06-09 01:24:03] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 1 ms to minimize.
[2022-06-09 01:24:03] [INFO ] Deduced a trap composed of 72 places in 375 ms of which 1 ms to minimize.
[2022-06-09 01:24:04] [INFO ] Deduced a trap composed of 57 places in 384 ms of which 0 ms to minimize.
[2022-06-09 01:24:04] [INFO ] Deduced a trap composed of 21 places in 381 ms of which 1 ms to minimize.
[2022-06-09 01:24:04] [INFO ] Deduced a trap composed of 15 places in 382 ms of which 0 ms to minimize.
[2022-06-09 01:24:05] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2022-06-09 01:24:05] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2022-06-09 01:24:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3244 ms
[2022-06-09 01:24:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 205 ms.
[2022-06-09 01:24:09] [INFO ] Added : 112 causal constraints over 23 iterations in 3576 ms. Result :sat
[2022-06-09 01:24:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:24:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:09] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-06-09 01:24:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:24:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:24:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:10] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2022-06-09 01:24:10] [INFO ] [Nat]Added 296 Read/Feed constraints in 194 ms returned sat
[2022-06-09 01:24:10] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:24:10] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2022-06-09 01:24:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 756 ms
[2022-06-09 01:24:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 202 ms.
[2022-06-09 01:24:14] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 1 ms to minimize.
[2022-06-09 01:24:14] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2022-06-09 01:24:15] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2022-06-09 01:24:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1095 ms
[2022-06-09 01:24:15] [INFO ] Added : 98 causal constraints over 21 iterations in 4616 ms. Result :sat
[2022-06-09 01:24:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:16] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2022-06-09 01:24:16] [INFO ] [Real]Added 296 Read/Feed constraints in 165 ms returned sat
[2022-06-09 01:24:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:24:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:16] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2022-06-09 01:24:17] [INFO ] [Nat]Added 296 Read/Feed constraints in 202 ms returned sat
[2022-06-09 01:24:17] [INFO ] Deduced a trap composed of 93 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:24:17] [INFO ] Deduced a trap composed of 97 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:24:18] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 1 ms to minimize.
[2022-06-09 01:24:18] [INFO ] Deduced a trap composed of 83 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:24:19] [INFO ] Deduced a trap composed of 93 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:24:19] [INFO ] Deduced a trap composed of 95 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:24:19] [INFO ] Deduced a trap composed of 90 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:24:20] [INFO ] Deduced a trap composed of 89 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:24:20] [INFO ] Deduced a trap composed of 89 places in 314 ms of which 1 ms to minimize.
[2022-06-09 01:24:21] [INFO ] Deduced a trap composed of 89 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:24:21] [INFO ] Deduced a trap composed of 64 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:24:22] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 1 ms to minimize.
[2022-06-09 01:24:22] [INFO ] Deduced a trap composed of 90 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:24:22] [INFO ] Deduced a trap composed of 93 places in 316 ms of which 1 ms to minimize.
[2022-06-09 01:24:23] [INFO ] Deduced a trap composed of 92 places in 319 ms of which 1 ms to minimize.
[2022-06-09 01:24:23] [INFO ] Deduced a trap composed of 95 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:24:24] [INFO ] Deduced a trap composed of 94 places in 322 ms of which 1 ms to minimize.
[2022-06-09 01:24:24] [INFO ] Deduced a trap composed of 93 places in 313 ms of which 1 ms to minimize.
[2022-06-09 01:24:24] [INFO ] Deduced a trap composed of 93 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:24:25] [INFO ] Deduced a trap composed of 92 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:24:25] [INFO ] Deduced a trap composed of 92 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:24:26] [INFO ] Deduced a trap composed of 93 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:24:26] [INFO ] Deduced a trap composed of 92 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:24:26] [INFO ] Deduced a trap composed of 97 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:24:27] [INFO ] Deduced a trap composed of 96 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:24:27] [INFO ] Deduced a trap composed of 96 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:24:28] [INFO ] Deduced a trap composed of 96 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:24:28] [INFO ] Deduced a trap composed of 96 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:24:29] [INFO ] Deduced a trap composed of 96 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:24:29] [INFO ] Deduced a trap composed of 96 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:24:29] [INFO ] Deduced a trap composed of 96 places in 326 ms of which 1 ms to minimize.
[2022-06-09 01:24:30] [INFO ] Deduced a trap composed of 96 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:24:30] [INFO ] Deduced a trap composed of 97 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:24:31] [INFO ] Deduced a trap composed of 94 places in 327 ms of which 1 ms to minimize.
[2022-06-09 01:24:31] [INFO ] Deduced a trap composed of 94 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:24:31] [INFO ] Deduced a trap composed of 93 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:24:32] [INFO ] Deduced a trap composed of 93 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:24:32] [INFO ] Deduced a trap composed of 94 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:24:33] [INFO ] Deduced a trap composed of 93 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:24:33] [INFO ] Deduced a trap composed of 94 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:24:33] [INFO ] Deduced a trap composed of 93 places in 303 ms of which 0 ms to minimize.
[2022-06-09 01:24:34] [INFO ] Deduced a trap composed of 60 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:24:34] [INFO ] Deduced a trap composed of 93 places in 316 ms of which 1 ms to minimize.
[2022-06-09 01:24:35] [INFO ] Deduced a trap composed of 58 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:24:35] [INFO ] Deduced a trap composed of 89 places in 310 ms of which 1 ms to minimize.
[2022-06-09 01:24:35] [INFO ] Deduced a trap composed of 93 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:24:36] [INFO ] Deduced a trap composed of 89 places in 322 ms of which 1 ms to minimize.
[2022-06-09 01:24:36] [INFO ] Deduced a trap composed of 14 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:24:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-09 01:24:37] [INFO ] Flatten gal took : 165 ms
[2022-06-09 01:24:37] [INFO ] Flatten gal took : 163 ms
[2022-06-09 01:24:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4648185922342529291.gal : 13 ms
[2022-06-09 01:24:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1293701591322414947.prop : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4648185922342529291.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1293701591322414947.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4648185922342529291.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1293701591322414947.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1293701591322414947.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 49
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :49 after 214
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :214 after 539
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :539 after 1184
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1184 after 2469
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2469 after 5034
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :5034 after 10159
Detected timeout of ITS tools.
[2022-06-09 01:24:52] [INFO ] Flatten gal took : 157 ms
[2022-06-09 01:24:52] [INFO ] Applying decomposition
[2022-06-09 01:24:52] [INFO ] Flatten gal took : 158 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6286895375138754741.txt, -o, /tmp/graph6286895375138754741.bin, -w, /tmp/graph6286895375138754741.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6286895375138754741.bin, -l, -1, -v, -w, /tmp/graph6286895375138754741.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:24:52] [INFO ] Decomposing Gal with order
[2022-06-09 01:24:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:24:53] [INFO ] Removed a total of 308 redundant transitions.
[2022-06-09 01:24:53] [INFO ] Flatten gal took : 265 ms
[2022-06-09 01:24:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 380 labels/synchronizations in 28 ms.
[2022-06-09 01:24:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6379494629583385328.gal : 14 ms
[2022-06-09 01:24:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality665266340916589126.prop : 95 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6379494629583385328.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality665266340916589126.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6379494629583385328.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality665266340916589126.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality665266340916589126.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 20
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :20 after 124
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :124 after 449
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :449 after 1094
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1094 after 2379
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2379 after 4944
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :4944 after 10069
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6321018510008381212
[2022-06-09 01:25:08] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6321018510008381212
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6321018510008381212]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6321018510008381212] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6321018510008381212] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 268 transition count 3696
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 181 place count 268 transition count 3691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 468 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 3691 rows 263 cols
[2022-06-09 01:25:10] [INFO ] Computed 9 place invariants in 27 ms
[2022-06-09 01:25:10] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2022-06-09 01:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:10] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2022-06-09 01:25:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:11] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2022-06-09 01:25:11] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 311 ms.
[2022-06-09 01:25:11] [INFO ] Added : 4 causal constraints over 2 iterations in 679 ms. Result :sat
[2022-06-09 01:25:12] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:12] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2022-06-09 01:25:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:13] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-06-09 01:25:13] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 236 ms.
[2022-06-09 01:25:13] [INFO ] Added : 5 causal constraints over 3 iterations in 704 ms. Result :sat
[2022-06-09 01:25:13] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:14] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-06-09 01:25:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:15] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-06-09 01:25:15] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 235 ms.
[2022-06-09 01:25:15] [INFO ] Added : 4 causal constraints over 1 iterations in 513 ms. Result :sat
[2022-06-09 01:25:15] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:16] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2022-06-09 01:25:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:16] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2022-06-09 01:25:17] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 310 ms.
[2022-06-09 01:25:17] [INFO ] Added : 5 causal constraints over 3 iterations in 782 ms. Result :sat
[2022-06-09 01:25:17] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:18] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2022-06-09 01:25:18] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 230 ms.
[2022-06-09 01:25:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:19] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2022-06-09 01:25:19] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 232 ms.
[2022-06-09 01:25:20] [INFO ] Added : 6 causal constraints over 3 iterations in 707 ms. Result :sat
[2022-06-09 01:25:20] [INFO ] Flatten gal took : 173 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin770815530533037167
[2022-06-09 01:25:20] [INFO ] Too many transitions (3871) to apply POR reductions. Disabling POR matrices.
[2022-06-09 01:25:20] [INFO ] Flatten gal took : 234 ms
[2022-06-09 01:25:20] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin770815530533037167
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin770815530533037167]
[2022-06-09 01:25:20] [INFO ] Applying decomposition
[2022-06-09 01:25:21] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 01:25:21] [INFO ] Flatten gal took : 402 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9578843779004405321.txt, -o, /tmp/graph9578843779004405321.bin, -w, /tmp/graph9578843779004405321.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9578843779004405321.bin, -l, -1, -v, -w, /tmp/graph9578843779004405321.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:25:21] [INFO ] Decomposing Gal with order
[2022-06-09 01:25:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:25:22] [INFO ] Removed a total of 308 redundant transitions.
[2022-06-09 01:25:22] [INFO ] Flatten gal took : 738 ms
[2022-06-09 01:25:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 380 labels/synchronizations in 24 ms.
[2022-06-09 01:25:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1487941353328012611.gal : 15 ms
[2022-06-09 01:25:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5792495681150338452.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1487941353328012611.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5792495681150338452.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1487941353328012611.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5792495681150338452.prop --nowitness --gen-order FOLLOW
[2022-06-09 01:25:23] [INFO ] Ran tautology test, simplified 0 / 5 in 3134 ms.
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(UNSAT) depth K=0 took 12 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(UNSAT) depth K=0 took 12 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(UNSAT) depth K=0 took 24 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(UNSAT) depth K=0 took 3 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(UNSAT) depth K=0 took 2 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(UNSAT) depth K=1 took 17 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(UNSAT) depth K=1 took 3 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(UNSAT) depth K=1 took 2 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(UNSAT) depth K=1 took 10 ms
[2022-06-09 01:25:23] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(UNSAT) depth K=1 took 16 ms
Loading property file /tmp/ReachabilityCardinality5792495681150338452.prop.
[2022-06-09 01:25:24] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(UNSAT) depth K=2 took 565 ms
[2022-06-09 01:25:24] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(UNSAT) depth K=2 took 127 ms
[2022-06-09 01:25:24] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(UNSAT) depth K=2 took 127 ms
[2022-06-09 01:25:24] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(UNSAT) depth K=2 took 21 ms
[2022-06-09 01:25:24] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(UNSAT) depth K=2 took 3 ms
[2022-06-09 01:25:25] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(UNSAT) depth K=3 took 262 ms
[2022-06-09 01:25:25] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(UNSAT) depth K=3 took 187 ms
[2022-06-09 01:25:25] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(UNSAT) depth K=3 took 203 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 20
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :20 after 124
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :124 after 449
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :449 after 1094
[2022-06-09 01:25:25] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(UNSAT) depth K=3 took 259 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:25] [INFO ] Computed 8 place invariants in 11 ms
inv : x0_BUG_REPORT_q0 + x0_BUG_REPORT_q2 + x0_BUG_REPORT_q4 + x0_BUG_REPORT_q7 + x0_BUG_REPORT_q8 + x0_CLOSED_q4 + x0_CLOSED_q7 + x0_CLOSED_q8 + x0_FIXED_q4 + x0_FIXED_q7 + x0_FIXED_q8 + x0_FIX_AGAIN_q7 + x0_FIX_AGAIN_q8 + x0_MORE_INFO_q2 + x0_MORE_INFO_q4 + x0_MORE_INFO_q7 + x0_MORE_INFO_q8 + x0_MUST_FIX_q4 + x0_MUST_FIX_q7 + x0_MUST_FIX_q8 + x0_PENDING_q4 + x0_PENDING_q7 + x0_PENDING_q8 + x0_VERIFIED_q7 + x0_VERIFIED_q8 = 1
inv : l5 + l6 + l9 = 1
inv : x3_BUG_REPORT_q0 + x3_BUG_REPORT_q3 + x3_BUG_REPORT_q5 + x3_BUG_REPORT_q8 + x3_CLOSED_q5 + x3_CLOSED_q8 + x3_FIXED_q3 + x3_FIXED_q5 + x3_FIXED_q8 + x3_FIX_AGAIN_q0 + x3_FIX_AGAIN_q3 + x3_FIX_AGAIN_q5 + x3_FIX_AGAIN_q8 + x3_MORE_INFO_q3 + x3_MORE_INFO_q5 + x3_MORE_INFO_q8 + x3_MUST_FIX_q5 + x3_MUST_FIX_q8 + x3_PENDING_q3 + x3_PENDING_q5 + x3_PENDING_q8 + x3_VERIFIED_q0 + x3_VERIFIED_q3 + x3_VERIFIED_q5 + x3_VERIFIED_q8 = 1
[2022-06-09 01:25:26] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(UNSAT) depth K=3 took 159 ms
inv : l25 + l26 + l28 + l29 + l30 + l31 = 1
inv : x2_BUG_REPORT_q0 + x2_BUG_REPORT_q2 + x2_BUG_REPORT_q4 + x2_BUG_REPORT_q6 + x2_BUG_REPORT_q7 + x2_BUG_REPORT_q8 + x2_CLOSED_q4 + x2_CLOSED_q6 + x2_CLOSED_q7 + x2_CLOSED_q8 + x2_FIXED_q0 + x2_FIXED_q2 + x2_FIXED_q4 + x2_FIXED_q6 + x2_FIXED_q7 + x2_FIXED_q8 + x2_FIX_AGAIN_q6 + x2_FIX_AGAIN_q7 + x2_FIX_AGAIN_q8 + x2_MORE_INFO_q2 + x2_MORE_INFO_q4 + x2_MORE_INFO_q6 + x2_MORE_INFO_q7 + x2_MORE_INFO_q8 + x2_MUST_FIX_q4 + x2_MUST_FIX_q6 + x2_MUST_FIX_q7 + x2_MUST_FIX_q8 + x2_PENDING_q0 + x2_PENDING_q2 + x2_PENDING_q4 + x2_PENDING_q6 + x2_PENDING_q7 + x2_PENDING_q8 + x2_VERIFIED_q6 + x2_VERIFIED_q7 + x2_VERIFIED_q8 = 1
inv : l19 + l20 + l23 + l24 = 1
inv : x4_BUG_REPORT_q0 + x4_BUG_REPORT_q3 + x4_BUG_REPORT_q5 + x4_BUG_REPORT_q6 + x4_BUG_REPORT_q8 + x4_CLOSED_q0 + x4_CLOSED_q3 + x4_CLOSED_q5 + x4_CLOSED_q6 + x4_CLOSED_q8 + x4_FIXED_q3 + x4_FIXED_q5 + x4_FIXED_q6 + x4_FIXED_q8 + x4_FIX_AGAIN_q5 + x4_FIX_AGAIN_q6 + x4_FIX_AGAIN_q8 + x4_MORE_INFO_q3 + x4_MORE_INFO_q5 + x4_MORE_INFO_q6 + x4_MORE_INFO_q8 + x4_MUST_FIX_q0 + x4_MUST_FIX_q3 + x4_MUST_FIX_q5 + x4_MUST_FIX_q6 + x4_MUST_FIX_q8 + x4_PENDING_q3 + x4_PENDING_q5 + x4_PENDING_q6 + x4_PENDING_q8 + x4_VERIFIED_q5 + x4_VERIFIED_q6 + x4_VERIFIED_q8 = 1
inv : x1_BUG_REPORT_q0 + x1_BUG_REPORT_q1 + x1_BUG_REPORT_q8 + x1_CLOSED_q8 + x1_FIXED_q8 + x1_FIX_AGAIN_q8 + x1_MORE_INFO_q0 + x1_MORE_INFO_q1 + x1_MORE_INFO_q8 + x1_MUST_FIX_q8 + x1_PENDING_q8 + x1_VERIFIED_q8 = 1
Total of 8 invariants.
[2022-06-09 01:25:26] [INFO ] Computed 8 place invariants in 53 ms
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1094 after 2379
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2379 after 4944
[2022-06-09 01:25:27] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(UNSAT) depth K=4 took 1618 ms
[2022-06-09 01:25:29] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(UNSAT) depth K=4 took 1499 ms
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :4944 after 10069
[2022-06-09 01:25:33] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(UNSAT) depth K=4 took 4414 ms
[2022-06-09 01:25:35] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(UNSAT) depth K=4 took 1726 ms
[2022-06-09 01:25:40] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(UNSAT) depth K=4 took 5005 ms
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :10069 after 20314
[2022-06-09 01:25:55] [INFO ] Proved 269 variables to be positive in 29105 ms
[2022-06-09 01:25:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-00
[2022-06-09 01:25:55] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(SAT) depth K=0 took 25 ms
[2022-06-09 01:25:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-01
[2022-06-09 01:25:55] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(SAT) depth K=0 took 27 ms
[2022-06-09 01:25:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-02
[2022-06-09 01:25:55] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(SAT) depth K=0 took 25 ms
[2022-06-09 01:25:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-03
[2022-06-09 01:25:55] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(SAT) depth K=0 took 23 ms
[2022-06-09 01:25:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-04
[2022-06-09 01:25:55] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(SAT) depth K=0 took 20 ms
[2022-06-09 01:26:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-00
[2022-06-09 01:26:03] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(SAT) depth K=1 took 8176 ms
[2022-06-09 01:26:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-01
[2022-06-09 01:26:12] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(SAT) depth K=1 took 8698 ms
[2022-06-09 01:26:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-02
[2022-06-09 01:26:20] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(SAT) depth K=1 took 7773 ms
Compilation finished in 61282 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin770815530533037167]
Link finished in 76 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality00==true], workingDir=/tmp/ltsmin770815530533037167]
[2022-06-09 01:26:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-03
[2022-06-09 01:26:39] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(SAT) depth K=1 took 19924 ms
[2022-06-09 01:27:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-04
[2022-06-09 01:27:09] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(SAT) depth K=1 took 29250 ms
[2022-06-09 01:27:44] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(UNSAT) depth K=5 took 123685 ms
[2022-06-09 01:28:22] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(UNSAT) depth K=5 took 38586 ms
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :20314 after 40799
[2022-06-09 01:29:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-00
[2022-06-09 01:29:19] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(SAT) depth K=2 took 130247 ms
[2022-06-09 01:32:01] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(UNSAT) depth K=5 took 218772 ms
[2022-06-09 01:32:33] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(UNSAT) depth K=5 took 32034 ms
[2022-06-09 01:35:02] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(UNSAT) depth K=5 took 148763 ms
[2022-06-09 01:37:33] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(UNSAT) depth K=6 took 150821 ms
WARNING : LTSmin timed out (>720 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality00==true], workingDir=/tmp/ltsmin770815530533037167]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality01==true], workingDir=/tmp/ltsmin770815530533037167]
[2022-06-09 01:39:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-01
[2022-06-09 01:39:51] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(SAT) depth K=2 took 631564 ms
[2022-06-09 01:40:09] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-01(UNSAT) depth K=6 took 156207 ms
[2022-06-09 01:41:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-02
[2022-06-09 01:41:05] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(SAT) depth K=2 took 74562 ms
[2022-06-09 01:42:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-03
[2022-06-09 01:42:15] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(SAT) depth K=2 took 69768 ms
[2022-06-09 01:43:01] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-02(UNSAT) depth K=6 took 171770 ms
Detected timeout of ITS tools.
[2022-06-09 01:47:33] [INFO ] Applying decomposition
[2022-06-09 01:47:34] [INFO ] Flatten gal took : 510 ms
[2022-06-09 01:47:34] [INFO ] Decomposing Gal with order
[2022-06-09 01:47:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:47:35] [INFO ] Removed a total of 308 redundant transitions.
[2022-06-09 01:47:35] [INFO ] Flatten gal took : 902 ms
[2022-06-09 01:47:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 380 labels/synchronizations in 48 ms.
[2022-06-09 01:47:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12443307781774900129.gal : 63 ms
[2022-06-09 01:47:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7842507388964416294.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12443307781774900129.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7842507388964416294.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12443307781774900129.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7842507388964416294.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7842507388964416294.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 20
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :20 after 124
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :124 after 449
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :449 after 1094
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1094 after 2379
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2379 after 4944
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :4944 after 10069
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :10069 after 20314
[2022-06-09 01:49:21] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-03(UNSAT) depth K=6 took 379858 ms
WARNING : LTSmin timed out (>720 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality01==true], workingDir=/tmp/ltsmin770815530533037167]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality02==true], workingDir=/tmp/ltsmin770815530533037167]
[2022-06-09 01:51:39] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(UNSAT) depth K=6 took 138196 ms
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :20314 after 40799
[2022-06-09 01:54:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m004-ReachabilityCardinality-04
[2022-06-09 01:54:25] [INFO ] KInduction solution for property BugTracking-PT-q8m004-ReachabilityCardinality-04(SAT) depth K=2 took 730066 ms
[2022-06-09 02:02:15] [INFO ] BMC solution for property BugTracking-PT-q8m004-ReachabilityCardinality-00(UNSAT) depth K=7 took 636188 ms
WARNING : LTSmin timed out (>720 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality02==true], workingDir=/tmp/ltsmin770815530533037167]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality03==true], workingDir=/tmp/ltsmin770815530533037167]
Detected timeout of ITS tools.
[2022-06-09 02:09:47] [INFO ] Flatten gal took : 510 ms
[2022-06-09 02:09:47] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 02:09:47] [INFO ] Transformed 269 places.
[2022-06-09 02:09:48] [INFO ] Transformed 3871 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 02:09:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16465069081193117334.gal : 46 ms
[2022-06-09 02:09:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8131186674640473818.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16465069081193117334.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8131186674640473818.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16465069081193117334.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8131186674640473818.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality8131186674640473818.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :4 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :11 after 13
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :21 after 26
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :26 after 38
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :233 after 373
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :373 after 471
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :471 after 787
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2513 after 2787
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :6286 after 11578
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :32583 after 36934
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :36934 after 60544
WARNING : LTSmin timed out (>720 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality03==true], workingDir=/tmp/ltsmin770815530533037167]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq8m004ReachabilityCardinality04==true], workingDir=/tmp/ltsmin770815530533037167]
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :392919 after 464612
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :464612 after 846313

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is BugTracking-PT-q8m004, 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 r323-tall-165472292500029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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