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-165472292600032.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-q8m008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 18K Jun 7 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 7 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-q8m008-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654737541307

Running Version 0
[2022-06-09 01:19:03] [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:19:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 01:19:03] [INFO ] Load time of PNML (sax parser for PT used): 807 ms
[2022-06-09 01:19:03] [INFO ] Transformed 754 places.
[2022-06-09 01:19:04] [INFO ] Transformed 27370 transitions.
[2022-06-09 01:19:04] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 983 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 145 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10005 steps, including 62 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 921772 steps, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 921772 steps, saw 523017 distinct states, run finished after 30004 ms. (steps per millisecond=30 ) properties seen :{}
Running SMT prover for 5 properties.
[2022-06-09 01:19:34] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 01:19:34] [INFO ] Computed 10 place invariants in 40 ms
[2022-06-09 01:19:34] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-09 01:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:35] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2022-06-09 01:19:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-09 01:19:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:36] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2022-06-09 01:19:36] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 01:19:36] [INFO ] [Nat]Added 316 Read/Feed constraints in 192 ms returned sat
[2022-06-09 01:19:36] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 10 ms to minimize.
[2022-06-09 01:19:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2022-06-09 01:19:37] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 286 ms.
[2022-06-09 01:19:40] [INFO ] Deduced a trap composed of 12 places in 296 ms of which 2 ms to minimize.
[2022-06-09 01:19:40] [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:40] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2022-06-09 01:19:40] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:41] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2022-06-09 01:19:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:41] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2022-06-09 01:19:42] [INFO ] [Nat]Added 316 Read/Feed constraints in 208 ms returned sat
[2022-06-09 01:19:42] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2022-06-09 01:19:42] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 1 ms to minimize.
[2022-06-09 01:19:43] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2022-06-09 01:19:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 974 ms
[2022-06-09 01:19:43] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 236 ms.
[2022-06-09 01:19:46] [INFO ] Deduced a trap composed of 15 places in 588 ms of which 0 ms to minimize.
[2022-06-09 01:19:46] [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 2
[2022-06-09 01:19:46] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:47] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-06-09 01:19:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:48] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2022-06-09 01:19:48] [INFO ] [Nat]Added 316 Read/Feed constraints in 212 ms returned sat
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 1 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 2 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 0 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 0 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 1 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1690 ms
[2022-06-09 01:19:50] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 251 ms.
[2022-06-09 01:19:52] [INFO ] Added : 80 causal constraints over 16 iterations in 2616 ms. Result :unknown
[2022-06-09 01:19:52] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:53] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2022-06-09 01:19:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:53] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2022-06-09 01:19:53] [INFO ] [Nat]Added 316 Read/Feed constraints in 196 ms returned sat
[2022-06-09 01:19:54] [INFO ] Deduced a trap composed of 82 places in 400 ms of which 1 ms to minimize.
[2022-06-09 01:19:54] [INFO ] Deduced a trap composed of 52 places in 388 ms of which 0 ms to minimize.
[2022-06-09 01:19:55] [INFO ] Deduced a trap composed of 60 places in 389 ms of which 0 ms to minimize.
[2022-06-09 01:19:55] [INFO ] Deduced a trap composed of 20 places in 418 ms of which 0 ms to minimize.
[2022-06-09 01:19:56] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 0 ms to minimize.
[2022-06-09 01:19:56] [INFO ] Deduced a trap composed of 50 places in 455 ms of which 0 ms to minimize.
[2022-06-09 01:19:57] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 0 ms to minimize.
[2022-06-09 01:19:57] [INFO ] Deduced a trap composed of 65 places in 396 ms of which 0 ms to minimize.
[2022-06-09 01:19:58] [INFO ] Deduced a trap composed of 88 places in 410 ms of which 1 ms to minimize.
[2022-06-09 01:19:58] [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
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 1448300 steps, including 1003 resets, run finished after 7390 ms. (steps per millisecond=195 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 18 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 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 278 transition count 3908
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 278 transition count 3901
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 17 place count 271 transition count 3901
Applied a total of 17 rules in 316 ms. Remains 271 /280 variables (removed 9) and now considering 3901/3904 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/280 places, 3901/3904 transitions.
[2022-06-09 01:20:06] [INFO ] Flatten gal took : 386 ms
[2022-06-09 01:20:06] [INFO ] Flatten gal took : 205 ms
[2022-06-09 01:20:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12647616859456155493.gal : 60 ms
[2022-06-09 01:20:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10565972447283783198.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/ReachabilityCardinality12647616859456155493.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10565972447283783198.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/ReachabilityCardinality12647616859456155493.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10565972447283783198.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10565972447283783198.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 260
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :260 after 845
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :845 after 2006
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2006 after 4319
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4319 after 8936
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8936 after 18161
Detected timeout of ITS tools.
[2022-06-09 01:20:22] [INFO ] Flatten gal took : 184 ms
[2022-06-09 01:20:22] [INFO ] Applying decomposition
[2022-06-09 01:20:22] [INFO ] Flatten gal took : 180 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/graph15411250005569146991.txt, -o, /tmp/graph15411250005569146991.bin, -w, /tmp/graph15411250005569146991.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/graph15411250005569146991.bin, -l, -1, -v, -w, /tmp/graph15411250005569146991.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:20:22] [INFO ] Decomposing Gal with order
[2022-06-09 01:20:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:20:23] [INFO ] Removed a total of 218 redundant transitions.
[2022-06-09 01:20:23] [INFO ] Flatten gal took : 434 ms
[2022-06-09 01:20:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 27 ms.
[2022-06-09 01:20:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12014511521600860242.gal : 18 ms
[2022-06-09 01:20:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7275318963535999709.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12014511521600860242.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7275318963535999709.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/ReachabilityCardinality12014511521600860242.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7275318963535999709.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7275318963535999709.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 188
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :188 after 773
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :773 after 1934
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1934 after 4247
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4247 after 8864
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8864 after 18089
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12336268860330847304
[2022-06-09 01:20:38] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12336268860330847304
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/ltsmin12336268860330847304]
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/ltsmin12336268860330847304] 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/ltsmin12336268860330847304] 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 1000005 steps, including 2 resets, run finished after 4205 ms. (steps per millisecond=237 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2083 ms. (steps per millisecond=480 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2124 ms. (steps per millisecond=470 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2312 ms. (steps per millisecond=432 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2099 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1259936 steps, run timeout after 30001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 1259936 steps, saw 819523 distinct states, run finished after 30001 ms. (steps per millisecond=41 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-09 01:21:22] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
// Phase 1: matrix 3721 rows 271 cols
[2022-06-09 01:21:22] [INFO ] Computed 9 place invariants in 21 ms
[2022-06-09 01:21:22] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2022-06-09 01:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:23] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2022-06-09 01:21:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:23] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2022-06-09 01:21:23] [INFO ] State equation strengthened by 317 read => feed constraints.
[2022-06-09 01:21:24] [INFO ] [Nat]Added 317 Read/Feed constraints in 303 ms returned sat
[2022-06-09 01:21:24] [INFO ] Deduced a trap composed of 23 places in 633 ms of which 1 ms to minimize.
[2022-06-09 01:21:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 807 ms
[2022-06-09 01:21:25] [INFO ] Computed and/alt/rep : 461/1753/461 causal constraints (skipped 3259 transitions) in 454 ms.
[2022-06-09 01:21:29] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2022-06-09 01:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2022-06-09 01:21:30] [INFO ] Added : 135 causal constraints over 27 iterations in 5181 ms. Result :sat
[2022-06-09 01:21:30] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:30] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2022-06-09 01:21:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-09 01:21:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:31] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2022-06-09 01:21:31] [INFO ] [Nat]Added 317 Read/Feed constraints in 190 ms returned sat
[2022-06-09 01:21:32] [INFO ] Deduced a trap composed of 61 places in 376 ms of which 0 ms to minimize.
[2022-06-09 01:21:32] [INFO ] Deduced a trap composed of 57 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:21:32] [INFO ] Deduced a trap composed of 39 places in 333 ms of which 3 ms to minimize.
[2022-06-09 01:21:33] [INFO ] Deduced a trap composed of 38 places in 475 ms of which 0 ms to minimize.
[2022-06-09 01:21:33] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:21:34] [INFO ] Deduced a trap composed of 78 places in 359 ms of which 0 ms to minimize.
[2022-06-09 01:21:34] [INFO ] Deduced a trap composed of 40 places in 355 ms of which 0 ms to minimize.
[2022-06-09 01:21:35] [INFO ] Deduced a trap composed of 41 places in 381 ms of which 1 ms to minimize.
[2022-06-09 01:21:35] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 0 ms to minimize.
[2022-06-09 01:21:36] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 0 ms to minimize.
[2022-06-09 01:21:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4676 ms
[2022-06-09 01:21:36] [INFO ] Computed and/alt/rep : 461/1753/461 causal constraints (skipped 3259 transitions) in 223 ms.
[2022-06-09 01:21:40] [INFO ] Deduced a trap composed of 58 places in 377 ms of which 1 ms to minimize.
[2022-06-09 01:21:40] [INFO ] Deduced a trap composed of 58 places in 346 ms of which 1 ms to minimize.
[2022-06-09 01:21:41] [INFO ] Deduced a trap composed of 58 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:21:41] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:21:42] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 0 ms to minimize.
[2022-06-09 01:21:42] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 1 ms to minimize.
[2022-06-09 01:21:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3048 ms
[2022-06-09 01:21:43] [INFO ] Added : 112 causal constraints over 23 iterations in 6791 ms. Result :sat
[2022-06-09 01:21:43] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:43] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2022-06-09 01:21:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:44] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2022-06-09 01:21:44] [INFO ] [Nat]Added 317 Read/Feed constraints in 191 ms returned sat
[2022-06-09 01:21:44] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
[2022-06-09 01:21:45] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 1 ms to minimize.
[2022-06-09 01:21:45] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2022-06-09 01:21:45] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 0 ms to minimize.
[2022-06-09 01:21:45] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 8 ms to minimize.
[2022-06-09 01:21:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1515 ms
[2022-06-09 01:21:46] [INFO ] Computed and/alt/rep : 461/1753/461 causal constraints (skipped 3259 transitions) in 244 ms.
[2022-06-09 01:21:50] [INFO ] Deduced a trap composed of 65 places in 360 ms of which 0 ms to minimize.
[2022-06-09 01:21:50] [INFO ] Deduced a trap composed of 97 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:21:51] [INFO ] Deduced a trap composed of 97 places in 337 ms of which 1 ms to minimize.
[2022-06-09 01:21:51] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 0 ms to minimize.
[2022-06-09 01:21:52] [INFO ] Deduced a trap composed of 43 places in 359 ms of which 0 ms to minimize.
[2022-06-09 01:21:52] [INFO ] Deduced a trap composed of 70 places in 479 ms of which 1 ms to minimize.
[2022-06-09 01:21:53] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 0 ms to minimize.
[2022-06-09 01:21:53] [INFO ] Deduced a trap composed of 60 places in 252 ms of which 1 ms to minimize.
[2022-06-09 01:21:53] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 1 ms to minimize.
[2022-06-09 01:21:54] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 0 ms to minimize.
[2022-06-09 01:21:54] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2022-06-09 01:21:55] [INFO ] Deduced a trap composed of 64 places in 377 ms of which 1 ms to minimize.
[2022-06-09 01:21:55] [INFO ] Deduced a trap composed of 65 places in 360 ms of which 0 ms to minimize.
[2022-06-09 01:21:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6022 ms
[2022-06-09 01:21:56] [INFO ] Added : 108 causal constraints over 23 iterations in 10129 ms. Result :sat
[2022-06-09 01:21:56] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:56] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2022-06-09 01:21:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:57] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2022-06-09 01:21:57] [INFO ] [Nat]Added 317 Read/Feed constraints in 207 ms returned sat
[2022-06-09 01:21:58] [INFO ] Deduced a trap composed of 133 places in 379 ms of which 1 ms to minimize.
[2022-06-09 01:21:58] [INFO ] Deduced a trap composed of 122 places in 405 ms of which 0 ms to minimize.
[2022-06-09 01:21:59] [INFO ] Deduced a trap composed of 120 places in 482 ms of which 3 ms to minimize.
[2022-06-09 01:21:59] [INFO ] Deduced a trap composed of 130 places in 477 ms of which 0 ms to minimize.
[2022-06-09 01:22:00] [INFO ] Deduced a trap composed of 52 places in 502 ms of which 1 ms to minimize.
[2022-06-09 01:22:00] [INFO ] Deduced a trap composed of 128 places in 490 ms of which 1 ms to minimize.
[2022-06-09 01:22:01] [INFO ] Deduced a trap composed of 108 places in 490 ms of which 1 ms to minimize.
[2022-06-09 01:22:01] [INFO ] Deduced a trap composed of 124 places in 400 ms of which 0 ms to minimize.
[2022-06-09 01:22:02] [INFO ] Deduced a trap composed of 103 places in 402 ms of which 0 ms to minimize.
[2022-06-09 01:22:02] [INFO ] Deduced a trap composed of 53 places in 401 ms of which 0 ms to minimize.
[2022-06-09 01:22:03] [INFO ] Deduced a trap composed of 58 places in 398 ms of which 1 ms to minimize.
[2022-06-09 01:22:03] [INFO ] Deduced a trap composed of 126 places in 405 ms of which 0 ms to minimize.
[2022-06-09 01:22:04] [INFO ] Deduced a trap composed of 126 places in 506 ms of which 0 ms to minimize.
[2022-06-09 01:22:05] [INFO ] Deduced a trap composed of 57 places in 397 ms of which 0 ms to minimize.
[2022-06-09 01:22:05] [INFO ] Deduced a trap composed of 58 places in 395 ms of which 1 ms to minimize.
[2022-06-09 01:22:06] [INFO ] Deduced a trap composed of 59 places in 390 ms of which 0 ms to minimize.
[2022-06-09 01:22:06] [INFO ] Deduced a trap composed of 59 places in 397 ms of which 1 ms to minimize.
[2022-06-09 01:22:07] [INFO ] Deduced a trap composed of 56 places in 418 ms of which 0 ms to minimize.
[2022-06-09 01:22:07] [INFO ] Deduced a trap composed of 58 places in 399 ms of which 0 ms to minimize.
[2022-06-09 01:22:08] [INFO ] Deduced a trap composed of 59 places in 409 ms of which 1 ms to minimize.
[2022-06-09 01:22:08] [INFO ] Deduced a trap composed of 58 places in 456 ms of which 1 ms to minimize.
[2022-06-09 01:22:09] [INFO ] Deduced a trap composed of 64 places in 470 ms of which 0 ms to minimize.
[2022-06-09 01:22:09] [INFO ] Deduced a trap composed of 122 places in 481 ms of which 0 ms to minimize.
[2022-06-09 01:22:10] [INFO ] Deduced a trap composed of 122 places in 478 ms of which 0 ms to minimize.
[2022-06-09 01:22:10] [INFO ] Deduced a trap composed of 84 places in 473 ms of which 1 ms to minimize.
[2022-06-09 01:22:11] [INFO ] Deduced a trap composed of 124 places in 487 ms of which 0 ms to minimize.
[2022-06-09 01:22:12] [INFO ] Deduced a trap composed of 58 places in 474 ms of which 0 ms to minimize.
[2022-06-09 01:22:12] [INFO ] Deduced a trap composed of 59 places in 480 ms of which 0 ms to minimize.
[2022-06-09 01:22:13] [INFO ] Deduced a trap composed of 122 places in 480 ms of which 1 ms to minimize.
[2022-06-09 01:22:13] [INFO ] Deduced a trap composed of 126 places in 477 ms of which 1 ms to minimize.
[2022-06-09 01:22:14] [INFO ] Deduced a trap composed of 93 places in 476 ms of which 1 ms to minimize.
[2022-06-09 01:22:14] [INFO ] Deduced a trap composed of 124 places in 468 ms of which 0 ms to minimize.
[2022-06-09 01:22:15] [INFO ] Deduced a trap composed of 90 places in 466 ms of which 0 ms to minimize.
[2022-06-09 01:22:16] [INFO ] Deduced a trap composed of 122 places in 575 ms of which 0 ms to minimize.
[2022-06-09 01:22:16] [INFO ] Deduced a trap composed of 125 places in 476 ms of which 0 ms to minimize.
[2022-06-09 01:22:17] [INFO ] Deduced a trap composed of 122 places in 474 ms of which 1 ms to minimize.
[2022-06-09 01:22:17] [INFO ] Deduced a trap composed of 123 places in 473 ms of which 1 ms to minimize.
[2022-06-09 01:22:18] [INFO ] Deduced a trap composed of 124 places in 478 ms of which 0 ms to minimize.
[2022-06-09 01:22:18] [INFO ] Deduced a trap composed of 128 places in 482 ms of which 0 ms to minimize.
[2022-06-09 01:22:19] [INFO ] Deduced a trap composed of 41 places in 483 ms of which 0 ms to minimize.
[2022-06-09 01:22:20] [INFO ] Deduced a trap composed of 10 places in 476 ms of which 0 ms to minimize.
[2022-06-09 01:22:20] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2022-06-09 01:22:20] [INFO ] Deduced a trap composed of 125 places in 482 ms of which 0 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 130 places in 483 ms of which 0 ms to minimize.
[2022-06-09 01:22:22] [INFO ] Deduced a trap composed of 121 places in 478 ms of which 0 ms to minimize.
[2022-06-09 01:22:22] [INFO ] Deduced a trap composed of 128 places in 486 ms of which 0 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 121 places in 477 ms of which 0 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 122 places in 464 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 128 places in 489 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 121 places in 471 ms of which 1 ms to minimize.
[2022-06-09 01:22:25] [INFO ] Deduced a trap composed of 125 places in 489 ms of which 1 ms to minimize.
[2022-06-09 01:22:26] [INFO ] Deduced a trap composed of 125 places in 480 ms of which 1 ms to minimize.
[2022-06-09 01:22:26] [INFO ] Deduced a trap composed of 125 places in 481 ms of which 1 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 124 places in 470 ms of which 0 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 125 places in 471 ms of which 0 ms to minimize.
[2022-06-09 01:22:28] [INFO ] Deduced a trap composed of 123 places in 531 ms of which 1 ms to minimize.
[2022-06-09 01:22:29] [INFO ] Deduced a trap composed of 122 places in 484 ms of which 0 ms to minimize.
[2022-06-09 01:22:29] [INFO ] Deduced a trap composed of 122 places in 475 ms of which 1 ms to minimize.
[2022-06-09 01:22:30] [INFO ] Deduced a trap composed of 124 places in 477 ms of which 1 ms to minimize.
[2022-06-09 01:22:30] [INFO ] Deduced a trap composed of 119 places in 457 ms of which 0 ms to minimize.
[2022-06-09 01:22:31] [INFO ] Deduced a trap composed of 121 places in 467 ms of which 0 ms to minimize.
[2022-06-09 01:22:31] [INFO ] Deduced a trap composed of 120 places in 460 ms of which 1 ms to minimize.
[2022-06-09 01:22:32] [INFO ] Deduced a trap composed of 125 places in 470 ms of which 0 ms to minimize.
[2022-06-09 01:22:33] [INFO ] Deduced a trap composed of 119 places in 450 ms of which 1 ms to minimize.
[2022-06-09 01:22:33] [INFO ] Deduced a trap composed of 123 places in 454 ms of which 0 ms to minimize.
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 119 places in 491 ms of which 1 ms to minimize.
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 125 places in 410 ms of which 1 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 120 places in 410 ms of which 1 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 124 places in 388 ms of which 0 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 120 places in 426 ms of which 1 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 123 places in 483 ms of which 0 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 120 places in 436 ms of which 0 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 116 places in 427 ms of which 0 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 119 places in 446 ms of which 0 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 120 places in 428 ms of which 1 ms to minimize.
[2022-06-09 01:22:39] [INFO ] Deduced a trap composed of 119 places in 423 ms of which 0 ms to minimize.
[2022-06-09 01:22:40] [INFO ] Deduced a trap composed of 127 places in 421 ms of which 1 ms to minimize.
[2022-06-09 01:22:40] [INFO ] Deduced a trap composed of 119 places in 500 ms of which 0 ms to minimize.
[2022-06-09 01:22:41] [INFO ] Deduced a trap composed of 120 places in 430 ms of which 0 ms to minimize.
[2022-06-09 01:22:41] [INFO ] Deduced a trap composed of 119 places in 446 ms of which 1 ms to minimize.
[2022-06-09 01:22:42] [INFO ] Deduced a trap composed of 123 places in 451 ms of which 0 ms to minimize.
[2022-06-09 01:22:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Incomplete Parikh walk after 1147500 steps, including 1000 resets, run finished after 9489 ms. (steps per millisecond=120 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1236200 steps, including 1000 resets, run finished after 9604 ms. (steps per millisecond=128 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1116900 steps, including 1000 resets, run finished after 8552 ms. (steps per millisecond=130 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 18 out of 271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 271/271 places, 3901/3901 transitions.
Applied a total of 0 rules in 65 ms. Remains 271 /271 variables (removed 0) and now considering 3901/3901 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 3901/3901 transitions.
Starting structural reductions, iteration 0 : 271/271 places, 3901/3901 transitions.
Applied a total of 0 rules in 59 ms. Remains 271 /271 variables (removed 0) and now considering 3901/3901 (removed 0) transitions.
[2022-06-09 01:23:10] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
// Phase 1: matrix 3721 rows 271 cols
[2022-06-09 01:23:10] [INFO ] Computed 9 place invariants in 20 ms
[2022-06-09 01:23:10] [INFO ] Implicit Places using invariants in 530 ms returned []
[2022-06-09 01:23:10] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
// Phase 1: matrix 3721 rows 271 cols
[2022-06-09 01:23:10] [INFO ] Computed 9 place invariants in 25 ms
[2022-06-09 01:23:11] [INFO ] State equation strengthened by 317 read => feed constraints.
[2022-06-09 01:23:18] [INFO ] Implicit Places using invariants and state equation in 7488 ms returned []
Implicit Place search using SMT with State Equation took 8027 ms to find 0 implicit places.
[2022-06-09 01:23:18] [INFO ] Redundant transitions in 308 ms returned []
[2022-06-09 01:23:18] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
// Phase 1: matrix 3721 rows 271 cols
[2022-06-09 01:23:18] [INFO ] Computed 9 place invariants in 20 ms
[2022-06-09 01:23:19] [INFO ] Dead Transitions using invariants and state equation in 1097 ms returned []
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 3901/3901 transitions.
Incomplete random walk after 100002 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=194 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-09 01:23:19] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
// Phase 1: matrix 3721 rows 271 cols
[2022-06-09 01:23:20] [INFO ] Computed 9 place invariants in 17 ms
[2022-06-09 01:23:20] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:20] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-06-09 01:23:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:21] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2022-06-09 01:23:21] [INFO ] State equation strengthened by 317 read => feed constraints.
[2022-06-09 01:23:21] [INFO ] [Nat]Added 317 Read/Feed constraints in 231 ms returned sat
[2022-06-09 01:23:21] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 509 ms
[2022-06-09 01:23:22] [INFO ] Computed and/alt/rep : 461/1753/461 causal constraints (skipped 3259 transitions) in 309 ms.
[2022-06-09 01:23:26] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-06-09 01:23:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2022-06-09 01:23:26] [INFO ] Added : 135 causal constraints over 27 iterations in 4902 ms. Result :sat
[2022-06-09 01:23:26] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:27] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2022-06-09 01:23:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:27] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-06-09 01:23:28] [INFO ] [Nat]Added 317 Read/Feed constraints in 208 ms returned sat
[2022-06-09 01:23:28] [INFO ] Deduced a trap composed of 61 places in 368 ms of which 1 ms to minimize.
[2022-06-09 01:23:29] [INFO ] Deduced a trap composed of 57 places in 364 ms of which 0 ms to minimize.
[2022-06-09 01:23:29] [INFO ] Deduced a trap composed of 39 places in 359 ms of which 0 ms to minimize.
[2022-06-09 01:23:29] [INFO ] Deduced a trap composed of 38 places in 358 ms of which 1 ms to minimize.
[2022-06-09 01:23:30] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:23:30] [INFO ] Deduced a trap composed of 78 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:23:31] [INFO ] Deduced a trap composed of 40 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:23:31] [INFO ] Deduced a trap composed of 41 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:23:32] [INFO ] Deduced a trap composed of 23 places in 371 ms of which 0 ms to minimize.
[2022-06-09 01:23:32] [INFO ] Deduced a trap composed of 56 places in 381 ms of which 0 ms to minimize.
[2022-06-09 01:23:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4604 ms
[2022-06-09 01:23:32] [INFO ] Computed and/alt/rep : 461/1753/461 causal constraints (skipped 3259 transitions) in 242 ms.
[2022-06-09 01:23:36] [INFO ] Deduced a trap composed of 58 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:23:37] [INFO ] Deduced a trap composed of 58 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:23:37] [INFO ] Deduced a trap composed of 58 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:23:38] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:23:38] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 1 ms to minimize.
[2022-06-09 01:23:39] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 1 ms to minimize.
[2022-06-09 01:23:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2975 ms
[2022-06-09 01:23:39] [INFO ] Added : 112 causal constraints over 23 iterations in 6935 ms. Result :sat
[2022-06-09 01:23:39] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:40] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-06-09 01:23:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:40] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2022-06-09 01:23:40] [INFO ] [Nat]Added 317 Read/Feed constraints in 214 ms returned sat
[2022-06-09 01:23:41] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 0 ms to minimize.
[2022-06-09 01:23:41] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2022-06-09 01:23:41] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 1 ms to minimize.
[2022-06-09 01:23:42] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2022-06-09 01:23:42] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 1 ms to minimize.
[2022-06-09 01:23:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1542 ms
[2022-06-09 01:23:42] [INFO ] Computed and/alt/rep : 461/1753/461 causal constraints (skipped 3259 transitions) in 213 ms.
[2022-06-09 01:23:46] [INFO ] Deduced a trap composed of 65 places in 387 ms of which 1 ms to minimize.
[2022-06-09 01:23:47] [INFO ] Deduced a trap composed of 97 places in 378 ms of which 0 ms to minimize.
[2022-06-09 01:23:47] [INFO ] Deduced a trap composed of 97 places in 376 ms of which 1 ms to minimize.
[2022-06-09 01:23:48] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 0 ms to minimize.
[2022-06-09 01:23:48] [INFO ] Deduced a trap composed of 43 places in 383 ms of which 1 ms to minimize.
[2022-06-09 01:23:49] [INFO ] Deduced a trap composed of 70 places in 400 ms of which 1 ms to minimize.
[2022-06-09 01:23:49] [INFO ] Deduced a trap composed of 59 places in 263 ms of which 0 ms to minimize.
[2022-06-09 01:23:49] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 1 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 0 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
[2022-06-09 01:23:51] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2022-06-09 01:23:51] [INFO ] Deduced a trap composed of 64 places in 357 ms of which 1 ms to minimize.
[2022-06-09 01:23:52] [INFO ] Deduced a trap composed of 65 places in 356 ms of which 0 ms to minimize.
[2022-06-09 01:23:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6130 ms
[2022-06-09 01:23:52] [INFO ] Added : 108 causal constraints over 23 iterations in 10143 ms. Result :sat
[2022-06-09 01:23:52] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:53] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2022-06-09 01:23:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:53] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2022-06-09 01:23:54] [INFO ] [Nat]Added 317 Read/Feed constraints in 210 ms returned sat
[2022-06-09 01:23:54] [INFO ] Deduced a trap composed of 133 places in 466 ms of which 1 ms to minimize.
[2022-06-09 01:23:55] [INFO ] Deduced a trap composed of 122 places in 426 ms of which 0 ms to minimize.
[2022-06-09 01:23:55] [INFO ] Deduced a trap composed of 120 places in 436 ms of which 0 ms to minimize.
[2022-06-09 01:23:56] [INFO ] Deduced a trap composed of 130 places in 429 ms of which 1 ms to minimize.
[2022-06-09 01:23:56] [INFO ] Deduced a trap composed of 52 places in 465 ms of which 0 ms to minimize.
[2022-06-09 01:23:57] [INFO ] Deduced a trap composed of 128 places in 472 ms of which 1 ms to minimize.
[2022-06-09 01:23:57] [INFO ] Deduced a trap composed of 108 places in 463 ms of which 0 ms to minimize.
[2022-06-09 01:23:58] [INFO ] Deduced a trap composed of 124 places in 461 ms of which 1 ms to minimize.
[2022-06-09 01:23:58] [INFO ] Deduced a trap composed of 103 places in 466 ms of which 0 ms to minimize.
[2022-06-09 01:23:59] [INFO ] Deduced a trap composed of 53 places in 462 ms of which 0 ms to minimize.
[2022-06-09 01:24:00] [INFO ] Deduced a trap composed of 58 places in 455 ms of which 0 ms to minimize.
[2022-06-09 01:24:00] [INFO ] Deduced a trap composed of 126 places in 465 ms of which 1 ms to minimize.
[2022-06-09 01:24:01] [INFO ] Deduced a trap composed of 126 places in 469 ms of which 0 ms to minimize.
[2022-06-09 01:24:01] [INFO ] Deduced a trap composed of 57 places in 500 ms of which 1 ms to minimize.
[2022-06-09 01:24:02] [INFO ] Deduced a trap composed of 58 places in 461 ms of which 2 ms to minimize.
[2022-06-09 01:24:02] [INFO ] Deduced a trap composed of 59 places in 471 ms of which 0 ms to minimize.
[2022-06-09 01:24:03] [INFO ] Deduced a trap composed of 59 places in 399 ms of which 0 ms to minimize.
[2022-06-09 01:24:03] [INFO ] Deduced a trap composed of 56 places in 391 ms of which 0 ms to minimize.
[2022-06-09 01:24:04] [INFO ] Deduced a trap composed of 58 places in 464 ms of which 1 ms to minimize.
[2022-06-09 01:24:04] [INFO ] Deduced a trap composed of 59 places in 403 ms of which 0 ms to minimize.
[2022-06-09 01:24:05] [INFO ] Deduced a trap composed of 58 places in 429 ms of which 0 ms to minimize.
[2022-06-09 01:24:05] [INFO ] Deduced a trap composed of 64 places in 441 ms of which 0 ms to minimize.
[2022-06-09 01:24:06] [INFO ] Deduced a trap composed of 122 places in 428 ms of which 1 ms to minimize.
[2022-06-09 01:24:07] [INFO ] Deduced a trap composed of 122 places in 422 ms of which 0 ms to minimize.
[2022-06-09 01:24:07] [INFO ] Deduced a trap composed of 84 places in 412 ms of which 0 ms to minimize.
[2022-06-09 01:24:08] [INFO ] Deduced a trap composed of 124 places in 472 ms of which 1 ms to minimize.
[2022-06-09 01:24:08] [INFO ] Deduced a trap composed of 58 places in 483 ms of which 0 ms to minimize.
[2022-06-09 01:24:09] [INFO ] Deduced a trap composed of 59 places in 458 ms of which 0 ms to minimize.
[2022-06-09 01:24:09] [INFO ] Deduced a trap composed of 122 places in 491 ms of which 1 ms to minimize.
[2022-06-09 01:24:10] [INFO ] Deduced a trap composed of 126 places in 455 ms of which 1 ms to minimize.
[2022-06-09 01:24:10] [INFO ] Deduced a trap composed of 93 places in 458 ms of which 1 ms to minimize.
[2022-06-09 01:24:11] [INFO ] Deduced a trap composed of 124 places in 460 ms of which 0 ms to minimize.
[2022-06-09 01:24:12] [INFO ] Deduced a trap composed of 90 places in 450 ms of which 1 ms to minimize.
[2022-06-09 01:24:12] [INFO ] Deduced a trap composed of 122 places in 449 ms of which 0 ms to minimize.
[2022-06-09 01:24:13] [INFO ] Deduced a trap composed of 125 places in 459 ms of which 0 ms to minimize.
[2022-06-09 01:24:13] [INFO ] Deduced a trap composed of 122 places in 455 ms of which 0 ms to minimize.
[2022-06-09 01:24:13] [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:24:13] [INFO ] Flatten gal took : 197 ms
[2022-06-09 01:24:14] [INFO ] Flatten gal took : 169 ms
[2022-06-09 01:24:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality613778067293940309.gal : 21 ms
[2022-06-09 01:24:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1507317430274302357.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/ReachabilityCardinality613778067293940309.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1507317430274302357.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/ReachabilityCardinality613778067293940309.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1507317430274302357.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1507317430274302357.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 260
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :260 after 845
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :845 after 2006
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2006 after 4319
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4319 after 8936
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8936 after 18161
Detected timeout of ITS tools.
[2022-06-09 01:24:29] [INFO ] Flatten gal took : 174 ms
[2022-06-09 01:24:29] [INFO ] Applying decomposition
[2022-06-09 01:24:29] [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/graph10661832878393811746.txt, -o, /tmp/graph10661832878393811746.bin, -w, /tmp/graph10661832878393811746.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/graph10661832878393811746.bin, -l, -1, -v, -w, /tmp/graph10661832878393811746.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:24:29] [INFO ] Decomposing Gal with order
[2022-06-09 01:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:24:30] [INFO ] Removed a total of 218 redundant transitions.
[2022-06-09 01:24:30] [INFO ] Flatten gal took : 314 ms
[2022-06-09 01:24:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 26 ms.
[2022-06-09 01:24:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3332006499611087266.gal : 110 ms
[2022-06-09 01:24:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12574100365282817143.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/ReachabilityCardinality3332006499611087266.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12574100365282817143.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/ReachabilityCardinality3332006499611087266.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12574100365282817143.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12574100365282817143.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 188
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :188 after 773
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :773 after 1934
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1934 after 4247
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4247 after 8864
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8864 after 18089
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13392586363400102500
[2022-06-09 01:24:45] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13392586363400102500
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/ltsmin13392586363400102500]
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/ltsmin13392586363400102500] 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/ltsmin13392586363400102500] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 271 transition count 3721
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 185 place count 271 transition count 3716
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 190 place count 266 transition count 3716
Applied a total of 190 rules in 129 ms. Remains 266 /271 variables (removed 5) and now considering 3716/3901 (removed 185) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3716 rows 266 cols
[2022-06-09 01:24:46] [INFO ] Computed 9 place invariants in 14 ms
[2022-06-09 01:24:46] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:47] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2022-06-09 01:24:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:24:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:47] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2022-06-09 01:24:48] [INFO ] Computed and/alt/rep : 580/1906/580 causal constraints (skipped 3135 transitions) in 261 ms.
[2022-06-09 01:24:48] [INFO ] Added : 2 causal constraints over 1 iterations in 548 ms. Result :sat
[2022-06-09 01:24:48] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:49] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-06-09 01:24:49] [INFO ] Computed and/alt/rep : 580/1906/580 causal constraints (skipped 3135 transitions) in 264 ms.
[2022-06-09 01:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:24:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:50] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2022-06-09 01:24:50] [INFO ] Computed and/alt/rep : 580/1906/580 causal constraints (skipped 3135 transitions) in 269 ms.
[2022-06-09 01:24:51] [INFO ] Added : 7 causal constraints over 3 iterations in 770 ms. Result :sat
[2022-06-09 01:24:51] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:51] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-06-09 01:24:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:24:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:52] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2022-06-09 01:24:52] [INFO ] Computed and/alt/rep : 580/1906/580 causal constraints (skipped 3135 transitions) in 257 ms.
[2022-06-09 01:24:52] [INFO ] Added : 3 causal constraints over 1 iterations in 547 ms. Result :sat
[2022-06-09 01:24:53] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 01:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:53] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-06-09 01:24:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:24:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 01:24:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:54] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-06-09 01:24:54] [INFO ] Computed and/alt/rep : 580/1906/580 causal constraints (skipped 3135 transitions) in 289 ms.
[2022-06-09 01:24:54] [INFO ] Added : 2 causal constraints over 1 iterations in 616 ms. Result :sat
[2022-06-09 01:24:55] [INFO ] Flatten gal took : 182 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3463082823787872229
[2022-06-09 01:24:55] [INFO ] Too many transitions (3901) to apply POR reductions. Disabling POR matrices.
[2022-06-09 01:24:55] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3463082823787872229
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/ltsmin3463082823787872229]
[2022-06-09 01:24:55] [INFO ] Applying decomposition
[2022-06-09 01:24:55] [INFO ] Flatten gal took : 365 ms
[2022-06-09 01:24:55] [INFO ] Flatten gal took : 200 ms
[2022-06-09 01:24:55] [INFO ] Input system was already deterministic with 3901 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7119597327977431602.txt, -o, /tmp/graph7119597327977431602.bin, -w, /tmp/graph7119597327977431602.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/graph7119597327977431602.bin, -l, -1, -v, -w, /tmp/graph7119597327977431602.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:24:56] [INFO ] Decomposing Gal with order
[2022-06-09 01:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:24:56] [INFO ] Removed a total of 218 redundant transitions.
[2022-06-09 01:24:57] [INFO ] Flatten gal took : 320 ms
[2022-06-09 01:24:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 9 ms.
[2022-06-09 01:24:57] [INFO ] Ran tautology test, simplified 0 / 4 in 1672 ms.
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(UNSAT) depth K=0 took 15 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(UNSAT) depth K=0 took 9 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(UNSAT) depth K=0 took 3 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(UNSAT) depth K=0 took 2 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(UNSAT) depth K=1 took 17 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(UNSAT) depth K=1 took 3 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(UNSAT) depth K=1 took 10 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(UNSAT) depth K=1 took 3 ms
[2022-06-09 01:24:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3057765451989367348.gal : 39 ms
[2022-06-09 01:24:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1484982657849914559.prop : 78 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/ReachabilityCardinality3057765451989367348.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1484982657849914559.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/ReachabilityCardinality3057765451989367348.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1484982657849914559.prop --nowitness --gen-order FOLLOW
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(UNSAT) depth K=2 took 191 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(UNSAT) depth K=2 took 4 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(UNSAT) depth K=2 took 15 ms
[2022-06-09 01:24:57] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(UNSAT) depth K=2 took 3 ms
[2022-06-09 01:24:58] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(UNSAT) depth K=3 took 317 ms
[2022-06-09 01:24:58] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(UNSAT) depth K=3 took 84 ms
[2022-06-09 01:24:58] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(UNSAT) depth K=3 took 105 ms
[2022-06-09 01:24:58] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(UNSAT) depth K=3 took 139 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 3721 out of 3901 initially.
// Phase 1: matrix 3721 rows 271 cols
[2022-06-09 01:24:58] [INFO ] Computed 9 place invariants in 64 ms
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
inv : l19 + l20 + l23 + l24 = 1
inv : l0 + l3 + l33 + l4 = 8
inv : l25 + l26 + l27 + l28 + l30 + l31 + l32 = 1
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 : 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
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 : l5 + l6 + l9 = 1
Total of 9 invariants.
[2022-06-09 01:24:58] [INFO ] Computed 9 place invariants in 66 ms
Loading property file /tmp/ReachabilityCardinality1484982657849914559.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 188
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :188 after 773
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :773 after 1934
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1934 after 4247
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4247 after 8864
[2022-06-09 01:25:02] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(UNSAT) depth K=4 took 4436 ms
[2022-06-09 01:25:03] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(UNSAT) depth K=4 took 861 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8864 after 18089
[2022-06-09 01:25:04] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(UNSAT) depth K=4 took 890 ms
[2022-06-09 01:25:05] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(UNSAT) depth K=4 took 459 ms
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :18089 after 36530
[2022-06-09 01:25:39] [INFO ] Proved 271 variables to be positive in 40516 ms
[2022-06-09 01:25:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m008-ReachabilityCardinality-06
[2022-06-09 01:25:39] [INFO ] KInduction solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(SAT) depth K=0 took 13 ms
[2022-06-09 01:25:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m008-ReachabilityCardinality-09
[2022-06-09 01:25:39] [INFO ] KInduction solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(SAT) depth K=0 took 11 ms
[2022-06-09 01:25:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m008-ReachabilityCardinality-13
[2022-06-09 01:25:39] [INFO ] KInduction solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(SAT) depth K=0 took 15 ms
[2022-06-09 01:25:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m008-ReachabilityCardinality-14
[2022-06-09 01:25:39] [INFO ] KInduction solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(SAT) depth K=0 took 18 ms
[2022-06-09 01:25:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m008-ReachabilityCardinality-06
[2022-06-09 01:25:46] [INFO ] KInduction solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(SAT) depth K=1 took 7176 ms
[2022-06-09 01:25:46] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(UNSAT) depth K=5 took 41517 ms
[2022-06-09 01:25:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m008-ReachabilityCardinality-09
[2022-06-09 01:25:58] [INFO ] KInduction solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(SAT) depth K=1 took 11435 ms
Compilation finished in 67745 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3463082823787872229]
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, BugTrackingPTq8m008ReachabilityCardinality06==true], workingDir=/tmp/ltsmin3463082823787872229]
[2022-06-09 01:26:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m008-ReachabilityCardinality-13
[2022-06-09 01:26:15] [INFO ] KInduction solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(SAT) depth K=1 took 17209 ms
[2022-06-09 01:26:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m008-ReachabilityCardinality-14
[2022-06-09 01:26:47] [INFO ] KInduction solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(SAT) depth K=1 took 32403 ms
[2022-06-09 01:27:58] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(UNSAT) depth K=5 took 131484 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :36530 after 73403
[2022-06-09 01:28:37] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(UNSAT) depth K=5 took 38686 ms
[2022-06-09 01:29:18] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(UNSAT) depth K=5 took 41297 ms
[2022-06-09 01:32:11] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(UNSAT) depth K=6 took 173477 ms
WARNING : LTSmin timed out (>900 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, BugTrackingPTq8m008ReachabilityCardinality06==true], workingDir=/tmp/ltsmin3463082823787872229]
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, BugTrackingPTq8m008ReachabilityCardinality09==true], workingDir=/tmp/ltsmin3463082823787872229]
[2022-06-09 01:41:16] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(UNSAT) depth K=6 took 544501 ms
[2022-06-09 01:45:26] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-13(UNSAT) depth K=6 took 249704 ms
Detected timeout of ITS tools.
[2022-06-09 01:46:55] [INFO ] Applying decomposition
[2022-06-09 01:46:55] [INFO ] Flatten gal took : 541 ms
[2022-06-09 01:46:56] [INFO ] Decomposing Gal with order
[2022-06-09 01:46:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:46:56] [INFO ] Removed a total of 218 redundant transitions.
[2022-06-09 01:46:57] [INFO ] Flatten gal took : 903 ms
[2022-06-09 01:46:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 31 ms.
[2022-06-09 01:46:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5819839559071332803.gal : 57 ms
[2022-06-09 01:46:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16390893196403676868.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5819839559071332803.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16390893196403676868.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/ReachabilityCardinality5819839559071332803.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16390893196403676868.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16390893196403676868.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 188
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :188 after 773
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :773 after 1934
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1934 after 4247
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4247 after 8864
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8864 after 18089
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :18089 after 36530
[2022-06-09 01:48:30] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-14(UNSAT) depth K=6 took 184135 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :36530 after 73403
[2022-06-09 01:54:37] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-06(UNSAT) depth K=7 took 366861 ms
WARNING : LTSmin timed out (>900 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, BugTrackingPTq8m008ReachabilityCardinality09==true], workingDir=/tmp/ltsmin3463082823787872229]
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, BugTrackingPTq8m008ReachabilityCardinality13==true], workingDir=/tmp/ltsmin3463082823787872229]
Detected timeout of ITS tools.
[2022-06-09 02:08:55] [INFO ] Flatten gal took : 546 ms
[2022-06-09 02:08:56] [INFO ] Input system was already deterministic with 3901 transitions.
[2022-06-09 02:08:56] [INFO ] Transformed 271 places.
[2022-06-09 02:08:56] [INFO ] Transformed 3901 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:08:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7509653205928524126.gal : 23 ms
[2022-06-09 02:08:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15313029985180426228.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7509653205928524126.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15313029985180426228.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/ReachabilityCardinality7509653205928524126.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15313029985180426228.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/ReachabilityCardinality15313029985180426228.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :21 after 26
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :26 after 40
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40 after 328
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :328 after 462
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :462 after 859
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :859 after 6413
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :6413 after 11178
WARNING : LTSmin timed out (>900 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, BugTrackingPTq8m008ReachabilityCardinality13==true], workingDir=/tmp/ltsmin3463082823787872229]
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, BugTrackingPTq8m008ReachabilityCardinality14==true], workingDir=/tmp/ltsmin3463082823787872229]
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :11178 after 83442
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :83442 after 1.87706e+06
[2022-06-09 02:13:39] [INFO ] BMC solution for property BugTracking-PT-q8m008-ReachabilityCardinality-09(UNSAT) depth K=7 took 1142584 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-q8m008"
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-q8m008, 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-165472292600032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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