About the Execution of 2021-gold for FunctionPointer-PT-c064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9535.659 | 3600000.00 | 13382617.00 | 1013.10 | T?FFTF?T?FFTFFFT | normal |
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-165472292800195.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 FunctionPointer-PT-c064, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292800195
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 7 17:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 17:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 7 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c064-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654771441993
Running Version 0
[2022-06-09 10:44:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 10:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:44:04] [INFO ] Load time of PNML (sax parser for PT used): 392 ms
[2022-06-09 10:44:04] [INFO ] Transformed 2826 places.
[2022-06-09 10:44:04] [INFO ] Transformed 8960 transitions.
[2022-06-09 10:44:04] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 493 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 30 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10035 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 1492860 steps, run timeout after 30001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 1492860 steps, saw 1218921 distinct states, run finished after 30009 ms. (steps per millisecond=49 ) properties seen :{}
Running SMT prover for 9 properties.
[2022-06-09 10:44:34] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 10:44:34] [INFO ] Computed 4 place invariants in 95 ms
[2022-06-09 10:44:35] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2022-06-09 10:44:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:44:36] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2022-06-09 10:44:36] [INFO ] State equation strengthened by 2822 read => feed constraints.
[2022-06-09 10:44:38] [INFO ] [Real]Added 2822 Read/Feed constraints in 2047 ms returned sat
[2022-06-09 10:44:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:44:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 24 ms returned sat
[2022-06-09 10:44:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:44:39] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2022-06-09 10:44:42] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2271 ms returned sat
[2022-06-09 10:44:42] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 7 ms to minimize.
[2022-06-09 10:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
[2022-06-09 10:44:43] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 924 ms.
[2022-06-09 10:44:45] [INFO ] Deduced a trap composed of 17 places in 1216 ms of which 9 ms to minimize.
[2022-06-09 10:44:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-09 10:44:45] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:44:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:44:46] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2022-06-09 10:44:48] [INFO ] [Real]Added 2822 Read/Feed constraints in 2026 ms returned sat
[2022-06-09 10:44:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:44:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:44:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:44:49] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2022-06-09 10:44:51] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2460 ms returned sat
[2022-06-09 10:44:52] [INFO ] Deduced a trap composed of 131 places in 202 ms of which 2 ms to minimize.
[2022-06-09 10:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 534 ms
[2022-06-09 10:44:53] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 893 ms.
[2022-06-09 10:44:55] [INFO ] Deduced a trap composed of 17 places in 1648 ms of which 15 ms to minimize.
[2022-06-09 10:44:55] [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 10:44:55] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:44:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 10:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:44:56] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2022-06-09 10:44:58] [INFO ] [Real]Added 2822 Read/Feed constraints in 2034 ms returned sat
[2022-06-09 10:44:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:44:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:44:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:44:59] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2022-06-09 10:45:01] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2222 ms returned sat
[2022-06-09 10:45:01] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 1 ms to minimize.
[2022-06-09 10:45:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2022-06-09 10:45:02] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 513 ms.
[2022-06-09 10:45:03] [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 10:45:03] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:45:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:04] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2022-06-09 10:45:06] [INFO ] [Real]Added 2822 Read/Feed constraints in 1993 ms returned sat
[2022-06-09 10:45:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:45:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:45:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:07] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2022-06-09 10:45:09] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2056 ms returned sat
[2022-06-09 10:45:09] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2022-06-09 10:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2022-06-09 10:45:10] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 499 ms.
[2022-06-09 10:45:11] [INFO ] Added : 30 causal constraints over 6 iterations in 1588 ms. Result :unknown
[2022-06-09 10:45:11] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:45:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:12] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2022-06-09 10:45:14] [INFO ] [Real]Added 2822 Read/Feed constraints in 1976 ms returned sat
[2022-06-09 10:45:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:45:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:45:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:15] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2022-06-09 10:45:18] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2548 ms returned sat
[2022-06-09 10:45:19] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 471 ms.
[2022-06-09 10:45:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-09 10:45:20] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:45:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:20] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2022-06-09 10:45:22] [INFO ] [Real]Added 2822 Read/Feed constraints in 2009 ms returned sat
[2022-06-09 10:45:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:45:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:45:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:24] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2022-06-09 10:45:26] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2257 ms returned sat
[2022-06-09 10:45:26] [INFO ] Deduced a trap composed of 131 places in 96 ms of which 2 ms to minimize.
[2022-06-09 10:45:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2022-06-09 10:45:27] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 441 ms.
[2022-06-09 10:45:29] [INFO ] Deduced a trap composed of 17 places in 1240 ms of which 2 ms to minimize.
[2022-06-09 10:45:29] [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 5
[2022-06-09 10:45:29] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:45:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:30] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2022-06-09 10:45:32] [INFO ] [Real]Added 2822 Read/Feed constraints in 2100 ms returned sat
[2022-06-09 10:45:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:45:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:45:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:33] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2022-06-09 10:45:36] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2467 ms returned sat
[2022-06-09 10:45:36] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 461 ms.
[2022-06-09 10:45:38] [INFO ] Deduced a trap composed of 17 places in 1192 ms of which 2 ms to minimize.
[2022-06-09 10:45: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 6
[2022-06-09 10:45:39] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:45:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:39] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2022-06-09 10:45:41] [INFO ] [Real]Added 2822 Read/Feed constraints in 2015 ms returned sat
[2022-06-09 10:45:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:45:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2022-06-09 10:45:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:43] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2022-06-09 10:45:45] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2499 ms returned sat
[2022-06-09 10:45:46] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 512 ms.
[2022-06-09 10:45:48] [INFO ] Deduced a trap composed of 17 places in 1170 ms of which 12 ms to minimize.
[2022-06-09 10:45:48] [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 7
[2022-06-09 10:45:48] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:45:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:49] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2022-06-09 10:45:51] [INFO ] [Real]Added 2822 Read/Feed constraints in 2083 ms returned sat
[2022-06-09 10:45:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:45:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:45:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:45:52] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2022-06-09 10:45:54] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2322 ms returned sat
[2022-06-09 10:45:54] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 1 ms to minimize.
[2022-06-09 10:45:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2022-06-09 10:45:55] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 488 ms.
[2022-06-09 10:45:57] [INFO ] Deduced a trap composed of 17 places in 1234 ms of which 2 ms to minimize.
[2022-06-09 10:45:57] [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 8
Fused 9 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 1444800 steps, including 1002 resets, run finished after 24873 ms. (steps per millisecond=58 ) properties (out of 9) seen :5 could not realise parikh vector
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 25 out of 1628 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.19 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 290 places :
Symmetric choice reduction at 0 with 290 rule applications. Total rules 291 place count 1321 transition count 3804
Iterating global reduction 0 with 290 rules applied. Total rules applied 581 place count 1321 transition count 3804
Ensure Unique test removed 422 transitions
Reduce isomorphic transitions removed 422 transitions.
Iterating post reduction 0 with 422 rules applied. Total rules applied 1003 place count 1321 transition count 3382
Discarding 145 places :
Symmetric choice reduction at 1 with 145 rule applications. Total rules 1148 place count 1176 transition count 3092
Iterating global reduction 1 with 145 rules applied. Total rules applied 1293 place count 1176 transition count 3092
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 1385 place count 1176 transition count 3000
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1399 place count 1162 transition count 2972
Iterating global reduction 2 with 14 rules applied. Total rules applied 1413 place count 1162 transition count 2972
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1427 place count 1148 transition count 2944
Iterating global reduction 2 with 14 rules applied. Total rules applied 1441 place count 1148 transition count 2944
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1455 place count 1134 transition count 2916
Iterating global reduction 2 with 14 rules applied. Total rules applied 1469 place count 1134 transition count 2916
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1483 place count 1120 transition count 2888
Iterating global reduction 2 with 14 rules applied. Total rules applied 1497 place count 1120 transition count 2888
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1511 place count 1106 transition count 2860
Iterating global reduction 2 with 14 rules applied. Total rules applied 1525 place count 1106 transition count 2860
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1536 place count 1095 transition count 2838
Iterating global reduction 2 with 11 rules applied. Total rules applied 1547 place count 1095 transition count 2838
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1557 place count 1085 transition count 2818
Iterating global reduction 2 with 10 rules applied. Total rules applied 1567 place count 1085 transition count 2818
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1598 place count 1054 transition count 2706
Iterating global reduction 2 with 31 rules applied. Total rules applied 1629 place count 1054 transition count 2706
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1675 place count 1008 transition count 2522
Iterating global reduction 2 with 46 rules applied. Total rules applied 1721 place count 1008 transition count 2522
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1767 place count 962 transition count 2388
Iterating global reduction 2 with 46 rules applied. Total rules applied 1813 place count 962 transition count 2388
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1859 place count 916 transition count 2296
Iterating global reduction 2 with 46 rules applied. Total rules applied 1905 place count 916 transition count 2296
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1951 place count 870 transition count 2204
Iterating global reduction 2 with 46 rules applied. Total rules applied 1997 place count 870 transition count 2204
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 2043 place count 824 transition count 2112
Iterating global reduction 2 with 46 rules applied. Total rules applied 2089 place count 824 transition count 2112
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 2134 place count 779 transition count 2022
Iterating global reduction 2 with 45 rules applied. Total rules applied 2179 place count 779 transition count 2022
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2200 place count 758 transition count 1980
Iterating global reduction 2 with 21 rules applied. Total rules applied 2221 place count 758 transition count 1980
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 2 with 36 rules applied. Total rules applied 2257 place count 758 transition count 1944
Applied a total of 2257 rules in 1960 ms. Remains 758 /1628 variables (removed 870) and now considering 1944/5962 (removed 4018) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/1628 places, 1944/5962 transitions.
[2022-06-09 10:46:24] [INFO ] Flatten gal took : 174 ms
[2022-06-09 10:46:25] [INFO ] Flatten gal took : 115 ms
[2022-06-09 10:46:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2328532013332748018.gal : 36 ms
[2022-06-09 10:46:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12458933067066649437.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/ReachabilityCardinality2328532013332748018.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12458933067066649437.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/ReachabilityCardinality2328532013332748018.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12458933067066649437.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12458933067066649437.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Detected timeout of ITS tools.
[2022-06-09 10:46:40] [INFO ] Flatten gal took : 85 ms
[2022-06-09 10:46:40] [INFO ] Applying decomposition
[2022-06-09 10:46:40] [INFO ] Flatten gal took : 78 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/graph16946208480294956428.txt, -o, /tmp/graph16946208480294956428.bin, -w, /tmp/graph16946208480294956428.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/graph16946208480294956428.bin, -l, -1, -v, -w, /tmp/graph16946208480294956428.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:46:40] [INFO ] Decomposing Gal with order
[2022-06-09 10:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:46:41] [INFO ] Removed a total of 3137 redundant transitions.
[2022-06-09 10:46:41] [INFO ] Flatten gal took : 293 ms
[2022-06-09 10:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1603 labels/synchronizations in 142 ms.
[2022-06-09 10:46:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6321057673778782895.gal : 18 ms
[2022-06-09 10:46:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10990291231473578076.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/ReachabilityCardinality6321057673778782895.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10990291231473578076.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6321057673778782895.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10990291231473578076.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10990291231473578076.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14497728591359748425
[2022-06-09 10:46:56] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14497728591359748425
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/ltsmin14497728591359748425]
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/ltsmin14497728591359748425] 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/ltsmin14497728591359748425] 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 1000050 steps, including 2 resets, run finished after 1435 ms. (steps per millisecond=696 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2414 ms. (steps per millisecond=414 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3105 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2544 ms. (steps per millisecond=393 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2561 ms. (steps per millisecond=390 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 3558399 steps, run timeout after 30098 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 3558399 steps, saw 2325765 distinct states, run finished after 30099 ms. (steps per millisecond=118 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-09 10:47:39] [INFO ] Flow matrix only has 1307 transitions (discarded 637 similar events)
// Phase 1: matrix 1307 rows 758 cols
[2022-06-09 10:47:39] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 10:47:39] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:47:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 10:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:47:40] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-06-09 10:47:40] [INFO ] State equation strengthened by 843 read => feed constraints.
[2022-06-09 10:47:40] [INFO ] [Real]Added 843 Read/Feed constraints in 471 ms returned sat
[2022-06-09 10:47:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:47:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:47:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:47:41] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-06-09 10:47:41] [INFO ] [Nat]Added 843 Read/Feed constraints in 423 ms returned sat
[2022-06-09 10:47:41] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2022-06-09 10:47:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-06-09 10:47:42] [INFO ] Computed and/alt/rep : 248/314/231 causal constraints (skipped 1074 transitions) in 130 ms.
[2022-06-09 10:47:43] [INFO ] Added : 102 causal constraints over 21 iterations in 1580 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-09 10:47:43] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:47:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:47:43] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2022-06-09 10:47:44] [INFO ] [Real]Added 843 Read/Feed constraints in 399 ms returned sat
[2022-06-09 10:47:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:47:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:47:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2022-06-09 10:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:47:44] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2022-06-09 10:47:45] [INFO ] [Nat]Added 843 Read/Feed constraints in 397 ms returned sat
[2022-06-09 10:47:45] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2022-06-09 10:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2022-06-09 10:47:45] [INFO ] Computed and/alt/rep : 248/314/231 causal constraints (skipped 1074 transitions) in 183 ms.
[2022-06-09 10:47:47] [INFO ] Added : 102 causal constraints over 21 iterations in 1587 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-09 10:47:47] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2022-06-09 10:47:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 10:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:47:47] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-06-09 10:47:48] [INFO ] [Real]Added 843 Read/Feed constraints in 412 ms returned sat
[2022-06-09 10:47:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:47:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:47:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:47:48] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2022-06-09 10:47:48] [INFO ] [Nat]Added 843 Read/Feed constraints in 418 ms returned sat
[2022-06-09 10:47:49] [INFO ] Deduced a trap composed of 131 places in 423 ms of which 3 ms to minimize.
[2022-06-09 10:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2022-06-09 10:47:49] [INFO ] Computed and/alt/rep : 248/314/231 causal constraints (skipped 1074 transitions) in 184 ms.
[2022-06-09 10:47:51] [INFO ] Added : 102 causal constraints over 21 iterations in 1765 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-09 10:47:51] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:47:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:47:51] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2022-06-09 10:47:52] [INFO ] [Real]Added 843 Read/Feed constraints in 413 ms returned sat
[2022-06-09 10:47:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:47:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:47:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:47:52] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2022-06-09 10:47:52] [INFO ] [Nat]Added 843 Read/Feed constraints in 439 ms returned sat
[2022-06-09 10:47:53] [INFO ] Deduced a trap composed of 131 places in 66 ms of which 1 ms to minimize.
[2022-06-09 10:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-06-09 10:47:53] [INFO ] Computed and/alt/rep : 248/314/231 causal constraints (skipped 1074 transitions) in 122 ms.
[2022-06-09 10:47:54] [INFO ] Added : 102 causal constraints over 21 iterations in 1552 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 183100 steps, including 691 resets, run finished after 969 ms. (steps per millisecond=188 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 188100 steps, including 595 resets, run finished after 1038 ms. (steps per millisecond=181 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 182000 steps, including 568 resets, run finished after 968 ms. (steps per millisecond=188 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 180300 steps, including 732 resets, run finished after 868 ms. (steps per millisecond=207 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 24 out of 758 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 758/758 places, 1944/1944 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 1942
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 756 transition count 1940
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 756 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 755 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 755 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 754 transition count 1934
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 754 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 753 transition count 1932
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 753 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 752 transition count 1930
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 752 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 751 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 751 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 750 transition count 1926
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 750 transition count 1926
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 749 transition count 1924
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 749 transition count 1924
Applied a total of 18 rules in 264 ms. Remains 749 /758 variables (removed 9) and now considering 1924/1944 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 749/758 places, 1924/1944 transitions.
[2022-06-09 10:47:58] [INFO ] Flatten gal took : 85 ms
[2022-06-09 10:47:59] [INFO ] Flatten gal took : 149 ms
[2022-06-09 10:47:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1693238380471854152.gal : 8 ms
[2022-06-09 10:47:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9772861677974471964.prop : 2 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/ReachabilityCardinality1693238380471854152.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9772861677974471964.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/ReachabilityCardinality1693238380471854152.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9772861677974471964.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9772861677974471964.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :31 after 1993
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1993 after 1.24037e+06
Detected timeout of ITS tools.
[2022-06-09 10:48:14] [INFO ] Flatten gal took : 60 ms
[2022-06-09 10:48:14] [INFO ] Applying decomposition
[2022-06-09 10:48:14] [INFO ] Flatten gal took : 61 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/graph1303463512497717511.txt, -o, /tmp/graph1303463512497717511.bin, -w, /tmp/graph1303463512497717511.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/graph1303463512497717511.bin, -l, -1, -v, -w, /tmp/graph1303463512497717511.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:48:14] [INFO ] Decomposing Gal with order
[2022-06-09 10:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:48:14] [INFO ] Removed a total of 3182 redundant transitions.
[2022-06-09 10:48:14] [INFO ] Flatten gal took : 135 ms
[2022-06-09 10:48:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1789 labels/synchronizations in 56 ms.
[2022-06-09 10:48:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10950026821710899244.gal : 13 ms
[2022-06-09 10:48:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11191567565149338051.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/ReachabilityCardinality10950026821710899244.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11191567565149338051.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10950026821710899244.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11191567565149338051.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11191567565149338051.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8759702667648727445
[2022-06-09 10:48:29] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8759702667648727445
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/ltsmin8759702667648727445]
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/ltsmin8759702667648727445] 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/ltsmin8759702667648727445] 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 1000043 steps, including 2 resets, run finished after 1461 ms. (steps per millisecond=684 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2118 ms. (steps per millisecond=472 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3132 ms. (steps per millisecond=319 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2633 ms. (steps per millisecond=379 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 3678189 steps, run timeout after 30001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 3678189 steps, saw 2403902 distinct states, run finished after 30007 ms. (steps per millisecond=122 ) properties seen :{}
Running SMT prover for 3 properties.
[2022-06-09 10:49:10] [INFO ] Flow matrix only has 1293 transitions (discarded 631 similar events)
// Phase 1: matrix 1293 rows 749 cols
[2022-06-09 10:49:10] [INFO ] Computed 2 place invariants in 19 ms
[2022-06-09 10:49:10] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:49:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:10] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-06-09 10:49:10] [INFO ] State equation strengthened by 833 read => feed constraints.
[2022-06-09 10:49:11] [INFO ] [Real]Added 833 Read/Feed constraints in 398 ms returned sat
[2022-06-09 10:49:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:49:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:49:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:11] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2022-06-09 10:49:12] [INFO ] [Nat]Added 833 Read/Feed constraints in 469 ms returned sat
[2022-06-09 10:49:12] [INFO ] Deduced a trap composed of 131 places in 72 ms of which 0 ms to minimize.
[2022-06-09 10:49:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-06-09 10:49:12] [INFO ] Computed and/alt/rep : 246/312/229 causal constraints (skipped 1062 transitions) in 127 ms.
[2022-06-09 10:49:13] [INFO ] Added : 100 causal constraints over 20 iterations in 1508 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-09 10:49:13] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:49:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 9 ms returned sat
[2022-06-09 10:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:14] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2022-06-09 10:49:14] [INFO ] [Real]Added 833 Read/Feed constraints in 408 ms returned sat
[2022-06-09 10:49:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:49:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:49:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:15] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-06-09 10:49:15] [INFO ] [Nat]Added 833 Read/Feed constraints in 471 ms returned sat
[2022-06-09 10:49:15] [INFO ] Deduced a trap composed of 131 places in 64 ms of which 1 ms to minimize.
[2022-06-09 10:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-06-09 10:49:15] [INFO ] Computed and/alt/rep : 246/312/229 causal constraints (skipped 1062 transitions) in 134 ms.
[2022-06-09 10:49:17] [INFO ] Added : 100 causal constraints over 20 iterations in 1504 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-09 10:49:17] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:49:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:17] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-06-09 10:49:18] [INFO ] [Real]Added 833 Read/Feed constraints in 422 ms returned sat
[2022-06-09 10:49:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:49:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:49:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:18] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-06-09 10:49:18] [INFO ] [Nat]Added 833 Read/Feed constraints in 448 ms returned sat
[2022-06-09 10:49:18] [INFO ] Deduced a trap composed of 131 places in 60 ms of which 1 ms to minimize.
[2022-06-09 10:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-06-09 10:49:19] [INFO ] Computed and/alt/rep : 246/312/229 causal constraints (skipped 1062 transitions) in 142 ms.
[2022-06-09 10:49:20] [INFO ] Added : 100 causal constraints over 20 iterations in 1502 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 179400 steps, including 672 resets, run finished after 1025 ms. (steps per millisecond=175 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 179300 steps, including 496 resets, run finished after 1034 ms. (steps per millisecond=173 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 179500 steps, including 527 resets, run finished after 1082 ms. (steps per millisecond=165 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 24 out of 749 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 749/749 places, 1924/1924 transitions.
Applied a total of 0 rules in 121 ms. Remains 749 /749 variables (removed 0) and now considering 1924/1924 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 749/749 places, 1924/1924 transitions.
Starting structural reductions, iteration 0 : 749/749 places, 1924/1924 transitions.
Applied a total of 0 rules in 121 ms. Remains 749 /749 variables (removed 0) and now considering 1924/1924 (removed 0) transitions.
[2022-06-09 10:49:24] [INFO ] Flow matrix only has 1293 transitions (discarded 631 similar events)
// Phase 1: matrix 1293 rows 749 cols
[2022-06-09 10:49:24] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 10:49:24] [INFO ] Implicit Places using invariants in 386 ms returned []
[2022-06-09 10:49:24] [INFO ] Flow matrix only has 1293 transitions (discarded 631 similar events)
// Phase 1: matrix 1293 rows 749 cols
[2022-06-09 10:49:24] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 10:49:24] [INFO ] State equation strengthened by 833 read => feed constraints.
[2022-06-09 10:49:25] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2022-06-09 10:49:25] [INFO ] Redundant transitions in 145 ms returned []
[2022-06-09 10:49:25] [INFO ] Flow matrix only has 1293 transitions (discarded 631 similar events)
// Phase 1: matrix 1293 rows 749 cols
[2022-06-09 10:49:25] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 10:49:26] [INFO ] Dead Transitions using invariants and state equation in 699 ms returned []
Finished structural reductions, in 1 iterations. Remains : 749/749 places, 1924/1924 transitions.
Incomplete random walk after 100002 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-06-09 10:49:26] [INFO ] Flow matrix only has 1293 transitions (discarded 631 similar events)
// Phase 1: matrix 1293 rows 749 cols
[2022-06-09 10:49:26] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 10:49:26] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:49:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:26] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2022-06-09 10:49:27] [INFO ] State equation strengthened by 833 read => feed constraints.
[2022-06-09 10:49:27] [INFO ] [Real]Added 833 Read/Feed constraints in 422 ms returned sat
[2022-06-09 10:49:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:49:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:49:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:49:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:27] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2022-06-09 10:49:28] [INFO ] [Nat]Added 833 Read/Feed constraints in 479 ms returned sat
[2022-06-09 10:49:28] [INFO ] Deduced a trap composed of 131 places in 66 ms of which 1 ms to minimize.
[2022-06-09 10:49:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-06-09 10:49:28] [INFO ] Computed and/alt/rep : 246/312/229 causal constraints (skipped 1062 transitions) in 202 ms.
[2022-06-09 10:49:30] [INFO ] Added : 100 causal constraints over 20 iterations in 1700 ms. Result :sat
[2022-06-09 10:49:30] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:49:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:30] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2022-06-09 10:49:30] [INFO ] [Real]Added 833 Read/Feed constraints in 412 ms returned sat
[2022-06-09 10:49:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:49:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:49:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:31] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2022-06-09 10:49:31] [INFO ] [Nat]Added 833 Read/Feed constraints in 461 ms returned sat
[2022-06-09 10:49:31] [INFO ] Deduced a trap composed of 131 places in 65 ms of which 0 ms to minimize.
[2022-06-09 10:49:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-06-09 10:49:32] [INFO ] Computed and/alt/rep : 246/312/229 causal constraints (skipped 1062 transitions) in 136 ms.
[2022-06-09 10:49:33] [INFO ] Added : 100 causal constraints over 20 iterations in 1522 ms. Result :sat
[2022-06-09 10:49:33] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:49:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:33] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2022-06-09 10:49:34] [INFO ] [Real]Added 833 Read/Feed constraints in 416 ms returned sat
[2022-06-09 10:49:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:49:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:49:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 10:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:49:34] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-06-09 10:49:35] [INFO ] [Nat]Added 833 Read/Feed constraints in 432 ms returned sat
[2022-06-09 10:49:35] [INFO ] Deduced a trap composed of 131 places in 58 ms of which 0 ms to minimize.
[2022-06-09 10:49:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-06-09 10:49:35] [INFO ] Computed and/alt/rep : 246/312/229 causal constraints (skipped 1062 transitions) in 129 ms.
[2022-06-09 10:49:36] [INFO ] Added : 100 causal constraints over 20 iterations in 1482 ms. Result :sat
[2022-06-09 10:49:36] [INFO ] Flatten gal took : 53 ms
[2022-06-09 10:49:36] [INFO ] Flatten gal took : 54 ms
[2022-06-09 10:49:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3148495062532673074.gal : 9 ms
[2022-06-09 10:49:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9202467848179939042.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/ReachabilityCardinality3148495062532673074.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9202467848179939042.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/ReachabilityCardinality3148495062532673074.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9202467848179939042.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9202467848179939042.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :31 after 1993
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1993 after 1.24037e+06
Detected timeout of ITS tools.
[2022-06-09 10:49:52] [INFO ] Flatten gal took : 56 ms
[2022-06-09 10:49:52] [INFO ] Applying decomposition
[2022-06-09 10:49:52] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17664463409094411306.txt, -o, /tmp/graph17664463409094411306.bin, -w, /tmp/graph17664463409094411306.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/graph17664463409094411306.bin, -l, -1, -v, -w, /tmp/graph17664463409094411306.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:49:52] [INFO ] Decomposing Gal with order
[2022-06-09 10:49:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:49:52] [INFO ] Removed a total of 3230 redundant transitions.
[2022-06-09 10:49:52] [INFO ] Flatten gal took : 112 ms
[2022-06-09 10:49:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 56 ms.
[2022-06-09 10:49:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18329751916119847668.gal : 11 ms
[2022-06-09 10:49:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10909039867030994500.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/ReachabilityCardinality18329751916119847668.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10909039867030994500.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality18329751916119847668.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10909039867030994500.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10909039867030994500.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1968581992011323640
[2022-06-09 10:50:07] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1968581992011323640
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/ltsmin1968581992011323640]
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/ltsmin1968581992011323640] 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/ltsmin1968581992011323640] 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)
Graph (trivial) has 1128 edges and 749 vertex of which 189 / 749 are part of one of the 63 SCC in 11 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 820 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 623 transition count 1086
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 605 transition count 1086
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 37 place count 605 transition count 965
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 279 place count 484 transition count 965
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 341 place count 422 transition count 903
Iterating global reduction 2 with 62 rules applied. Total rules applied 403 place count 422 transition count 903
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 527 place count 422 transition count 779
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 793 place count 289 transition count 646
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 856 place count 226 transition count 520
Iterating global reduction 3 with 63 rules applied. Total rules applied 919 place count 226 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 920 place count 226 transition count 519
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 979 place count 167 transition count 401
Iterating global reduction 4 with 59 rules applied. Total rules applied 1038 place count 167 transition count 401
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 1096 place count 109 transition count 285
Iterating global reduction 4 with 58 rules applied. Total rules applied 1154 place count 109 transition count 285
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 1211 place count 109 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1213 place count 108 transition count 227
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1243 place count 93 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1245 place count 93 transition count 239
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 1269 place count 93 transition count 215
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1270 place count 92 transition count 214
Iterating global reduction 6 with 1 rules applied. Total rules applied 1271 place count 92 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1275 place count 92 transition count 210
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1277 place count 92 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1279 place count 90 transition count 208
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1280 place count 90 transition count 207
Applied a total of 1280 rules in 209 ms. Remains 90 /749 variables (removed 659) and now considering 207/1924 (removed 1717) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 207 rows 90 cols
[2022-06-09 10:50:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:50:08] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 10:50:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:50:08] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 10:50:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:50:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 10:50:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:50:08] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-06-09 10:50:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-09 10:50:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-09 10:50:08] [INFO ] Computed and/alt/rep : 66/140/66 causal constraints (skipped 112 transitions) in 25 ms.
[2022-06-09 10:50:09] [INFO ] Added : 11 causal constraints over 3 iterations in 84 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-09 10:50:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 10:50:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:50:09] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-06-09 10:50:09] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-09 10:50:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:50:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2022-06-09 10:50:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 19 ms returned sat
[2022-06-09 10:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:50:10] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2022-06-09 10:50:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 37 ms returned sat
[2022-06-09 10:50:10] [INFO ] Computed and/alt/rep : 66/140/66 causal constraints (skipped 112 transitions) in 10 ms.
[2022-06-09 10:50:10] [INFO ] Added : 14 causal constraints over 4 iterations in 65 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-09 10:50:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 10:50:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:50:10] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-06-09 10:50:10] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-09 10:50:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:50:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 10:50:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:50:10] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-09 10:50:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-06-09 10:50:10] [INFO ] Computed and/alt/rep : 66/140/66 causal constraints (skipped 112 transitions) in 11 ms.
[2022-06-09 10:50:10] [INFO ] Added : 15 causal constraints over 4 iterations in 60 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-09 10:50:10] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17082643868623958114
[2022-06-09 10:50:10] [INFO ] Too many transitions (1924) to apply POR reductions. Disabling POR matrices.
[2022-06-09 10:50:10] [INFO ] Applying decomposition
[2022-06-09 10:50:10] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17082643868623958114
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/ltsmin17082643868623958114]
[2022-06-09 10:50:10] [INFO ] Flatten gal took : 264 ms
[2022-06-09 10:50:10] [INFO ] Flatten gal took : 264 ms
[2022-06-09 10:50:10] [INFO ] Input system was already deterministic with 1924 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11166183672318727897.txt, -o, /tmp/graph11166183672318727897.bin, -w, /tmp/graph11166183672318727897.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/graph11166183672318727897.bin, -l, -1, -v, -w, /tmp/graph11166183672318727897.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:50:11] [INFO ] Decomposing Gal with order
[2022-06-09 10:50:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:50:11] [INFO ] Removed a total of 3111 redundant transitions.
[2022-06-09 10:50:11] [INFO ] Flatten gal took : 280 ms
[2022-06-09 10:50:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1690 labels/synchronizations in 170 ms.
[2022-06-09 10:50:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16033146622190713065.gal : 34 ms
[2022-06-09 10:50:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9475159366122721425.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/ReachabilityFireability16033146622190713065.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability9475159366122721425.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability16033146622190713065.gal -t CGAL -reachable-file /tmp/ReachabilityFireability9475159366122721425.prop --nowitness
Loading property file /tmp/ReachabilityFireability9475159366122721425.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 6
[2022-06-09 10:50:13] [INFO ] Ran tautology test, simplified 0 / 3 in 2701 ms.
[2022-06-09 10:50:13] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(UNSAT) depth K=0 took 21 ms
[2022-06-09 10:50:13] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(UNSAT) depth K=0 took 4 ms
[2022-06-09 10:50:13] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(UNSAT) depth K=0 took 28 ms
[2022-06-09 10:50:13] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(UNSAT) depth K=1 took 20 ms
[2022-06-09 10:50:13] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(UNSAT) depth K=1 took 5 ms
[2022-06-09 10:50:13] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(UNSAT) depth K=1 took 2 ms
[2022-06-09 10:50:14] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(UNSAT) depth K=2 took 428 ms
[2022-06-09 10:50:14] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(UNSAT) depth K=2 took 216 ms
[2022-06-09 10:50:14] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(UNSAT) depth K=2 took 483 ms
[2022-06-09 10:50:15] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(UNSAT) depth K=3 took 559 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1293 out of 1924 initially.
// Phase 1: matrix 1293 rows 749 cols
[2022-06-09 10:50:16] [INFO ] Computed 2 place invariants in 10 ms
inv : l0 + l64 + l128 + l160 + l192 + l208 + l224 + l240 + l256 + l264 + l272 + l280 + l288 + l296 + l304 + l312 + l320 + l324 + l328 + l332 + l336 + l340 + l344 + l348 + l352 + l356 + l360 + l364 + l368 + l372 + l376 + l380 + l384 + l386 + l388 + l390 + l392 + l394 + l396 + l398 + l400 + l402 + l404 + l406 + l408 + l410 + l412 + l414 + l416 + l418 + l420 + l422 + l424 + l426 + l428 + l430 + l432 + l434 + l436 + l438 + l440 + l442 + l444 + l446 + l448 + l449 + l450 + l451 + l452 + l453 + l454 + l455 + l456 + l457 + l458 + l459 + l460 + l461 + l462 + l463 + l464 + l465 + l466 + l467 + l468 + l469 + l470 + l471 + l472 + l473 + l474 + l475 + l476 + l477 + l478 + l479 + l480 + l481 + l482 + l483 + l484 + l485 + l486 + l487 + l488 + l489 + l490 + l491 + l492 + l493 + l494 + l495 + l496 + l497 + l498 + l499 + l500 + l501 + l502 + l503 + l504 + l505 + l506 + l507 + l508 + l509 + l510 + l511 + l512 + l513 + l514 + l515 + l516 + l517 + l518 + l519 + l520 + l521 + l522 + l523 + l524 + l525 + l526 + l527 + l528 + l529 + l530 + l531 + l532 + l533 + l534 + l535 + l536 + l537 + l538 + l539 + l540 + l541 + l542 + l543 + l544 + l545 + l546 + l547 + l548 + l549 + l550 + l551 + l552 + l553 + l554 + l555 + l556 + l557 + l558 + l559 + l560 + l561 + l562 + l563 + l564 + l565 + l566 + l567 + l568 + l569 + l570 + l571 + l572 + l573 + l574 + l575 + l896 + l897 + l898 + l899 + l900 + l901 + l902 + l903 + l904 + l905 + l906 + l907 + l908 + l909 + l910 + l911 + l912 + l913 + l914 + l915 + l916 + l917 + l918 + l919 + l920 + l921 + l922 + l923 + l924 + l925 + l926 + l927 + l928 + l929 + l930 + l931 + l932 + l933 + l934 + l935 + l936 + l937 + l938 + l939 + l940 + l941 + l942 + l943 + l944 + l945 + l946 + l947 + l948 + l949 + l950 + l951 + l952 + l953 + l954 + l955 + l956 + l957 + l958 + l959 + l960 + l961 + l962 + l963 + l964 + l965 + l966 + l967 + l968 + l969 + l970 + l971 + l972 + l973 + l974 + l975 + l976 + l977 + l978 + l979 + l980 + l981 + l982 + l983 + l984 + l985 + l986 + l987 + l988 + l989 + l990 + l991 + l992 + l993 + l994 + l995 + l996 + l997 + l998 + l999 + p1009 + l1001 + l1002 + l1003 + l1004 + l1005 + l1006 + l1007 + l1008 + l1009 + p1019 + l1011 + l1012 + l1013 + l1014 + l1015 + l1016 + l1017 + l1018 + l1019 + p1029 + l1021 + l1022 + l1023 + l2624 + l2625 + l2626 + l2627 + l2628 + l2629 + p2639 + l2631 + l2632 + l2633 + l2634 + l2635 + l2636 + l2637 + l2638 + l2639 + p2649 + l2641 + l2642 + l2643 + l2644 + l2645 + l2646 + l2647 + l2648 + l2649 + p2659 + l2651 + l2652 + l2653 + l2654 + l2655 + l2656 + l2657 + l2658 + l2659 + p2669 + l2661 + l2662 + l2663 + l2664 + l2665 + l2666 + l2667 + l2668 + l2669 + p2679 + l2671 + l2672 + l2673 + l2674 + l2675 + l2676 + l2677 + l2678 + l2679 + p2689 + l2681 + l2682 + l2683 + l2684 + l2685 + l2686 + l2687 = 64
inv : s4 + s5 - p1289 - l1281 - l1288 - l1289 - p1299 - l1292 - l1294 - l1296 - l1297 - l1309 - l1316 - p1329 - l1321 - l1328 - l1335 - l1336 - l1337 - l1344 - l1345 - l1352 - l1353 - l1354 - l1356 - l1358 - p1369 - l1361 - l1373 - p1389 - l1384 - l1385 - l1392 - l1399 - p1409 - l1401 - l2439 - l2503 = 0
Total of 2 invariants.
[2022-06-09 10:50:16] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 10:50:17] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(UNSAT) depth K=3 took 1867 ms
[2022-06-09 10:50:19] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(UNSAT) depth K=3 took 2180 ms
[2022-06-09 10:50:21] [INFO ] Proved 749 variables to be positive in 5285 ms
[2022-06-09 10:50:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-01
[2022-06-09 10:50:21] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(SAT) depth K=0 took 70 ms
[2022-06-09 10:50:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-06
[2022-06-09 10:50:22] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(SAT) depth K=0 took 65 ms
[2022-06-09 10:50:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-08
[2022-06-09 10:50:22] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(SAT) depth K=0 took 52 ms
[2022-06-09 10:50:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-01
[2022-06-09 10:50:24] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(SAT) depth K=1 took 2009 ms
[2022-06-09 10:50:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-06
[2022-06-09 10:50:26] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(SAT) depth K=1 took 2686 ms
[2022-06-09 10:50:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-08
[2022-06-09 10:50:27] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(SAT) depth K=1 took 840 ms
Compilation finished in 20546 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17082643868623958114]
[2022-06-09 10:50:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-01
[2022-06-09 10:50:31] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(SAT) depth K=2 took 3513 ms
Link finished in 133 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, FunctionPointerPTc064ReachabilityFireability01==true], workingDir=/tmp/ltsmin17082643868623958114]
[2022-06-09 10:51:23] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(UNSAT) depth K=4 took 63752 ms
[2022-06-09 10:51:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-06
[2022-06-09 10:51:54] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(SAT) depth K=2 took 83095 ms
[2022-06-09 10:52:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-08
[2022-06-09 10:52:23] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(SAT) depth K=2 took 29085 ms
[2022-06-09 10:54:08] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(UNSAT) depth K=4 took 165295 ms
[2022-06-09 10:56:13] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(UNSAT) depth K=4 took 124905 ms
[2022-06-09 11:10:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-01
[2022-06-09 11:10:12] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(SAT) depth K=3 took 1069090 ms
WARNING : LTSmin timed out (>1200 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, FunctionPointerPTc064ReachabilityFireability01==true], workingDir=/tmp/ltsmin17082643868623958114]
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, FunctionPointerPTc064ReachabilityFireability06==true], workingDir=/tmp/ltsmin17082643868623958114]
[2022-06-09 11:10:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-06
[2022-06-09 11:10:42] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(SAT) depth K=3 took 29496 ms
[2022-06-09 11:11:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-c064-ReachabilityFireability-08
[2022-06-09 11:11:10] [INFO ] KInduction solution for property FunctionPointer-PT-c064-ReachabilityFireability-08(SAT) depth K=3 took 28951 ms
Detected timeout of ITS tools.
[2022-06-09 11:12:14] [INFO ] Applying decomposition
[2022-06-09 11:12:14] [INFO ] Flatten gal took : 141 ms
[2022-06-09 11:12:14] [INFO ] Decomposing Gal with order
[2022-06-09 11:12:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 11:12:15] [INFO ] Removed a total of 3230 redundant transitions.
[2022-06-09 11:12:15] [INFO ] Flatten gal took : 341 ms
[2022-06-09 11:12:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 146 ms.
[2022-06-09 11:12:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13687718635068599527.gal : 24 ms
[2022-06-09 11:12:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1302399023491225393.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/ReachabilityFireability13687718635068599527.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability1302399023491225393.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability13687718635068599527.gal -t CGAL -reachable-file /tmp/ReachabilityFireability1302399023491225393.prop --nowitness
Loading property file /tmp/ReachabilityFireability1302399023491225393.prop.
[2022-06-09 11:13:17] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-01(UNSAT) depth K=5 took 1023977 ms
[2022-06-09 11:28:21] [INFO ] BMC solution for property FunctionPointer-PT-c064-ReachabilityFireability-06(UNSAT) depth K=5 took 904316 ms
WARNING : LTSmin timed out (>1200 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, FunctionPointerPTc064ReachabilityFireability06==true], workingDir=/tmp/ltsmin17082643868623958114]
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, FunctionPointerPTc064ReachabilityFireability08==true], workingDir=/tmp/ltsmin17082643868623958114]
Detected timeout of ITS tools.
[2022-06-09 11:34:17] [INFO ] Flatten gal took : 172 ms
[2022-06-09 11:34:18] [INFO ] Input system was already deterministic with 1924 transitions.
[2022-06-09 11:34:18] [INFO ] Transformed 749 places.
[2022-06-09 11:34:18] [INFO ] Transformed 1924 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 11:34:18] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10473517569140966879.gal : 10 ms
[2022-06-09 11:34:18] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2658348832231073333.prop : 25 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/ReachabilityFireability10473517569140966879.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability2658348832231073333.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/ReachabilityFireability10473517569140966879.gal -t CGAL -reachable-file /tmp/ReachabilityFireability2658348832231073333.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/ReachabilityFireability2658348832231073333.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 30
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :30 after 1866
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1866 after 981629
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :981629 after 1.86116e+10
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.86116e+10 after 9.71026e+16
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c064"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is FunctionPointer-PT-c064, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472292800195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c064.tgz
mv FunctionPointer-PT-c064 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;