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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 7 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K 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.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 17:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Jun 7 17:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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-q8m032-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654741193006

Running Version 0
[2022-06-09 02:19:54] [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 02:19:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 02:19:55] [INFO ] Load time of PNML (sax parser for PT used): 867 ms
[2022-06-09 02:19:55] [INFO ] Transformed 754 places.
[2022-06-09 02:19:55] [INFO ] Transformed 27370 transitions.
[2022-06-09 02:19:55] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1003 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 139 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 17 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1326060 steps, run timeout after 30001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 1326060 steps, saw 714081 distinct states, run finished after 30088 ms. (steps per millisecond=44 ) properties seen :{}
Running SMT prover for 6 properties.
[2022-06-09 02:20:26] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 02:20:26] [INFO ] Computed 10 place invariants in 47 ms
[2022-06-09 02:20:26] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
[2022-06-09 02:20:26] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:26] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2022-06-09 02:20:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:27] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2022-06-09 02:20:27] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 02:20:27] [INFO ] [Nat]Added 316 Read/Feed constraints in 200 ms returned sat
[2022-06-09 02:20:28] [INFO ] Deduced a trap composed of 83 places in 476 ms of which 16 ms to minimize.
[2022-06-09 02:20:28] [INFO ] Deduced a trap composed of 74 places in 465 ms of which 1 ms to minimize.
[2022-06-09 02:20:29] [INFO ] Deduced a trap composed of 64 places in 419 ms of which 1 ms to minimize.
[2022-06-09 02:20:30] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 2 ms to minimize.
[2022-06-09 02:20:30] [INFO ] Deduced a trap composed of 19 places in 497 ms of which 1 ms to minimize.
[2022-06-09 02:20:30] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 0 ms to minimize.
[2022-06-09 02:20:31] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 0 ms to minimize.
[2022-06-09 02:20:31] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 1 ms to minimize.
[2022-06-09 02:20:31] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 0 ms to minimize.
[2022-06-09 02:20:32] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 1 ms to minimize.
[2022-06-09 02:20:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-09 02:20:32] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:32] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-09 02:20:33] [INFO ] [Real]Added 316 Read/Feed constraints in 182 ms returned sat
[2022-06-09 02:20:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:20:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:33] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2022-06-09 02:20:33] [INFO ] [Nat]Added 316 Read/Feed constraints in 186 ms returned sat
[2022-06-09 02:20:34] [INFO ] Deduced a trap composed of 26 places in 462 ms of which 1 ms to minimize.
[2022-06-09 02:20:34] [INFO ] Deduced a trap composed of 82 places in 393 ms of which 1 ms to minimize.
[2022-06-09 02:20:35] [INFO ] Deduced a trap composed of 85 places in 391 ms of which 1 ms to minimize.
[2022-06-09 02:20:35] [INFO ] Deduced a trap composed of 91 places in 406 ms of which 0 ms to minimize.
[2022-06-09 02:20:36] [INFO ] Deduced a trap composed of 94 places in 402 ms of which 0 ms to minimize.
[2022-06-09 02:20:36] [INFO ] Deduced a trap composed of 60 places in 400 ms of which 0 ms to minimize.
[2022-06-09 02:20:37] [INFO ] Deduced a trap composed of 62 places in 398 ms of which 0 ms to minimize.
[2022-06-09 02:20:37] [INFO ] Deduced a trap composed of 17 places in 451 ms of which 0 ms to minimize.
[2022-06-09 02:20:38] [INFO ] Deduced a trap composed of 94 places in 416 ms of which 0 ms to minimize.
[2022-06-09 02:20:38] [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 02:20:38] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:38] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2022-06-09 02:20:39] [INFO ] [Real]Added 316 Read/Feed constraints in 171 ms returned sat
[2022-06-09 02:20:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:39] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-06-09 02:20:40] [INFO ] [Nat]Added 316 Read/Feed constraints in 192 ms returned sat
[2022-06-09 02:20:40] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 0 ms to minimize.
[2022-06-09 02:20:40] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 0 ms to minimize.
[2022-06-09 02:20:40] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2022-06-09 02:20:41] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 0 ms to minimize.
[2022-06-09 02:20:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1200 ms
[2022-06-09 02:20:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 309 ms.
[2022-06-09 02:20:44] [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 02:20:44] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:44] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-09 02:20:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:45] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2022-06-09 02:20:45] [INFO ] [Nat]Added 316 Read/Feed constraints in 198 ms returned sat
[2022-06-09 02:20:46] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 0 ms to minimize.
[2022-06-09 02:20:46] [INFO ] Deduced a trap composed of 93 places in 373 ms of which 1 ms to minimize.
[2022-06-09 02:20:47] [INFO ] Deduced a trap composed of 64 places in 381 ms of which 0 ms to minimize.
[2022-06-09 02:20:47] [INFO ] Deduced a trap composed of 62 places in 384 ms of which 1 ms to minimize.
[2022-06-09 02:20:48] [INFO ] Deduced a trap composed of 95 places in 380 ms of which 1 ms to minimize.
[2022-06-09 02:20:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2480 ms
[2022-06-09 02:20:48] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 413 ms.
[2022-06-09 02:20:50] [INFO ] Added : 50 causal constraints over 10 iterations in 1830 ms. Result :unknown
[2022-06-09 02:20:50] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 1563400 steps, including 1003 resets, run finished after 7366 ms. (steps per millisecond=212 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 13 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 348 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
[2022-06-09 02:20:58] [INFO ] Flatten gal took : 398 ms
[2022-06-09 02:20:58] [INFO ] Flatten gal took : 201 ms
[2022-06-09 02:20:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8205603927212946318.gal : 59 ms
[2022-06-09 02:20:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3737819170256519003.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/ReachabilityCardinality8205603927212946318.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3737819170256519003.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/ReachabilityCardinality8205603927212946318.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3737819170256519003.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3737819170256519003.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 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 461
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :461 after 2606
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2606 after 6863
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6863 after 15344
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :15344 after 32273
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :32273 after 66098
Detected timeout of ITS tools.
[2022-06-09 02:21:13] [INFO ] Flatten gal took : 176 ms
[2022-06-09 02:21:13] [INFO ] Applying decomposition
[2022-06-09 02:21:14] [INFO ] Flatten gal took : 172 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/graph13679584413383803694.txt, -o, /tmp/graph13679584413383803694.bin, -w, /tmp/graph13679584413383803694.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/graph13679584413383803694.bin, -l, -1, -v, -w, /tmp/graph13679584413383803694.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 02:21:14] [INFO ] Decomposing Gal with order
[2022-06-09 02:21:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 02:21:15] [INFO ] Removed a total of 385 redundant transitions.
[2022-06-09 02:21:15] [INFO ] Flatten gal took : 442 ms
[2022-06-09 02:21:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 32 ms.
[2022-06-09 02:21:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16144585956890319763.gal : 20 ms
[2022-06-09 02:21:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17045602852838532173.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/ReachabilityCardinality16144585956890319763.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17045602852838532173.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/ReachabilityCardinality16144585956890319763.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17045602852838532173.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17045602852838532173.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 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 66
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :66 after 2012
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2012 after 6269
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6269 after 14750
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14750 after 31679
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31679 after 65504
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13861295727511517241
[2022-06-09 02:21:30] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13861295727511517241
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/ltsmin13861295727511517241]
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/ltsmin13861295727511517241] 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/ltsmin13861295727511517241] 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 1000014 steps, including 2 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1921 ms. (steps per millisecond=520 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1958 ms. (steps per millisecond=510 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1984 ms. (steps per millisecond=504 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2061 ms. (steps per millisecond=485 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1280930 steps, run timeout after 30001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 1280930 steps, saw 734362 distinct states, run finished after 30001 ms. (steps per millisecond=42 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-09 02:22:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:22:11] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 02:22:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:11] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-06-09 02:22:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:22:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 45 ms returned sat
[2022-06-09 02:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:12] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2022-06-09 02:22:12] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:22:12] [INFO ] [Nat]Added 296 Read/Feed constraints in 200 ms returned sat
[2022-06-09 02:22:13] [INFO ] Deduced a trap composed of 28 places in 651 ms of which 1 ms to minimize.
[2022-06-09 02:22:13] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 1 ms to minimize.
[2022-06-09 02:22:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1255 ms
[2022-06-09 02:22:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 535 ms.
[2022-06-09 02:22:18] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:22:18] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2022-06-09 02:22:18] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 0 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 2 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 0 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3131 ms
[2022-06-09 02:22:21] [INFO ] Added : 107 causal constraints over 23 iterations in 7420 ms. Result :sat
[2022-06-09 02:22:21] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-09 02:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:21] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2022-06-09 02:22:22] [INFO ] [Real]Added 296 Read/Feed constraints in 206 ms returned sat
[2022-06-09 02:22:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:22:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:22] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-09 02:22:23] [INFO ] [Nat]Added 296 Read/Feed constraints in 189 ms returned sat
[2022-06-09 02:22:23] [INFO ] Deduced a trap composed of 70 places in 353 ms of which 1 ms to minimize.
[2022-06-09 02:22:23] [INFO ] Deduced a trap composed of 86 places in 365 ms of which 8 ms to minimize.
[2022-06-09 02:22:24] [INFO ] Deduced a trap composed of 86 places in 453 ms of which 0 ms to minimize.
[2022-06-09 02:22:24] [INFO ] Deduced a trap composed of 70 places in 368 ms of which 7 ms to minimize.
[2022-06-09 02:22:25] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 1 ms to minimize.
[2022-06-09 02:22:25] [INFO ] Deduced a trap composed of 85 places in 367 ms of which 1 ms to minimize.
[2022-06-09 02:22:26] [INFO ] Deduced a trap composed of 87 places in 365 ms of which 0 ms to minimize.
[2022-06-09 02:22:26] [INFO ] Deduced a trap composed of 89 places in 352 ms of which 0 ms to minimize.
[2022-06-09 02:22:27] [INFO ] Deduced a trap composed of 86 places in 366 ms of which 0 ms to minimize.
[2022-06-09 02:22:27] [INFO ] Deduced a trap composed of 87 places in 351 ms of which 0 ms to minimize.
[2022-06-09 02:22:28] [INFO ] Deduced a trap composed of 87 places in 358 ms of which 1 ms to minimize.
[2022-06-09 02:22:28] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 0 ms to minimize.
[2022-06-09 02:22:28] [INFO ] Deduced a trap composed of 91 places in 333 ms of which 1 ms to minimize.
[2022-06-09 02:22:29] [INFO ] Deduced a trap composed of 94 places in 346 ms of which 0 ms to minimize.
[2022-06-09 02:22:29] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 1 ms to minimize.
[2022-06-09 02:22:30] [INFO ] Deduced a trap composed of 88 places in 323 ms of which 0 ms to minimize.
[2022-06-09 02:22:30] [INFO ] Deduced a trap composed of 97 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:22:30] [INFO ] Deduced a trap composed of 89 places in 319 ms of which 0 ms to minimize.
[2022-06-09 02:22:31] [INFO ] Deduced a trap composed of 92 places in 340 ms of which 0 ms to minimize.
[2022-06-09 02:22:31] [INFO ] Deduced a trap composed of 87 places in 320 ms of which 1 ms to minimize.
[2022-06-09 02:22:32] [INFO ] Deduced a trap composed of 88 places in 327 ms of which 1 ms to minimize.
[2022-06-09 02:22:32] [INFO ] Deduced a trap composed of 92 places in 322 ms of which 1 ms to minimize.
[2022-06-09 02:22:33] [INFO ] Deduced a trap composed of 91 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:22:33] [INFO ] Deduced a trap composed of 87 places in 317 ms of which 2 ms to minimize.
[2022-06-09 02:22:33] [INFO ] Deduced a trap composed of 92 places in 379 ms of which 1 ms to minimize.
[2022-06-09 02:22:34] [INFO ] Deduced a trap composed of 89 places in 312 ms of which 1 ms to minimize.
[2022-06-09 02:22:34] [INFO ] Deduced a trap composed of 93 places in 318 ms of which 1 ms to minimize.
[2022-06-09 02:22:35] [INFO ] Deduced a trap composed of 89 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:22:35] [INFO ] Deduced a trap composed of 91 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:22:35] [INFO ] Deduced a trap composed of 87 places in 315 ms of which 1 ms to minimize.
[2022-06-09 02:22:36] [INFO ] Deduced a trap composed of 87 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:22:36] [INFO ] Deduced a trap composed of 87 places in 311 ms of which 0 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 87 places in 308 ms of which 1 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 89 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 88 places in 317 ms of which 1 ms to minimize.
[2022-06-09 02:22:38] [INFO ] Deduced a trap composed of 88 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:22:38] [INFO ] Deduced a trap composed of 89 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:22:39] [INFO ] Deduced a trap composed of 92 places in 318 ms of which 1 ms to minimize.
[2022-06-09 02:22:39] [INFO ] Deduced a trap composed of 92 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:22:39] [INFO ] Deduced a trap composed of 92 places in 313 ms of which 0 ms to minimize.
[2022-06-09 02:22:40] [INFO ] Deduced a trap composed of 91 places in 310 ms of which 1 ms to minimize.
[2022-06-09 02:22:40] [INFO ] Deduced a trap composed of 91 places in 312 ms of which 0 ms to minimize.
[2022-06-09 02:22:41] [INFO ] Deduced a trap composed of 88 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:22:41] [INFO ] Deduced a trap composed of 83 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:22:41] [INFO ] Deduced a trap composed of 84 places in 313 ms of which 0 ms to minimize.
[2022-06-09 02:22:42] [INFO ] Deduced a trap composed of 88 places in 316 ms of which 0 ms to minimize.
[2022-06-09 02:22:42] [INFO ] Deduced a trap composed of 89 places in 308 ms of which 1 ms to minimize.
[2022-06-09 02:22:43] [INFO ] Deduced a trap composed of 88 places in 415 ms of which 1 ms to minimize.
[2022-06-09 02:22:43] [INFO ] Deduced a trap composed of 88 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:22:44] [INFO ] Deduced a trap composed of 89 places in 318 ms of which 1 ms to minimize.
[2022-06-09 02:22:44] [INFO ] Deduced a trap composed of 91 places in 301 ms of which 0 ms to minimize.
[2022-06-09 02:22:44] [INFO ] Deduced a trap composed of 90 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:22:45] [INFO ] Deduced a trap composed of 93 places in 308 ms of which 1 ms to minimize.
[2022-06-09 02:22:45] [INFO ] Deduced a trap composed of 92 places in 296 ms of which 1 ms to minimize.
[2022-06-09 02:22:46] [INFO ] Deduced a trap composed of 86 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:22:46] [INFO ] Deduced a trap composed of 89 places in 306 ms of which 1 ms to minimize.
[2022-06-09 02:22:46] [INFO ] Deduced a trap composed of 91 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:22:47] [INFO ] Deduced a trap composed of 86 places in 310 ms of which 0 ms to minimize.
[2022-06-09 02:22:47] [INFO ] Deduced a trap composed of 87 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:22:47] [INFO ] Deduced a trap composed of 89 places in 302 ms of which 1 ms to minimize.
[2022-06-09 02:22:48] [INFO ] Deduced a trap composed of 91 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:22:48] [INFO ] Deduced a trap composed of 86 places in 312 ms of which 0 ms to minimize.
[2022-06-09 02:22:49] [INFO ] Deduced a trap composed of 98 places in 320 ms of which 0 ms to minimize.
[2022-06-09 02:22:49] [INFO ] Deduced a trap composed of 88 places in 312 ms of which 0 ms to minimize.
[2022-06-09 02:22:50] [INFO ] Deduced a trap composed of 90 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:22:50] [INFO ] Deduced a trap composed of 82 places in 300 ms of which 0 ms to minimize.
[2022-06-09 02:22:50] [INFO ] Deduced a trap composed of 85 places in 301 ms of which 0 ms to minimize.
[2022-06-09 02:22:50] [INFO ] Trap strengthening (SAT) tested/added 68/67 trap constraints in 27876 ms
[2022-06-09 02:22:51] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 313 ms.
[2022-06-09 02:22:54] [INFO ] Deduced a trap composed of 70 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:22:55] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:22:55] [INFO ] Deduced a trap composed of 82 places in 310 ms of which 1 ms to minimize.
[2022-06-09 02:22:56] [INFO ] Deduced a trap composed of 81 places in 312 ms of which 0 ms to minimize.
[2022-06-09 02:22:56] [INFO ] Deduced a trap composed of 82 places in 292 ms of which 1 ms to minimize.
[2022-06-09 02:22:57] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 0 ms to minimize.
[2022-06-09 02:22:57] [INFO ] Deduced a trap composed of 81 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:22:58] [INFO ] Deduced a trap composed of 83 places in 311 ms of which 0 ms to minimize.
[2022-06-09 02:22:58] [INFO ] Deduced a trap composed of 89 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:22:58] [INFO ] Deduced a trap composed of 82 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:22:59] [INFO ] Deduced a trap composed of 91 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:22:59] [INFO ] Deduced a trap composed of 90 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:23:00] [INFO ] Deduced a trap composed of 82 places in 356 ms of which 0 ms to minimize.
[2022-06-09 02:23:00] [INFO ] Deduced a trap composed of 81 places in 304 ms of which 1 ms to minimize.
[2022-06-09 02:23:01] [INFO ] Deduced a trap composed of 76 places in 316 ms of which 0 ms to minimize.
[2022-06-09 02:23:01] [INFO ] Deduced a trap composed of 76 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:23:02] [INFO ] Deduced a trap composed of 78 places in 321 ms of which 0 ms to minimize.
[2022-06-09 02:23:02] [INFO ] Deduced a trap composed of 78 places in 309 ms of which 1 ms to minimize.
[2022-06-09 02:23:02] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:23:03] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 1 ms to minimize.
[2022-06-09 02:23:03] [INFO ] Deduced a trap composed of 57 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:23:04] [INFO ] Deduced a trap composed of 91 places in 313 ms of which 0 ms to minimize.
[2022-06-09 02:23:04] [INFO ] Deduced a trap composed of 84 places in 299 ms of which 0 ms to minimize.
[2022-06-09 02:23:05] [INFO ] Deduced a trap composed of 83 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:23:05] [INFO ] Deduced a trap composed of 85 places in 300 ms of which 0 ms to minimize.
[2022-06-09 02:23:06] [INFO ] Deduced a trap composed of 85 places in 314 ms of which 1 ms to minimize.
[2022-06-09 02:23:06] [INFO ] Deduced a trap composed of 74 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:23:06] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 1 ms to minimize.
[2022-06-09 02:23:07] [INFO ] Deduced a trap composed of 73 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:23:07] [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 1
[2022-06-09 02:23:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:07] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2022-06-09 02:23:08] [INFO ] [Real]Added 296 Read/Feed constraints in 195 ms returned sat
[2022-06-09 02:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:23:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:08] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2022-06-09 02:23:08] [INFO ] [Nat]Added 296 Read/Feed constraints in 207 ms returned sat
[2022-06-09 02:23:09] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 0 ms to minimize.
[2022-06-09 02:23:09] [INFO ] Deduced a trap composed of 94 places in 344 ms of which 0 ms to minimize.
[2022-06-09 02:23:10] [INFO ] Deduced a trap composed of 97 places in 401 ms of which 0 ms to minimize.
[2022-06-09 02:23:10] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 0 ms to minimize.
[2022-06-09 02:23:11] [INFO ] Deduced a trap composed of 87 places in 340 ms of which 0 ms to minimize.
[2022-06-09 02:23:11] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2022-06-09 02:23:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2387 ms
[2022-06-09 02:23:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 209 ms.
[2022-06-09 02:23:15] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 1 ms to minimize.
[2022-06-09 02:23:15] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 0 ms to minimize.
[2022-06-09 02:23:16] [INFO ] Deduced a trap composed of 97 places in 312 ms of which 0 ms to minimize.
[2022-06-09 02:23:16] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 0 ms to minimize.
[2022-06-09 02:23:17] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 0 ms to minimize.
[2022-06-09 02:23:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2221 ms
[2022-06-09 02:23:17] [INFO ] Added : 119 causal constraints over 24 iterations in 6171 ms. Result :sat
[2022-06-09 02:23:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:18] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-09 02:23:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:23:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:18] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2022-06-09 02:23:18] [INFO ] [Nat]Added 296 Read/Feed constraints in 197 ms returned sat
[2022-06-09 02:23:19] [INFO ] Deduced a trap composed of 16 places in 433 ms of which 8 ms to minimize.
[2022-06-09 02:23:19] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2022-06-09 02:23:19] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-06-09 02:23:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1019 ms
[2022-06-09 02:23:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 208 ms.
[2022-06-09 02:23:23] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 0 ms to minimize.
[2022-06-09 02:23:24] [INFO ] Deduced a trap composed of 89 places in 319 ms of which 0 ms to minimize.
[2022-06-09 02:23:24] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 1 ms to minimize.
[2022-06-09 02:23:25] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 0 ms to minimize.
[2022-06-09 02:23:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1906 ms
[2022-06-09 02:23:25] [INFO ] Added : 113 causal constraints over 23 iterations in 5617 ms. Result :sat
Incomplete Parikh walk after 1180600 steps, including 1000 resets, run finished after 9687 ms. (steps per millisecond=121 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1238000 steps, including 1000 resets, run finished after 10003 ms. (steps per millisecond=123 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1219900 steps, including 1000 resets, run finished after 9963 ms. (steps per millisecond=122 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 13 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 82 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:23:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:23:55] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:23:55] [INFO ] Implicit Places using invariants in 493 ms returned []
[2022-06-09 02:23:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:23:56] [INFO ] Computed 8 place invariants in 29 ms
[2022-06-09 02:23:56] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:24:02] [INFO ] Implicit Places using invariants and state equation in 6441 ms returned []
Implicit Place search using SMT with State Equation took 6938 ms to find 0 implicit places.
[2022-06-09 02:24:02] [INFO ] Redundant transitions in 309 ms returned []
[2022-06-09 02:24:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:24:02] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:24:03] [INFO ] Dead Transitions using invariants and state equation in 996 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100003 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=450 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-09 02:24:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:24:03] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-09 02:24:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:04] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-06-09 02:24:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:24:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:05] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2022-06-09 02:24:05] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:24:05] [INFO ] [Nat]Added 296 Read/Feed constraints in 196 ms returned sat
[2022-06-09 02:24:05] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 0 ms to minimize.
[2022-06-09 02:24:05] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2022-06-09 02:24:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 788 ms
[2022-06-09 02:24:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 447 ms.
[2022-06-09 02:24:10] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 0 ms to minimize.
[2022-06-09 02:24:10] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2022-06-09 02:24:10] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 0 ms to minimize.
[2022-06-09 02:24:11] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2022-06-09 02:24:11] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2022-06-09 02:24:11] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2022-06-09 02:24:11] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2022-06-09 02:24:12] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 0 ms to minimize.
[2022-06-09 02:24:12] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 0 ms to minimize.
[2022-06-09 02:24:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3020 ms
[2022-06-09 02:24:13] [INFO ] Added : 107 causal constraints over 23 iterations in 7119 ms. Result :sat
[2022-06-09 02:24:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:13] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-06-09 02:24:13] [INFO ] [Real]Added 296 Read/Feed constraints in 190 ms returned sat
[2022-06-09 02:24:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:24:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:14] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2022-06-09 02:24:14] [INFO ] [Nat]Added 296 Read/Feed constraints in 193 ms returned sat
[2022-06-09 02:24:15] [INFO ] Deduced a trap composed of 70 places in 357 ms of which 1 ms to minimize.
[2022-06-09 02:24:15] [INFO ] Deduced a trap composed of 86 places in 360 ms of which 0 ms to minimize.
[2022-06-09 02:24:16] [INFO ] Deduced a trap composed of 86 places in 371 ms of which 1 ms to minimize.
[2022-06-09 02:24:16] [INFO ] Deduced a trap composed of 70 places in 371 ms of which 0 ms to minimize.
[2022-06-09 02:24:16] [INFO ] Deduced a trap composed of 41 places in 355 ms of which 0 ms to minimize.
[2022-06-09 02:24:17] [INFO ] Deduced a trap composed of 85 places in 360 ms of which 0 ms to minimize.
[2022-06-09 02:24:17] [INFO ] Deduced a trap composed of 87 places in 371 ms of which 1 ms to minimize.
[2022-06-09 02:24:18] [INFO ] Deduced a trap composed of 89 places in 354 ms of which 0 ms to minimize.
[2022-06-09 02:24:18] [INFO ] Deduced a trap composed of 86 places in 370 ms of which 2 ms to minimize.
[2022-06-09 02:24:19] [INFO ] Deduced a trap composed of 87 places in 382 ms of which 0 ms to minimize.
[2022-06-09 02:24:19] [INFO ] Deduced a trap composed of 87 places in 381 ms of which 0 ms to minimize.
[2022-06-09 02:24:20] [INFO ] Deduced a trap composed of 7 places in 377 ms of which 1 ms to minimize.
[2022-06-09 02:24:20] [INFO ] Deduced a trap composed of 91 places in 341 ms of which 0 ms to minimize.
[2022-06-09 02:24:21] [INFO ] Deduced a trap composed of 94 places in 357 ms of which 0 ms to minimize.
[2022-06-09 02:24:21] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 0 ms to minimize.
[2022-06-09 02:24:21] [INFO ] Deduced a trap composed of 88 places in 332 ms of which 0 ms to minimize.
[2022-06-09 02:24:22] [INFO ] Deduced a trap composed of 97 places in 321 ms of which 0 ms to minimize.
[2022-06-09 02:24:22] [INFO ] Deduced a trap composed of 89 places in 333 ms of which 1 ms to minimize.
[2022-06-09 02:24:23] [INFO ] Deduced a trap composed of 92 places in 325 ms of which 0 ms to minimize.
[2022-06-09 02:24:23] [INFO ] Deduced a trap composed of 87 places in 328 ms of which 0 ms to minimize.
[2022-06-09 02:24:24] [INFO ] Deduced a trap composed of 88 places in 326 ms of which 0 ms to minimize.
[2022-06-09 02:24:24] [INFO ] Deduced a trap composed of 92 places in 325 ms of which 0 ms to minimize.
[2022-06-09 02:24:24] [INFO ] Deduced a trap composed of 91 places in 324 ms of which 1 ms to minimize.
[2022-06-09 02:24:25] [INFO ] Deduced a trap composed of 87 places in 332 ms of which 0 ms to minimize.
[2022-06-09 02:24:25] [INFO ] Deduced a trap composed of 92 places in 327 ms of which 0 ms to minimize.
[2022-06-09 02:24:26] [INFO ] Deduced a trap composed of 89 places in 323 ms of which 1 ms to minimize.
[2022-06-09 02:24:26] [INFO ] Deduced a trap composed of 93 places in 317 ms of which 0 ms to minimize.
[2022-06-09 02:24:26] [INFO ] Deduced a trap composed of 89 places in 316 ms of which 1 ms to minimize.
[2022-06-09 02:24:27] [INFO ] Deduced a trap composed of 91 places in 311 ms of which 0 ms to minimize.
[2022-06-09 02:24:27] [INFO ] Deduced a trap composed of 87 places in 324 ms of which 0 ms to minimize.
[2022-06-09 02:24:28] [INFO ] Deduced a trap composed of 87 places in 328 ms of which 0 ms to minimize.
[2022-06-09 02:24:28] [INFO ] Deduced a trap composed of 87 places in 320 ms of which 0 ms to minimize.
[2022-06-09 02:24:29] [INFO ] Deduced a trap composed of 87 places in 314 ms of which 1 ms to minimize.
[2022-06-09 02:24:29] [INFO ] Deduced a trap composed of 89 places in 310 ms of which 1 ms to minimize.
[2022-06-09 02:24:29] [INFO ] Deduced a trap composed of 88 places in 326 ms of which 1 ms to minimize.
[2022-06-09 02:24:30] [INFO ] Deduced a trap composed of 88 places in 321 ms of which 1 ms to minimize.
[2022-06-09 02:24:30] [INFO ] Deduced a trap composed of 89 places in 311 ms of which 0 ms to minimize.
[2022-06-09 02:24:31] [INFO ] Deduced a trap composed of 92 places in 314 ms of which 0 ms to minimize.
[2022-06-09 02:24:31] [INFO ] Deduced a trap composed of 92 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:24:31] [INFO ] Deduced a trap composed of 92 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:24:32] [INFO ] Deduced a trap composed of 91 places in 318 ms of which 1 ms to minimize.
[2022-06-09 02:24:32] [INFO ] Deduced a trap composed of 91 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:24:33] [INFO ] Deduced a trap composed of 88 places in 312 ms of which 1 ms to minimize.
[2022-06-09 02:24:33] [INFO ] Deduced a trap composed of 83 places in 314 ms of which 0 ms to minimize.
[2022-06-09 02:24:33] [INFO ] Deduced a trap composed of 84 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:24:34] [INFO ] Deduced a trap composed of 88 places in 317 ms of which 0 ms to minimize.
[2022-06-09 02:24:34] [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 1
[2022-06-09 02:24:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:34] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-06-09 02:24:35] [INFO ] [Real]Added 296 Read/Feed constraints in 197 ms returned sat
[2022-06-09 02:24:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:24:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:35] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2022-06-09 02:24:35] [INFO ] [Nat]Added 296 Read/Feed constraints in 217 ms returned sat
[2022-06-09 02:24:36] [INFO ] Deduced a trap composed of 24 places in 358 ms of which 0 ms to minimize.
[2022-06-09 02:24:36] [INFO ] Deduced a trap composed of 94 places in 358 ms of which 0 ms to minimize.
[2022-06-09 02:24:37] [INFO ] Deduced a trap composed of 97 places in 367 ms of which 0 ms to minimize.
[2022-06-09 02:24:37] [INFO ] Deduced a trap composed of 58 places in 362 ms of which 0 ms to minimize.
[2022-06-09 02:24:38] [INFO ] Deduced a trap composed of 87 places in 361 ms of which 1 ms to minimize.
[2022-06-09 02:24:38] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2022-06-09 02:24:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2480 ms
[2022-06-09 02:24:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 223 ms.
[2022-06-09 02:24:42] [INFO ] Deduced a trap composed of 39 places in 335 ms of which 1 ms to minimize.
[2022-06-09 02:24:43] [INFO ] Deduced a trap composed of 66 places in 342 ms of which 0 ms to minimize.
[2022-06-09 02:24:43] [INFO ] Deduced a trap composed of 97 places in 337 ms of which 1 ms to minimize.
[2022-06-09 02:24:44] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 1 ms to minimize.
[2022-06-09 02:24:44] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 1 ms to minimize.
[2022-06-09 02:24:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2297 ms
[2022-06-09 02:24:44] [INFO ] Added : 119 causal constraints over 24 iterations in 6255 ms. Result :sat
[2022-06-09 02:24:44] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:45] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2022-06-09 02:24:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:24:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:24:45] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2022-06-09 02:24:45] [INFO ] [Nat]Added 296 Read/Feed constraints in 203 ms returned sat
[2022-06-09 02:24:46] [INFO ] Deduced a trap composed of 16 places in 427 ms of which 1 ms to minimize.
[2022-06-09 02:24:46] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2022-06-09 02:24:46] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2022-06-09 02:24:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1018 ms
[2022-06-09 02:24:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 241 ms.
[2022-06-09 02:24:50] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 0 ms to minimize.
[2022-06-09 02:24:51] [INFO ] Deduced a trap composed of 89 places in 321 ms of which 0 ms to minimize.
[2022-06-09 02:24:51] [INFO ] Deduced a trap composed of 27 places in 325 ms of which 0 ms to minimize.
[2022-06-09 02:24:52] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2022-06-09 02:24:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1911 ms
[2022-06-09 02:24:52] [INFO ] Added : 113 causal constraints over 23 iterations in 5635 ms. Result :sat
[2022-06-09 02:24:52] [INFO ] Flatten gal took : 179 ms
[2022-06-09 02:24:53] [INFO ] Flatten gal took : 193 ms
[2022-06-09 02:24:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3822525137915868333.gal : 15 ms
[2022-06-09 02:24:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8760802576023280772.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/ReachabilityCardinality3822525137915868333.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8760802576023280772.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/ReachabilityCardinality3822525137915868333.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8760802576023280772.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8760802576023280772.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 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 461
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :461 after 2606
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2606 after 6863
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6863 after 15344
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :15344 after 32273
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :32273 after 66098
Detected timeout of ITS tools.
[2022-06-09 02:25:08] [INFO ] Flatten gal took : 173 ms
[2022-06-09 02:25:08] [INFO ] Applying decomposition
[2022-06-09 02:25:08] [INFO ] Flatten gal took : 173 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/graph7043669668375905499.txt, -o, /tmp/graph7043669668375905499.bin, -w, /tmp/graph7043669668375905499.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/graph7043669668375905499.bin, -l, -1, -v, -w, /tmp/graph7043669668375905499.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 02:25:08] [INFO ] Decomposing Gal with order
[2022-06-09 02:25:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 02:25:09] [INFO ] Removed a total of 385 redundant transitions.
[2022-06-09 02:25:09] [INFO ] Flatten gal took : 343 ms
[2022-06-09 02:25:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 28 ms.
[2022-06-09 02:25:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1297718408383540210.gal : 14 ms
[2022-06-09 02:25:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15261224873094219931.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/ReachabilityCardinality1297718408383540210.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15261224873094219931.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/ReachabilityCardinality1297718408383540210.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15261224873094219931.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15261224873094219931.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 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 66
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :66 after 2012
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2012 after 6269
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6269 after 14750
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14750 after 31679
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31679 after 65504
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10492318798115030604
[2022-06-09 02:25:24] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10492318798115030604
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/ltsmin10492318798115030604]
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/ltsmin10492318798115030604] 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/ltsmin10492318798115030604] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 268 transition count 3696
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 181 place count 268 transition count 3691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 327 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3691 rows 263 cols
[2022-06-09 02:25:25] [INFO ] Computed 9 place invariants in 11 ms
[2022-06-09 02:25:25] [INFO ] [Real]Absence check using 9 positive place invariants in 21 ms returned sat
[2022-06-09 02:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:26] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2022-06-09 02:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:25:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:26] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2022-06-09 02:25:27] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 218 ms.
[2022-06-09 02:25:27] [INFO ] Added : 4 causal constraints over 2 iterations in 592 ms. Result :sat
[2022-06-09 02:25:27] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:28] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2022-06-09 02:25:28] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 291 ms.
[2022-06-09 02:25:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:25:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:29] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-06-09 02:25:29] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 433 ms.
[2022-06-09 02:25:30] [INFO ] Added : 5 causal constraints over 3 iterations in 916 ms. Result :sat
[2022-06-09 02:25:30] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 02:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:30] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2022-06-09 02:25:31] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 284 ms.
[2022-06-09 02:25:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:25:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:32] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2022-06-09 02:25:32] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 235 ms.
[2022-06-09 02:25:32] [INFO ] Added : 5 causal constraints over 3 iterations in 713 ms. Result :sat
[2022-06-09 02:25:32] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 02:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:33] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2022-06-09 02:25:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:25:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:34] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2022-06-09 02:25:34] [INFO ] Computed and/alt/rep : 558/1840/558 causal constraints (skipped 3132 transitions) in 313 ms.
[2022-06-09 02:25:34] [INFO ] Added : 6 causal constraints over 3 iterations in 792 ms. Result :sat
[2022-06-09 02:25:35] [INFO ] Flatten gal took : 184 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2178150642330318957
[2022-06-09 02:25:35] [INFO ] Too many transitions (3871) to apply POR reductions. Disabling POR matrices.
[2022-06-09 02:25:35] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2178150642330318957
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/ltsmin2178150642330318957]
[2022-06-09 02:25:35] [INFO ] Applying decomposition
[2022-06-09 02:25:35] [INFO ] Flatten gal took : 282 ms
[2022-06-09 02:25:35] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 02:25:35] [INFO ] Flatten gal took : 218 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/graph17837496458788383590.txt, -o, /tmp/graph17837496458788383590.bin, -w, /tmp/graph17837496458788383590.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/graph17837496458788383590.bin, -l, -1, -v, -w, /tmp/graph17837496458788383590.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 02:25:36] [INFO ] Decomposing Gal with order
[2022-06-09 02:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 02:25:36] [INFO ] Removed a total of 385 redundant transitions.
[2022-06-09 02:25:36] [INFO ] Ran tautology test, simplified 0 / 4 in 1419 ms.
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(UNSAT) depth K=0 took 25 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(UNSAT) depth K=0 took 4 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(UNSAT) depth K=0 took 2 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(UNSAT) depth K=0 took 18 ms
[2022-06-09 02:25:37] [INFO ] Flatten gal took : 541 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(UNSAT) depth K=1 took 22 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(UNSAT) depth K=1 took 3 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(UNSAT) depth K=1 took 12 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(UNSAT) depth K=1 took 4 ms
[2022-06-09 02:25:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 28 ms.
[2022-06-09 02:25:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12396483711340556878.gal : 27 ms
[2022-06-09 02:25:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6258063809578068562.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/ReachabilityCardinality12396483711340556878.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6258063809578068562.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(UNSAT) depth K=2 took 263 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(UNSAT) depth K=2 took 11 ms

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/ReachabilityCardinality12396483711340556878.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6258063809578068562.prop --nowitness --gen-order FOLLOW
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(UNSAT) depth K=2 took 7 ms
[2022-06-09 02:25:37] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(UNSAT) depth K=2 took 18 ms
[2022-06-09 02:25:38] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(UNSAT) depth K=3 took 440 ms
[2022-06-09 02:25:38] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(UNSAT) depth K=3 took 160 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:25:38] [INFO ] Computed 8 place invariants in 11 ms
inv : x0_BUG_REPORT_q0 + x0_BUG_REPORT_q2 + x0_BUG_REPORT_q4 + x0_BUG_REPORT_q7 + x0_BUG_REPORT_q8 + x0_CLOSED_q4 + x0_CLOSED_q7 + x0_CLOSED_q8 + x0_FIXED_q4 + x0_FIXED_q7 + x0_FIXED_q8 + x0_FIX_AGAIN_q7 + x0_FIX_AGAIN_q8 + x0_MORE_INFO_q2 + x0_MORE_INFO_q4 + x0_MORE_INFO_q7 + x0_MORE_INFO_q8 + x0_MUST_FIX_q4 + x0_MUST_FIX_q7 + x0_MUST_FIX_q8 + x0_PENDING_q4 + x0_PENDING_q7 + x0_PENDING_q8 + x0_VERIFIED_q7 + x0_VERIFIED_q8 = 1
inv : l5 + l6 + l9 = 1
inv : x3_BUG_REPORT_q0 + x3_BUG_REPORT_q3 + x3_BUG_REPORT_q5 + x3_BUG_REPORT_q8 + x3_CLOSED_q5 + x3_CLOSED_q8 + x3_FIXED_q3 + x3_FIXED_q5 + x3_FIXED_q8 + x3_FIX_AGAIN_q0 + x3_FIX_AGAIN_q3 + x3_FIX_AGAIN_q5 + x3_FIX_AGAIN_q8 + x3_MORE_INFO_q3 + x3_MORE_INFO_q5 + x3_MORE_INFO_q8 + x3_MUST_FIX_q5 + x3_MUST_FIX_q8 + x3_PENDING_q3 + x3_PENDING_q5 + x3_PENDING_q8 + x3_VERIFIED_q0 + x3_VERIFIED_q3 + x3_VERIFIED_q5 + x3_VERIFIED_q8 = 1
inv : l25 + l26 + l28 + l29 + l30 + l31 = 1
inv : x2_BUG_REPORT_q0 + x2_BUG_REPORT_q2 + x2_BUG_REPORT_q4 + x2_BUG_REPORT_q6 + x2_BUG_REPORT_q7 + x2_BUG_REPORT_q8 + x2_CLOSED_q4 + x2_CLOSED_q6 + x2_CLOSED_q7 + x2_CLOSED_q8 + x2_FIXED_q0 + x2_FIXED_q2 + x2_FIXED_q4 + x2_FIXED_q6 + x2_FIXED_q7 + x2_FIXED_q8 + x2_FIX_AGAIN_q6 + x2_FIX_AGAIN_q7 + x2_FIX_AGAIN_q8 + x2_MORE_INFO_q2 + x2_MORE_INFO_q4 + x2_MORE_INFO_q6 + x2_MORE_INFO_q7 + x2_MORE_INFO_q8 + x2_MUST_FIX_q4 + x2_MUST_FIX_q6 + x2_MUST_FIX_q7 + x2_MUST_FIX_q8 + x2_PENDING_q0 + x2_PENDING_q2 + x2_PENDING_q4 + x2_PENDING_q6 + x2_PENDING_q7 + x2_PENDING_q8 + x2_VERIFIED_q6 + x2_VERIFIED_q7 + x2_VERIFIED_q8 = 1
inv : l19 + l20 + l23 + l24 = 1
inv : x4_BUG_REPORT_q0 + x4_BUG_REPORT_q3 + x4_BUG_REPORT_q5 + x4_BUG_REPORT_q6 + x4_BUG_REPORT_q8 + x4_CLOSED_q0 + x4_CLOSED_q3 + x4_CLOSED_q5 + x4_CLOSED_q6 + x4_CLOSED_q8 + x4_FIXED_q3 + x4_FIXED_q5 + x4_FIXED_q6 + x4_FIXED_q8 + x4_FIX_AGAIN_q5 + x4_FIX_AGAIN_q6 + x4_FIX_AGAIN_q8 + x4_MORE_INFO_q3 + x4_MORE_INFO_q5 + x4_MORE_INFO_q6 + x4_MORE_INFO_q8 + x4_MUST_FIX_q0 + x4_MUST_FIX_q3 + x4_MUST_FIX_q5 + x4_MUST_FIX_q6 + x4_MUST_FIX_q8 + x4_PENDING_q3 + x4_PENDING_q5 + x4_PENDING_q6 + x4_PENDING_q8 + x4_VERIFIED_q5 + x4_VERIFIED_q6 + x4_VERIFIED_q8 = 1
inv : x1_BUG_REPORT_q0 + x1_BUG_REPORT_q1 + x1_BUG_REPORT_q8 + x1_CLOSED_q8 + x1_FIXED_q8 + x1_FIX_AGAIN_q8 + x1_MORE_INFO_q0 + x1_MORE_INFO_q1 + x1_MORE_INFO_q8 + x1_MUST_FIX_q8 + x1_PENDING_q8 + x1_VERIFIED_q8 = 1
Total of 8 invariants.
[2022-06-09 02:25:38] [INFO ] Computed 8 place invariants in 29 ms
[2022-06-09 02:25:38] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(UNSAT) depth K=3 took 266 ms
Loading property file /tmp/ReachabilityCardinality6258063809578068562.prop.
[2022-06-09 02:25:38] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(UNSAT) depth K=3 took 191 ms
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 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 66
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :66 after 2012
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2012 after 6269
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6269 after 14750
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14750 after 31679
[2022-06-09 02:25:41] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(UNSAT) depth K=4 took 2444 ms
[2022-06-09 02:25:41] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(UNSAT) depth K=4 took 649 ms
[2022-06-09 02:25:43] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(UNSAT) depth K=4 took 1414 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31679 after 65504
[2022-06-09 02:25:43] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(UNSAT) depth K=4 took 601 ms
[2022-06-09 02:26:00] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(UNSAT) depth K=5 took 16259 ms
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :65504 after 133121
[2022-06-09 02:26:10] [INFO ] Proved 269 variables to be positive in 32333 ms
[2022-06-09 02:26:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-02
[2022-06-09 02:26:10] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(SAT) depth K=0 took 22 ms
[2022-06-09 02:26:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-03
[2022-06-09 02:26:10] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(SAT) depth K=0 took 26 ms
[2022-06-09 02:26:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-04
[2022-06-09 02:26:10] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(SAT) depth K=0 took 24 ms
[2022-06-09 02:26:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-13
[2022-06-09 02:26:10] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(SAT) depth K=0 took 15 ms
[2022-06-09 02:26:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-02
[2022-06-09 02:26:17] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(SAT) depth K=1 took 6731 ms
[2022-06-09 02:26:22] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(UNSAT) depth K=5 took 22424 ms
[2022-06-09 02:26:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-03
[2022-06-09 02:26:26] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(SAT) depth K=1 took 8658 ms
[2022-06-09 02:26:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-04
[2022-06-09 02:26:32] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(SAT) depth K=1 took 5880 ms
Compilation finished in 61167 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2178150642330318957]
Link finished in 81 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, BugTrackingPTq8m032ReachabilityCardinality02==true], workingDir=/tmp/ltsmin2178150642330318957]
[2022-06-09 02:26:47] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(UNSAT) depth K=5 took 24736 ms
[2022-06-09 02:26:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-13
[2022-06-09 02:26:50] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(SAT) depth K=1 took 18444 ms
[2022-06-09 02:27:21] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(UNSAT) depth K=5 took 34205 ms
[2022-06-09 02:28:39] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(UNSAT) depth K=6 took 77863 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :133121 after 268322
[2022-06-09 02:31:39] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(UNSAT) depth K=6 took 179757 ms
[2022-06-09 02:35:32] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(UNSAT) depth K=6 took 232710 ms
[2022-06-09 02:36:55] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-13(UNSAT) depth K=6 took 83449 ms
[2022-06-09 02:41:06] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(UNSAT) depth K=7 took 250819 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, BugTrackingPTq8m032ReachabilityCardinality02==true], workingDir=/tmp/ltsmin2178150642330318957]
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, BugTrackingPTq8m032ReachabilityCardinality03==true], workingDir=/tmp/ltsmin2178150642330318957]
Detected timeout of ITS tools.
[2022-06-09 02:47:31] [INFO ] Applying decomposition
[2022-06-09 02:47:32] [INFO ] Flatten gal took : 916 ms
[2022-06-09 02:47:32] [INFO ] Decomposing Gal with order
[2022-06-09 02:47:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 02:47:33] [INFO ] Removed a total of 385 redundant transitions.
[2022-06-09 02:47:33] [INFO ] Flatten gal took : 859 ms
[2022-06-09 02:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 33 ms.
[2022-06-09 02:47:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16868562230465037577.gal : 47 ms
[2022-06-09 02:47:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17007457472529329943.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/ReachabilityCardinality16868562230465037577.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17007457472529329943.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/ReachabilityCardinality16868562230465037577.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17007457472529329943.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17007457472529329943.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 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 66
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :66 after 2012
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2012 after 6269
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6269 after 14750
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14750 after 31679
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31679 after 65504
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :65504 after 133121
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :133121 after 268322
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, BugTrackingPTq8m032ReachabilityCardinality03==true], workingDir=/tmp/ltsmin2178150642330318957]
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, BugTrackingPTq8m032ReachabilityCardinality04==true], workingDir=/tmp/ltsmin2178150642330318957]
[2022-06-09 03:00:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-02
[2022-06-09 03:00:16] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-02(SAT) depth K=2 took 2005439 ms
[2022-06-09 03:07:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q8m032-ReachabilityCardinality-03
[2022-06-09 03:07:09] [INFO ] KInduction solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(SAT) depth K=2 took 413413 ms
[2022-06-09 03:09:24] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-03(UNSAT) depth K=7 took 1698240 ms
Detected timeout of ITS tools.
[2022-06-09 03:09:28] [INFO ] Flatten gal took : 593 ms
[2022-06-09 03:09:29] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 03:09:29] [INFO ] Transformed 269 places.
[2022-06-09 03:09:29] [INFO ] Transformed 3871 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 03:09:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10551647573514509447.gal : 36 ms
[2022-06-09 03:09:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7560060572075394644.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/ReachabilityCardinality10551647573514509447.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7560060572075394644.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/ReachabilityCardinality10551647573514509447.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7560060572075394644.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/ReachabilityCardinality7560060572075394644.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :4 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 38
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :233 after 373
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :373 after 471
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :471 after 787
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2514 after 2788
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :6288 after 11580
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :32651 after 37006
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, BugTrackingPTq8m032ReachabilityCardinality04==true], workingDir=/tmp/ltsmin2178150642330318957]
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, BugTrackingPTq8m032ReachabilityCardinality13==true], workingDir=/tmp/ltsmin2178150642330318957]
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :37006 after 60616
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :395459 after 468621
[2022-06-09 03:15:13] [INFO ] BMC solution for property BugTracking-PT-q8m032-ReachabilityCardinality-04(UNSAT) depth K=7 took 349163 ms
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :468621 after 850379

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-q8m032"
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-q8m032, 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-165472292600038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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