About the Execution of 2021-gold for FunctionPointer-PT-c032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3261.115 | 642766.00 | 771278.00 | 1701.80 | FFTTTTTFTTTFTFFF | 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-165472292800192.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-c032, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292800192
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Jun 7 17:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 7 17:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Jun 7 17:29 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-c032-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654770562005
Running Version 0
[2022-06-09 10:29:23] [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:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:29:24] [INFO ] Load time of PNML (sax parser for PT used): 382 ms
[2022-06-09 10:29:24] [INFO ] Transformed 2826 places.
[2022-06-09 10:29:24] [INFO ] Transformed 8960 transitions.
[2022-06-09 10:29:24] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 473 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 34 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :1
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) 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 11) seen :0
Interrupted probabilistic random walk after 1454704 steps, run timeout after 30001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 1454704 steps, saw 1187766 distinct states, run finished after 30007 ms. (steps per millisecond=48 ) properties seen :{}
Running SMT prover for 11 properties.
[2022-06-09 10:29:54] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 10:29:54] [INFO ] Computed 4 place invariants in 98 ms
[2022-06-09 10:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned sat
[2022-06-09 10:29:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 10:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:29:56] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2022-06-09 10:29:56] [INFO ] State equation strengthened by 2822 read => feed constraints.
[2022-06-09 10:29:58] [INFO ] [Real]Added 2822 Read/Feed constraints in 2117 ms returned sat
[2022-06-09 10:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:29:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2022-06-09 10:29:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:29:59] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2022-06-09 10:30:01] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2022 ms returned sat
[2022-06-09 10:30:02] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 898 ms.
[2022-06-09 10:30: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 0
[2022-06-09 10:30:04] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:30:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:04] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2022-06-09 10:30:07] [INFO ] [Real]Added 2822 Read/Feed constraints in 2132 ms returned sat
[2022-06-09 10:30:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:30:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:30:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:08] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2022-06-09 10:30:10] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2108 ms returned sat
[2022-06-09 10:30:10] [INFO ] Deduced a trap composed of 131 places in 229 ms of which 3 ms to minimize.
[2022-06-09 10:30:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2022-06-09 10:30:11] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 526 ms.
[2022-06-09 10:30:13] [INFO ] Deduced a trap composed of 17 places in 1233 ms of which 6 ms to minimize.
[2022-06-09 10:30:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-09 10:30:13] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:30:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:14] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2022-06-09 10:30:16] [INFO ] [Real]Added 2822 Read/Feed constraints in 2062 ms returned sat
[2022-06-09 10:30:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:30:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:30:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:17] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2022-06-09 10:30:20] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2117 ms returned sat
[2022-06-09 10:30:20] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 2 ms to minimize.
[2022-06-09 10:30:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2022-06-09 10:30:20] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 534 ms.
[2022-06-09 10:30:23] [INFO ] Deduced a trap composed of 17 places in 1216 ms of which 3 ms to minimize.
[2022-06-09 10:30:23] [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:30:23] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:30:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:24] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2022-06-09 10:30:26] [INFO ] [Real]Added 2822 Read/Feed constraints in 2060 ms returned sat
[2022-06-09 10:30:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:30:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:30:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:27] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2022-06-09 10:30:29] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2179 ms returned sat
[2022-06-09 10:30:29] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 1 ms to minimize.
[2022-06-09 10:30:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2022-06-09 10:30:30] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 680 ms.
[2022-06-09 10:30:32] [INFO ] Deduced a trap composed of 17 places in 1183 ms of which 7 ms to minimize.
[2022-06-09 10:30:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-09 10:30:32] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:30:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:33] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2022-06-09 10:30:35] [INFO ] [Real]Added 2822 Read/Feed constraints in 2000 ms returned sat
[2022-06-09 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:30:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:30:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:36] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2022-06-09 10:30:38] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2169 ms returned sat
[2022-06-09 10:30:39] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 1 ms to minimize.
[2022-06-09 10:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2022-06-09 10:30:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 506 ms.
[2022-06-09 10:30:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-09 10:30:41] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:30:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:41] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2022-06-09 10:30:44] [INFO ] [Real]Added 2822 Read/Feed constraints in 2157 ms returned sat
[2022-06-09 10:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:30:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:30:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:45] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2022-06-09 10:30:47] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2162 ms returned sat
[2022-06-09 10:30:47] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 1 ms to minimize.
[2022-06-09 10:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2022-06-09 10:30:48] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 473 ms.
[2022-06-09 10:30:50] [INFO ] Deduced a trap composed of 17 places in 1188 ms of which 2 ms to minimize.
[2022-06-09 10:30:50] [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:30:50] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:30:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:51] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2022-06-09 10:30:53] [INFO ] [Real]Added 2822 Read/Feed constraints in 2077 ms returned sat
[2022-06-09 10:30:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:30:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:30:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:30:54] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2022-06-09 10:30:56] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2075 ms returned sat
[2022-06-09 10:30:57] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 1 ms to minimize.
[2022-06-09 10:30:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2022-06-09 10:30:57] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 497 ms.
[2022-06-09 10:31:00] [INFO ] Deduced a trap composed of 17 places in 1224 ms of which 7 ms to minimize.
[2022-06-09 10:31:00] [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:31:00] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:31:00] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:31:01] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2022-06-09 10:31:03] [INFO ] [Real]Added 2822 Read/Feed constraints in 2095 ms returned sat
[2022-06-09 10:31:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:31:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2022-06-09 10:31:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:31:04] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2022-06-09 10:31:06] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2210 ms returned sat
[2022-06-09 10:31:07] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 440 ms.
[2022-06-09 10:31:08] [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:31:08] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:31:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:31:09] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2022-06-09 10:31:11] [INFO ] [Real]Added 2822 Read/Feed constraints in 2067 ms returned sat
[2022-06-09 10:31:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:31:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:31:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:31:12] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2022-06-09 10:31:15] [INFO ] [Nat]Added 2822 Read/Feed constraints in 3265 ms returned sat
[2022-06-09 10:31:16] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 453 ms.
[2022-06-09 10:31:17] [INFO ] Deduced a trap composed of 17 places in 1160 ms of which 1 ms to minimize.
[2022-06-09 10:31:17] [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
[2022-06-09 10:31:18] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:31:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:31:18] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2022-06-09 10:31:21] [INFO ] [Real]Added 2822 Read/Feed constraints in 2087 ms returned sat
[2022-06-09 10:31:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:31:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:31:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:31:22] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2022-06-09 10:31:24] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2084 ms returned sat
[2022-06-09 10:31:24] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 1 ms to minimize.
[2022-06-09 10:31:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2022-06-09 10:31:25] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 439 ms.
[2022-06-09 10:31:26] [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: Broken pipe ... while checking expression at index 9
[2022-06-09 10:31:26] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned unsat
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Support contains 31 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.17 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 288 place count 1324 transition count 3876
Iterating global reduction 0 with 287 rules applied. Total rules applied 575 place count 1324 transition count 3876
Ensure Unique test removed 476 transitions
Reduce isomorphic transitions removed 476 transitions.
Iterating post reduction 0 with 476 rules applied. Total rules applied 1051 place count 1324 transition count 3400
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 1195 place count 1180 transition count 3112
Iterating global reduction 1 with 144 rules applied. Total rules applied 1339 place count 1180 transition count 3112
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 1455 place count 1180 transition count 2996
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1469 place count 1166 transition count 2968
Iterating global reduction 2 with 14 rules applied. Total rules applied 1483 place count 1166 transition count 2968
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1497 place count 1152 transition count 2940
Iterating global reduction 2 with 14 rules applied. Total rules applied 1511 place count 1152 transition count 2940
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1525 place count 1138 transition count 2912
Iterating global reduction 2 with 14 rules applied. Total rules applied 1539 place count 1138 transition count 2912
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1553 place count 1124 transition count 2884
Iterating global reduction 2 with 14 rules applied. Total rules applied 1567 place count 1124 transition count 2884
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1581 place count 1110 transition count 2856
Iterating global reduction 2 with 14 rules applied. Total rules applied 1595 place count 1110 transition count 2856
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1609 place count 1096 transition count 2828
Iterating global reduction 2 with 14 rules applied. Total rules applied 1623 place count 1096 transition count 2828
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1635 place count 1084 transition count 2804
Iterating global reduction 2 with 12 rules applied. Total rules applied 1647 place count 1084 transition count 2804
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1695 place count 1036 transition count 2622
Iterating global reduction 2 with 48 rules applied. Total rules applied 1743 place count 1036 transition count 2622
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1789 place count 990 transition count 2438
Iterating global reduction 2 with 46 rules applied. Total rules applied 1835 place count 990 transition count 2438
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1881 place count 944 transition count 2336
Iterating global reduction 2 with 46 rules applied. Total rules applied 1927 place count 944 transition count 2336
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1973 place count 898 transition count 2244
Iterating global reduction 2 with 46 rules applied. Total rules applied 2019 place count 898 transition count 2244
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 2065 place count 852 transition count 2152
Iterating global reduction 2 with 46 rules applied. Total rules applied 2111 place count 852 transition count 2152
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 2157 place count 806 transition count 2060
Iterating global reduction 2 with 46 rules applied. Total rules applied 2203 place count 806 transition count 2060
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 2247 place count 762 transition count 1972
Iterating global reduction 2 with 44 rules applied. Total rules applied 2291 place count 762 transition count 1972
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2296 place count 757 transition count 1962
Iterating global reduction 2 with 5 rules applied. Total rules applied 2301 place count 757 transition count 1962
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 2 with 36 rules applied. Total rules applied 2337 place count 757 transition count 1926
Applied a total of 2337 rules in 1628 ms. Remains 757 /1628 variables (removed 871) and now considering 1926/5962 (removed 4036) transitions.
Finished structural reductions, in 1 iterations. Remains : 757/1628 places, 1926/5962 transitions.
[2022-06-09 10:31:28] [INFO ] Flatten gal took : 183 ms
[2022-06-09 10:31:28] [INFO ] Flatten gal took : 107 ms
[2022-06-09 10:31:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2825321809145896038.gal : 34 ms
[2022-06-09 10:31:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14059770395825538239.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/ReachabilityCardinality2825321809145896038.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14059770395825538239.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/ReachabilityCardinality2825321809145896038.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14059770395825538239.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14059770395825538239.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :31 after 1993
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1993 after 1.24037e+06
Detected timeout of ITS tools.
[2022-06-09 10:31:43] [INFO ] Flatten gal took : 107 ms
[2022-06-09 10:31:43] [INFO ] Applying decomposition
[2022-06-09 10:31:43] [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/graph3624711241937529029.txt, -o, /tmp/graph3624711241937529029.bin, -w, /tmp/graph3624711241937529029.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/graph3624711241937529029.bin, -l, -1, -v, -w, /tmp/graph3624711241937529029.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:31:44] [INFO ] Decomposing Gal with order
[2022-06-09 10:31:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:31:44] [INFO ] Removed a total of 3170 redundant transitions.
[2022-06-09 10:31:44] [INFO ] Flatten gal took : 367 ms
[2022-06-09 10:31:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1430 labels/synchronizations in 146 ms.
[2022-06-09 10:31:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11287640523543248001.gal : 17 ms
[2022-06-09 10:31:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12467622576684407267.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/ReachabilityCardinality11287640523543248001.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12467622576684407267.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/ReachabilityCardinality11287640523543248001.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12467622576684407267.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12467622576684407267.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10530893554744402064
[2022-06-09 10:32:00] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10530893554744402064
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/ltsmin10530893554744402064]
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/ltsmin10530893554744402064] 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/ltsmin10530893554744402064] 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 1000006 steps, including 2 resets, run finished after 1789 ms. (steps per millisecond=558 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1831 ms. (steps per millisecond=546 ) properties (out of 10) seen :2
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1839 ms. (steps per millisecond=543 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1823 ms. (steps per millisecond=548 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1600 ms. (steps per millisecond=625 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1739 ms. (steps per millisecond=575 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1873 ms. (steps per millisecond=533 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1788 ms. (steps per millisecond=559 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-09 10:32:16] [INFO ] Flow matrix only has 1300 transitions (discarded 626 similar events)
// Phase 1: matrix 1300 rows 757 cols
[2022-06-09 10:32:16] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 10:32:16] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2022-06-09 10:32:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:16] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-06-09 10:32:16] [INFO ] State equation strengthened by 836 read => feed constraints.
[2022-06-09 10:32:17] [INFO ] [Real]Added 836 Read/Feed constraints in 422 ms returned sat
[2022-06-09 10:32:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:32:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:32:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:17] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2022-06-09 10:32:18] [INFO ] [Nat]Added 836 Read/Feed constraints in 614 ms returned sat
[2022-06-09 10:32:18] [INFO ] Deduced a trap composed of 139 places in 101 ms of which 1 ms to minimize.
[2022-06-09 10:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-06-09 10:32:18] [INFO ] Computed and/alt/rep : 240/306/232 causal constraints (skipped 1066 transitions) in 148 ms.
[2022-06-09 10:32:19] [INFO ] Added : 71 causal constraints over 15 iterations in 1245 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-09 10:32:20] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:32:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:20] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-06-09 10:32:20] [INFO ] [Real]Added 836 Read/Feed constraints in 405 ms returned sat
[2022-06-09 10:32:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:32:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:32:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:21] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-06-09 10:32:21] [INFO ] [Nat]Added 836 Read/Feed constraints in 452 ms returned sat
[2022-06-09 10:32:21] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 1 ms to minimize.
[2022-06-09 10:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-06-09 10:32:21] [INFO ] Computed and/alt/rep : 240/306/232 causal constraints (skipped 1066 transitions) in 121 ms.
[2022-06-09 10:32:23] [INFO ] Added : 71 causal constraints over 15 iterations in 1216 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-09 10:32:23] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:32:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:23] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-06-09 10:32:23] [INFO ] [Real]Added 836 Read/Feed constraints in 421 ms returned sat
[2022-06-09 10:32:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:32:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:32:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:24] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2022-06-09 10:32:24] [INFO ] [Nat]Added 836 Read/Feed constraints in 556 ms returned sat
[2022-06-09 10:32:24] [INFO ] Deduced a trap composed of 139 places in 97 ms of which 0 ms to minimize.
[2022-06-09 10:32:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-06-09 10:32:25] [INFO ] Computed and/alt/rep : 240/306/232 causal constraints (skipped 1066 transitions) in 124 ms.
[2022-06-09 10:32:26] [INFO ] Added : 71 causal constraints over 15 iterations in 1170 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-09 10:32:26] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:32:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:26] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-06-09 10:32:27] [INFO ] [Real]Added 836 Read/Feed constraints in 403 ms returned sat
[2022-06-09 10:32:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:32:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:32:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:27] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-06-09 10:32:27] [INFO ] [Nat]Added 836 Read/Feed constraints in 452 ms returned sat
[2022-06-09 10:32:28] [INFO ] Deduced a trap composed of 139 places in 100 ms of which 1 ms to minimize.
[2022-06-09 10:32:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-06-09 10:32:28] [INFO ] Computed and/alt/rep : 240/306/232 causal constraints (skipped 1066 transitions) in 169 ms.
[2022-06-09 10:32:29] [INFO ] Added : 71 causal constraints over 15 iterations in 1174 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-09 10:32:29] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2022-06-09 10:32:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:29] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-06-09 10:32:30] [INFO ] [Real]Added 836 Read/Feed constraints in 425 ms returned sat
[2022-06-09 10:32:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:32:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:32:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 10:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:30] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-06-09 10:32:31] [INFO ] [Nat]Added 836 Read/Feed constraints in 527 ms returned sat
[2022-06-09 10:32:31] [INFO ] Deduced a trap composed of 139 places in 90 ms of which 0 ms to minimize.
[2022-06-09 10:32:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-06-09 10:32:31] [INFO ] Computed and/alt/rep : 240/306/232 causal constraints (skipped 1066 transitions) in 118 ms.
[2022-06-09 10:32:32] [INFO ] Added : 71 causal constraints over 15 iterations in 1150 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-09 10:32:32] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:32:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:32] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-06-09 10:32:33] [INFO ] [Real]Added 836 Read/Feed constraints in 406 ms returned sat
[2022-06-09 10:32:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:32:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:32:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:32:33] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2022-06-09 10:32:34] [INFO ] [Nat]Added 836 Read/Feed constraints in 430 ms returned sat
[2022-06-09 10:32:34] [INFO ] Deduced a trap composed of 139 places in 88 ms of which 0 ms to minimize.
[2022-06-09 10:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-06-09 10:32:34] [INFO ] Computed and/alt/rep : 240/306/232 causal constraints (skipped 1066 transitions) in 174 ms.
[2022-06-09 10:32:35] [INFO ] Added : 71 causal constraints over 15 iterations in 1233 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 131400 steps, including 707 resets, run finished after 660 ms. (steps per millisecond=199 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 133000 steps, including 823 resets, run finished after 592 ms. (steps per millisecond=224 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 132600 steps, including 789 resets, run finished after 619 ms. (steps per millisecond=214 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 132000 steps, including 753 resets, run finished after 604 ms. (steps per millisecond=218 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 133000 steps, including 763 resets, run finished after 594 ms. (steps per millisecond=223 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 131800 steps, including 751 resets, run finished after 630 ms. (steps per millisecond=209 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 7 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 1926/1926 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 743 transition count 1898
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 743 transition count 1898
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 743 transition count 1890
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 48 place count 731 transition count 1864
Iterating global reduction 1 with 12 rules applied. Total rules applied 60 place count 731 transition count 1864
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 719 transition count 1826
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 719 transition count 1826
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 707 transition count 1798
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 707 transition count 1798
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 695 transition count 1774
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 695 transition count 1774
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 683 transition count 1750
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 683 transition count 1750
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 166 place count 673 transition count 1730
Iterating global reduction 1 with 10 rules applied. Total rules applied 176 place count 673 transition count 1730
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 186 place count 663 transition count 1710
Iterating global reduction 1 with 10 rules applied. Total rules applied 196 place count 663 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 205 place count 654 transition count 1692
Iterating global reduction 1 with 9 rules applied. Total rules applied 214 place count 654 transition count 1692
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 216 place count 652 transition count 1688
Iterating global reduction 1 with 2 rules applied. Total rules applied 218 place count 652 transition count 1688
Applied a total of 218 rules in 242 ms. Remains 652 /757 variables (removed 105) and now considering 1688/1926 (removed 238) transitions.
Finished structural reductions, in 1 iterations. Remains : 652/757 places, 1688/1926 transitions.
[2022-06-09 10:32:39] [INFO ] Flatten gal took : 56 ms
[2022-06-09 10:32:39] [INFO ] Flatten gal took : 55 ms
[2022-06-09 10:32:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4035867488423432938.gal : 7 ms
[2022-06-09 10:32:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2369089669500821018.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/ReachabilityCardinality4035867488423432938.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2369089669500821018.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/ReachabilityCardinality4035867488423432938.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2369089669500821018.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2369089669500821018.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :31 after 1971
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1971 after 1.19376e+06
Detected timeout of ITS tools.
[2022-06-09 10:32:54] [INFO ] Flatten gal took : 52 ms
[2022-06-09 10:32:54] [INFO ] Applying decomposition
[2022-06-09 10:32:54] [INFO ] Flatten gal took : 53 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/graph18166943765468262217.txt, -o, /tmp/graph18166943765468262217.bin, -w, /tmp/graph18166943765468262217.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/graph18166943765468262217.bin, -l, -1, -v, -w, /tmp/graph18166943765468262217.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:32:54] [INFO ] Decomposing Gal with order
[2022-06-09 10:32:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:32:55] [INFO ] Removed a total of 2800 redundant transitions.
[2022-06-09 10:32:55] [INFO ] Flatten gal took : 115 ms
[2022-06-09 10:32:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1283 labels/synchronizations in 38 ms.
[2022-06-09 10:32:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality380916614858451004.gal : 8 ms
[2022-06-09 10:32:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15841796991409774573.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/ReachabilityCardinality380916614858451004.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15841796991409774573.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/ReachabilityCardinality380916614858451004.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15841796991409774573.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15841796991409774573.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2609390339665944858
[2022-06-09 10:33:10] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2609390339665944858
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/ltsmin2609390339665944858]
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/ltsmin2609390339665944858] 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/ltsmin2609390339665944858] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1436 ms. (steps per millisecond=696 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1553 ms. (steps per millisecond=643 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1534 ms. (steps per millisecond=651 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1554 ms. (steps per millisecond=643 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1597 ms. (steps per millisecond=626 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1651 ms. (steps per millisecond=605 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 3963628 steps, run timeout after 30001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 3963628 steps, saw 2592157 distinct states, run finished after 30001 ms. (steps per millisecond=132 ) properties seen :{}
Running SMT prover for 5 properties.
[2022-06-09 10:33:50] [INFO ] Flow matrix only has 1129 transitions (discarded 559 similar events)
// Phase 1: matrix 1129 rows 652 cols
[2022-06-09 10:33:50] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 10:33:50] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:33:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:33:50] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2022-06-09 10:33:50] [INFO ] State equation strengthened by 713 read => feed constraints.
[2022-06-09 10:33:51] [INFO ] [Real]Added 713 Read/Feed constraints in 337 ms returned sat
[2022-06-09 10:33:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:33:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:33:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:33:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:33:51] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2022-06-09 10:33:52] [INFO ] [Nat]Added 713 Read/Feed constraints in 447 ms returned sat
[2022-06-09 10:33:52] [INFO ] Deduced a trap composed of 139 places in 102 ms of which 0 ms to minimize.
[2022-06-09 10:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-06-09 10:33:52] [INFO ] Computed and/alt/rep : 220/384/220 causal constraints (skipped 907 transitions) in 103 ms.
[2022-06-09 10:33:53] [INFO ] Added : 59 causal constraints over 12 iterations in 833 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-09 10:33:53] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:33:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:33:53] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-06-09 10:33:53] [INFO ] [Real]Added 713 Read/Feed constraints in 334 ms returned sat
[2022-06-09 10:33:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:33:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:33:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:33:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:33:54] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-06-09 10:33:54] [INFO ] [Nat]Added 713 Read/Feed constraints in 403 ms returned sat
[2022-06-09 10:33:54] [INFO ] Deduced a trap composed of 139 places in 91 ms of which 0 ms to minimize.
[2022-06-09 10:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-06-09 10:33:54] [INFO ] Computed and/alt/rep : 220/384/220 causal constraints (skipped 907 transitions) in 105 ms.
[2022-06-09 10:33:55] [INFO ] Added : 59 causal constraints over 12 iterations in 832 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-09 10:33:55] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:33:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:33:55] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2022-06-09 10:33:56] [INFO ] [Real]Added 713 Read/Feed constraints in 324 ms returned sat
[2022-06-09 10:33:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:33:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:33:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:33:56] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2022-06-09 10:33:57] [INFO ] [Nat]Added 713 Read/Feed constraints in 455 ms returned sat
[2022-06-09 10:33:57] [INFO ] Deduced a trap composed of 139 places in 96 ms of which 0 ms to minimize.
[2022-06-09 10:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-06-09 10:33:57] [INFO ] Computed and/alt/rep : 220/384/220 causal constraints (skipped 907 transitions) in 98 ms.
[2022-06-09 10:33:58] [INFO ] Added : 59 causal constraints over 12 iterations in 942 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-09 10:33:58] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:33:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:33:58] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2022-06-09 10:33:58] [INFO ] [Real]Added 713 Read/Feed constraints in 325 ms returned sat
[2022-06-09 10:33:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:33:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:33:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:33:59] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-06-09 10:33:59] [INFO ] [Nat]Added 713 Read/Feed constraints in 369 ms returned sat
[2022-06-09 10:33:59] [INFO ] Deduced a trap composed of 139 places in 93 ms of which 0 ms to minimize.
[2022-06-09 10:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-06-09 10:33:59] [INFO ] Computed and/alt/rep : 220/384/220 causal constraints (skipped 907 transitions) in 103 ms.
[2022-06-09 10:34:00] [INFO ] Added : 60 causal constraints over 12 iterations in 867 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-09 10:34:00] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:34:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 10:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:34:01] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-06-09 10:34:01] [INFO ] [Real]Added 713 Read/Feed constraints in 324 ms returned sat
[2022-06-09 10:34:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:34:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-06-09 10:34:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:34:01] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-06-09 10:34:02] [INFO ] [Nat]Added 713 Read/Feed constraints in 461 ms returned sat
[2022-06-09 10:34:02] [INFO ] Deduced a trap composed of 139 places in 93 ms of which 0 ms to minimize.
[2022-06-09 10:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-06-09 10:34:02] [INFO ] Computed and/alt/rep : 220/384/220 causal constraints (skipped 907 transitions) in 98 ms.
[2022-06-09 10:34:03] [INFO ] Added : 59 causal constraints over 12 iterations in 828 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 105400 steps, including 688 resets, run finished after 403 ms. (steps per millisecond=261 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 104800 steps, including 844 resets, run finished after 571 ms. (steps per millisecond=183 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 105500 steps, including 599 resets, run finished after 418 ms. (steps per millisecond=252 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 105900 steps, including 856 resets, run finished after 420 ms. (steps per millisecond=252 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 102600 steps, including 511 resets, run finished after 448 ms. (steps per millisecond=229 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 5 out of 652 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 652/652 places, 1688/1688 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 650 transition count 1684
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 650 transition count 1684
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 648 transition count 1680
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 648 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 647 transition count 1676
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 647 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 646 transition count 1674
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 646 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 645 transition count 1672
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 645 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 644 transition count 1670
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 644 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 643 transition count 1668
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 643 transition count 1668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 642 transition count 1666
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 642 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 641 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 641 transition count 1664
Applied a total of 22 rules in 269 ms. Remains 641 /652 variables (removed 11) and now considering 1664/1688 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 641/652 places, 1664/1688 transitions.
[2022-06-09 10:34:05] [INFO ] Flatten gal took : 65 ms
[2022-06-09 10:34:05] [INFO ] Flatten gal took : 64 ms
[2022-06-09 10:34:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14458281616172873899.gal : 6 ms
[2022-06-09 10:34:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13942165434136509486.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/ReachabilityCardinality14458281616172873899.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13942165434136509486.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/ReachabilityCardinality14458281616172873899.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13942165434136509486.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13942165434136509486.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 1967
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1967 after 1.18536e+06
Detected timeout of ITS tools.
[2022-06-09 10:34:21] [INFO ] Flatten gal took : 57 ms
[2022-06-09 10:34:21] [INFO ] Applying decomposition
[2022-06-09 10:34:21] [INFO ] Flatten gal took : 47 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/graph5286991049025973313.txt, -o, /tmp/graph5286991049025973313.bin, -w, /tmp/graph5286991049025973313.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/graph5286991049025973313.bin, -l, -1, -v, -w, /tmp/graph5286991049025973313.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:34:21] [INFO ] Decomposing Gal with order
[2022-06-09 10:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:34:21] [INFO ] Removed a total of 2770 redundant transitions.
[2022-06-09 10:34:21] [INFO ] Flatten gal took : 90 ms
[2022-06-09 10:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1150 labels/synchronizations in 41 ms.
[2022-06-09 10:34:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11220576414827874752.gal : 20 ms
[2022-06-09 10:34:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9928845381439671847.prop : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11220576414827874752.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9928845381439671847.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/ReachabilityCardinality11220576414827874752.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9928845381439671847.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9928845381439671847.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6682149226011084931
[2022-06-09 10:34:36] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6682149226011084931
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/ltsmin6682149226011084931]
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/ltsmin6682149226011084931] 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/ltsmin6682149226011084931] 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 1000003 steps, including 2 resets, run finished after 1432 ms. (steps per millisecond=698 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1394 ms. (steps per millisecond=717 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1477 ms. (steps per millisecond=677 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1478 ms. (steps per millisecond=676 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1447 ms. (steps per millisecond=691 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 4284419 steps, run timeout after 30001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 4284419 steps, saw 2726657 distinct states, run finished after 30001 ms. (steps per millisecond=142 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-09 10:35:14] [INFO ] Flow matrix only has 1113 transitions (discarded 551 similar events)
// Phase 1: matrix 1113 rows 641 cols
[2022-06-09 10:35:14] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 10:35:14] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:35:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:35:15] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-06-09 10:35:15] [INFO ] State equation strengthened by 701 read => feed constraints.
[2022-06-09 10:35:15] [INFO ] [Real]Added 701 Read/Feed constraints in 311 ms returned sat
[2022-06-09 10:35:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:35:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:35:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:35:15] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2022-06-09 10:35:16] [INFO ] [Nat]Added 701 Read/Feed constraints in 348 ms returned sat
[2022-06-09 10:35:16] [INFO ] Deduced a trap composed of 139 places in 96 ms of which 1 ms to minimize.
[2022-06-09 10:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-06-09 10:35:16] [INFO ] Computed and/alt/rep : 216/354/216 causal constraints (skipped 895 transitions) in 102 ms.
[2022-06-09 10:35:17] [INFO ] Added : 54 causal constraints over 11 iterations in 765 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-09 10:35:17] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:35:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:35:17] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-06-09 10:35:17] [INFO ] [Real]Added 701 Read/Feed constraints in 306 ms returned sat
[2022-06-09 10:35:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:35:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:35:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:35:18] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2022-06-09 10:35:18] [INFO ] [Nat]Added 701 Read/Feed constraints in 354 ms returned sat
[2022-06-09 10:35:18] [INFO ] Deduced a trap composed of 139 places in 97 ms of which 0 ms to minimize.
[2022-06-09 10:35:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-09 10:35:18] [INFO ] Computed and/alt/rep : 216/354/216 causal constraints (skipped 895 transitions) in 95 ms.
[2022-06-09 10:35:19] [INFO ] Added : 55 causal constraints over 11 iterations in 913 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-09 10:35:19] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:35:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:35:19] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-06-09 10:35:20] [INFO ] [Real]Added 701 Read/Feed constraints in 307 ms returned sat
[2022-06-09 10:35:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:35:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:35:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:35:20] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2022-06-09 10:35:20] [INFO ] [Nat]Added 701 Read/Feed constraints in 363 ms returned sat
[2022-06-09 10:35:21] [INFO ] Deduced a trap composed of 139 places in 88 ms of which 0 ms to minimize.
[2022-06-09 10:35:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-06-09 10:35:21] [INFO ] Computed and/alt/rep : 216/354/216 causal constraints (skipped 895 transitions) in 98 ms.
[2022-06-09 10:35:21] [INFO ] Added : 55 causal constraints over 11 iterations in 787 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-09 10:35:21] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:35:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:35:22] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-06-09 10:35:22] [INFO ] [Real]Added 701 Read/Feed constraints in 328 ms returned sat
[2022-06-09 10:35:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:35:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:35:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:35:22] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2022-06-09 10:35:23] [INFO ] [Nat]Added 701 Read/Feed constraints in 368 ms returned sat
[2022-06-09 10:35:23] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 0 ms to minimize.
[2022-06-09 10:35:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-09 10:35:23] [INFO ] Computed and/alt/rep : 216/354/216 causal constraints (skipped 895 transitions) in 112 ms.
[2022-06-09 10:35:24] [INFO ] Added : 55 causal constraints over 11 iterations in 797 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 104100 steps, including 662 resets, run finished after 420 ms. (steps per millisecond=247 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 104000 steps, including 543 resets, run finished after 462 ms. (steps per millisecond=225 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 103500 steps, including 657 resets, run finished after 403 ms. (steps per millisecond=256 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 101100 steps, including 792 resets, run finished after 385 ms. (steps per millisecond=262 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 4 out of 641 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 641/641 places, 1664/1664 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 640 transition count 1662
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 640 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 639 transition count 1660
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 639 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 638 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 638 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 637 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 637 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 636 transition count 1652
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 636 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 635 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 635 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 634 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 634 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 633 transition count 1646
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 633 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 632 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 632 transition count 1644
Applied a total of 18 rules in 210 ms. Remains 632 /641 variables (removed 9) and now considering 1644/1664 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 632/641 places, 1644/1664 transitions.
[2022-06-09 10:35:26] [INFO ] Flatten gal took : 44 ms
[2022-06-09 10:35:26] [INFO ] Flatten gal took : 47 ms
[2022-06-09 10:35:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6377622856284604850.gal : 5 ms
[2022-06-09 10:35:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14057838960014599699.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/ReachabilityCardinality6377622856284604850.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14057838960014599699.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/ReachabilityCardinality6377622856284604850.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14057838960014599699.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14057838960014599699.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 1963
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1963 after 1.17697e+06
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1.17697e+06 after 3.19161e+10
Detected timeout of ITS tools.
[2022-06-09 10:35:46] [INFO ] Flatten gal took : 46 ms
[2022-06-09 10:35:46] [INFO ] Applying decomposition
[2022-06-09 10:35:46] [INFO ] Flatten gal took : 47 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/graph6626722566242031413.txt, -o, /tmp/graph6626722566242031413.bin, -w, /tmp/graph6626722566242031413.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/graph6626722566242031413.bin, -l, -1, -v, -w, /tmp/graph6626722566242031413.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:35:46] [INFO ] Decomposing Gal with order
[2022-06-09 10:35:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:35:46] [INFO ] Removed a total of 2735 redundant transitions.
[2022-06-09 10:35:46] [INFO ] Flatten gal took : 82 ms
[2022-06-09 10:35:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1141 labels/synchronizations in 34 ms.
[2022-06-09 10:35:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6695907417967585419.gal : 7 ms
[2022-06-09 10:35:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9666499115292056631.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/ReachabilityCardinality6695907417967585419.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9666499115292056631.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/ReachabilityCardinality6695907417967585419.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9666499115292056631.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9666499115292056631.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6816384700682952491
[2022-06-09 10:36:06] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6816384700682952491
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/ltsmin6816384700682952491]
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/ltsmin6816384700682952491] killed by timeout after 2 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/ltsmin6816384700682952491] killed by timeout after 2 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 1000019 steps, including 2 resets, run finished after 1414 ms. (steps per millisecond=707 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1449 ms. (steps per millisecond=690 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 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 1515 ms. (steps per millisecond=660 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 4205133 steps, run timeout after 30001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 4205133 steps, saw 2729046 distinct states, run finished after 30001 ms. (steps per millisecond=140 ) properties seen :{}
Running SMT prover for 3 properties.
[2022-06-09 10:36:44] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2022-06-09 10:36:44] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 10:36:44] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:36:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:44] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-06-09 10:36:44] [INFO ] State equation strengthened by 691 read => feed constraints.
[2022-06-09 10:36:45] [INFO ] [Real]Added 691 Read/Feed constraints in 309 ms returned sat
[2022-06-09 10:36:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:36:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:45] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2022-06-09 10:36:45] [INFO ] [Nat]Added 691 Read/Feed constraints in 325 ms returned sat
[2022-06-09 10:36:46] [INFO ] Deduced a trap composed of 139 places in 98 ms of which 0 ms to minimize.
[2022-06-09 10:36:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-09 10:36:46] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 885 transitions) in 95 ms.
[2022-06-09 10:36:46] [INFO ] Added : 50 causal constraints over 10 iterations in 743 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-09 10:36:46] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:36:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:47] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-06-09 10:36:47] [INFO ] [Real]Added 691 Read/Feed constraints in 300 ms returned sat
[2022-06-09 10:36:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:36:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:47] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2022-06-09 10:36:48] [INFO ] [Nat]Added 691 Read/Feed constraints in 337 ms returned sat
[2022-06-09 10:36:48] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 0 ms to minimize.
[2022-06-09 10:36:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-06-09 10:36:48] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 885 transitions) in 96 ms.
[2022-06-09 10:36:49] [INFO ] Added : 51 causal constraints over 11 iterations in 775 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-09 10:36:49] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:36:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:49] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-06-09 10:36:49] [INFO ] [Real]Added 691 Read/Feed constraints in 299 ms returned sat
[2022-06-09 10:36:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:36:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:36:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:36:50] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-06-09 10:36:50] [INFO ] [Nat]Added 691 Read/Feed constraints in 341 ms returned sat
[2022-06-09 10:36:50] [INFO ] Deduced a trap composed of 139 places in 96 ms of which 0 ms to minimize.
[2022-06-09 10:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-06-09 10:36:50] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 885 transitions) in 101 ms.
[2022-06-09 10:36:51] [INFO ] Added : 52 causal constraints over 11 iterations in 863 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 98700 steps, including 732 resets, run finished after 393 ms. (steps per millisecond=251 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 100600 steps, including 600 resets, run finished after 384 ms. (steps per millisecond=261 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 102300 steps, including 587 resets, run finished after 406 ms. (steps per millisecond=251 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 3 out of 632 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 632/632 places, 1644/1644 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 631 transition count 1642
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 631 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 630 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 630 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 629 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 629 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 628 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 628 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 627 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 627 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 626 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 626 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 625 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 625 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 624 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 623 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 623 transition count 1624
Applied a total of 18 rules in 176 ms. Remains 623 /632 variables (removed 9) and now considering 1624/1644 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 623/632 places, 1624/1644 transitions.
[2022-06-09 10:36:52] [INFO ] Flatten gal took : 42 ms
[2022-06-09 10:36:52] [INFO ] Flatten gal took : 44 ms
[2022-06-09 10:36:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12098745104419101999.gal : 4 ms
[2022-06-09 10:36:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6295799750996534409.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/ReachabilityCardinality12098745104419101999.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6295799750996534409.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/ReachabilityCardinality12098745104419101999.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6295799750996534409.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6295799750996534409.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 1959
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1959 after 1.1686e+06
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.1686e+06 after 3.12635e+10
Detected timeout of ITS tools.
[2022-06-09 10:37:18] [INFO ] Flatten gal took : 42 ms
[2022-06-09 10:37:18] [INFO ] Applying decomposition
[2022-06-09 10:37:18] [INFO ] Flatten gal took : 42 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/graph311434103213386197.txt, -o, /tmp/graph311434103213386197.bin, -w, /tmp/graph311434103213386197.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/graph311434103213386197.bin, -l, -1, -v, -w, /tmp/graph311434103213386197.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:37:18] [INFO ] Decomposing Gal with order
[2022-06-09 10:37:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:37:18] [INFO ] Removed a total of 2702 redundant transitions.
[2022-06-09 10:37:18] [INFO ] Flatten gal took : 79 ms
[2022-06-09 10:37:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1202 labels/synchronizations in 34 ms.
[2022-06-09 10:37:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8685219698070649666.gal : 7 ms
[2022-06-09 10:37:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4000101978248310895.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/ReachabilityCardinality8685219698070649666.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4000101978248310895.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/ReachabilityCardinality8685219698070649666.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4000101978248310895.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4000101978248310895.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7325745020897601084
[2022-06-09 10:37:43] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7325745020897601084
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/ltsmin7325745020897601084]
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/ltsmin7325745020897601084] killed by timeout after 2 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/ltsmin7325745020897601084] killed by timeout after 2 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 1000027 steps, including 2 resets, run finished after 1319 ms. (steps per millisecond=758 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1407 ms. (steps per millisecond=710 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4357826 steps, run timeout after 30001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 4357826 steps, saw 2775142 distinct states, run finished after 30001 ms. (steps per millisecond=145 ) properties seen :{}
Running SMT prover for 2 properties.
[2022-06-09 10:38:19] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2022-06-09 10:38:19] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 10:38:19] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:38:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:19] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-06-09 10:38:19] [INFO ] State equation strengthened by 681 read => feed constraints.
[2022-06-09 10:38:20] [INFO ] [Real]Added 681 Read/Feed constraints in 283 ms returned sat
[2022-06-09 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:38:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:38:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:20] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2022-06-09 10:38:20] [INFO ] [Nat]Added 681 Read/Feed constraints in 350 ms returned sat
[2022-06-09 10:38:20] [INFO ] Deduced a trap composed of 139 places in 96 ms of which 0 ms to minimize.
[2022-06-09 10:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-09 10:38:21] [INFO ] Computed and/alt/rep : 208/306/208 causal constraints (skipped 875 transitions) in 102 ms.
[2022-06-09 10:38:21] [INFO ] Added : 46 causal constraints over 10 iterations in 749 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-09 10:38:21] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:38:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:22] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-06-09 10:38:22] [INFO ] [Real]Added 681 Read/Feed constraints in 297 ms returned sat
[2022-06-09 10:38:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:38:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:38:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:38:22] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2022-06-09 10:38:23] [INFO ] [Nat]Added 681 Read/Feed constraints in 327 ms returned sat
[2022-06-09 10:38:23] [INFO ] Deduced a trap composed of 139 places in 105 ms of which 1 ms to minimize.
[2022-06-09 10:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-06-09 10:38:23] [INFO ] Computed and/alt/rep : 208/306/208 causal constraints (skipped 875 transitions) in 113 ms.
[2022-06-09 10:38:24] [INFO ] Added : 47 causal constraints over 10 iterations in 766 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 98400 steps, including 651 resets, run finished after 409 ms. (steps per millisecond=240 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 100300 steps, including 637 resets, run finished after 369 ms. (steps per millisecond=271 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 2 out of 623 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 623/623 places, 1624/1624 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 622 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 622 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 621 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 620 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 620 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 619 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 619 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 618 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 618 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 617 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 617 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 616 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 616 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 615 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 615 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 614 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 614 transition count 1604
Applied a total of 18 rules in 167 ms. Remains 614 /623 variables (removed 9) and now considering 1604/1624 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 614/623 places, 1604/1624 transitions.
[2022-06-09 10:38:25] [INFO ] Flatten gal took : 41 ms
[2022-06-09 10:38:25] [INFO ] Flatten gal took : 44 ms
[2022-06-09 10:38:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11463704965707035220.gal : 4 ms
[2022-06-09 10:38:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13758890039950851406.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/ReachabilityCardinality11463704965707035220.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13758890039950851406.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/ReachabilityCardinality11463704965707035220.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13758890039950851406.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13758890039950851406.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1957
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1957 after 1.16442e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.16442e+06 after 3.09406e+10
Detected timeout of ITS tools.
[2022-06-09 10:38:55] [INFO ] Flatten gal took : 41 ms
[2022-06-09 10:38:55] [INFO ] Applying decomposition
[2022-06-09 10:38:55] [INFO ] Flatten gal took : 42 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/graph17688178420552878203.txt, -o, /tmp/graph17688178420552878203.bin, -w, /tmp/graph17688178420552878203.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/graph17688178420552878203.bin, -l, -1, -v, -w, /tmp/graph17688178420552878203.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:38:55] [INFO ] Decomposing Gal with order
[2022-06-09 10:38:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:38:55] [INFO ] Removed a total of 2664 redundant transitions.
[2022-06-09 10:38:55] [INFO ] Flatten gal took : 67 ms
[2022-06-09 10:38:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1181 labels/synchronizations in 35 ms.
[2022-06-09 10:38:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18262534543066708838.gal : 6 ms
[2022-06-09 10:38:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9020000134070227315.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/ReachabilityCardinality18262534543066708838.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9020000134070227315.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/ReachabilityCardinality18262534543066708838.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9020000134070227315.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9020000134070227315.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3011108185703977116
[2022-06-09 10:39:25] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3011108185703977116
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/ltsmin3011108185703977116]
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/ltsmin3011108185703977116] killed by timeout after 3 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/ltsmin3011108185703977116] killed by timeout after 3 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 1000001 steps, including 2 resets, run finished after 1355 ms. (steps per millisecond=738 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1336 ms. (steps per millisecond=748 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4355716 steps, run timeout after 30001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 4355716 steps, saw 2826432 distinct states, run finished after 30001 ms. (steps per millisecond=145 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-09 10:40:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2022-06-09 10:40:01] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 10:40:01] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:40:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:40:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:01] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-06-09 10:40:01] [INFO ] State equation strengthened by 671 read => feed constraints.
[2022-06-09 10:40:01] [INFO ] [Real]Added 671 Read/Feed constraints in 285 ms returned sat
[2022-06-09 10:40:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:40:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-06-09 10:40:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:40:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:02] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2022-06-09 10:40:02] [INFO ] [Nat]Added 671 Read/Feed constraints in 339 ms returned sat
[2022-06-09 10:40:02] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 1 ms to minimize.
[2022-06-09 10:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-06-09 10:40:03] [INFO ] Computed and/alt/rep : 204/288/204 causal constraints (skipped 865 transitions) in 173 ms.
[2022-06-09 10:40:03] [INFO ] Added : 44 causal constraints over 9 iterations in 739 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Finished Parikh walk after 19008 steps, including 171 resets, run visited all 1 properties in 53 ms. (steps per millisecond=358 )
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1654771204771
--------------------
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-c032"
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-c032, 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-165472292800192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 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 ;