fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r063-tajo-167813711600049
Last Updated
May 14, 2023

About the Execution of 2022-gold for BugTracking-PT-q8m002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16215.792 3600000.00 3636242.00 61199.60 0 0 ? 0 0 0 0 0 ? 0 1 ? 0 0 0 0 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r063-tajo-167813711600049.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is BugTracking-PT-q8m002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 07:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678929997471

Running Version 202205111006
[2023-03-16 01:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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]
[2023-03-16 01:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:26:39] [INFO ] Load time of PNML (sax parser for PT used): 866 ms
[2023-03-16 01:26:39] [INFO ] Transformed 754 places.
[2023-03-16 01:26:39] [INFO ] Transformed 27370 transitions.
[2023-03-16 01:26:39] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1052 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 474 places in 129 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m002-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-16 01:26:40] [INFO ] Computed 10 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 212 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
FORMULA BugTracking-PT-q8m002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
[2023-03-16 01:26:40] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-16 01:26:40] [INFO ] Computed 10 place invariants in 30 ms
[2023-03-16 01:26:40] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-16 01:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:26:41] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2023-03-16 01:26:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:26:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-16 01:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:26:42] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-16 01:26:42] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-16 01:26:42] [INFO ] [Nat]Added 303 Read/Feed constraints in 150 ms returned sat
[2023-03-16 01:26:42] [INFO ] Deduced a trap composed of 20 places in 516 ms of which 4 ms to minimize.
[2023-03-16 01:26:43] [INFO ] Deduced a trap composed of 43 places in 528 ms of which 2 ms to minimize.
[2023-03-16 01:26:44] [INFO ] Deduced a trap composed of 55 places in 423 ms of which 1 ms to minimize.
[2023-03-16 01:26:44] [INFO ] Deduced a trap composed of 89 places in 372 ms of which 1 ms to minimize.
[2023-03-16 01:26:45] [INFO ] Deduced a trap composed of 35 places in 542 ms of which 2 ms to minimize.
[2023-03-16 01:26:45] [INFO ] Deduced a trap composed of 60 places in 388 ms of which 1 ms to minimize.
[2023-03-16 01:26:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3637 ms
[2023-03-16 01:26:46] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 362 ms.
[2023-03-16 01:26:46] [INFO ] Added : 5 causal constraints over 1 iterations in 565 ms. Result :unknown
[2023-03-16 01:26:46] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-16 01:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:26:47] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2023-03-16 01:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:26:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-16 01:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:26:47] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2023-03-16 01:26:48] [INFO ] [Nat]Added 303 Read/Feed constraints in 251 ms returned sat
[2023-03-16 01:26:48] [INFO ] Deduced a trap composed of 61 places in 456 ms of which 1 ms to minimize.
[2023-03-16 01:26:49] [INFO ] Deduced a trap composed of 57 places in 397 ms of which 1 ms to minimize.
[2023-03-16 01:26:49] [INFO ] Deduced a trap composed of 58 places in 400 ms of which 0 ms to minimize.
[2023-03-16 01:26:50] [INFO ] Deduced a trap composed of 47 places in 383 ms of which 0 ms to minimize.
[2023-03-16 01:26:50] [INFO ] Deduced a trap composed of 18 places in 552 ms of which 1 ms to minimize.
[2023-03-16 01:26:51] [INFO ] Deduced a trap composed of 57 places in 381 ms of which 1 ms to minimize.
[2023-03-16 01:26:51] [INFO ] Deduced a trap composed of 31 places in 393 ms of which 1 ms to minimize.
[2023-03-16 01:26:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3905 ms
[2023-03-16 01:26:52] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 310 ms.
[2023-03-16 01:26:52] [INFO ] Added : 0 causal constraints over 0 iterations in 312 ms. Result :unknown
[2023-03-16 01:26:52] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-16 01:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:26:53] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2023-03-16 01:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:26:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-16 01:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:26:53] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-16 01:26:54] [INFO ] [Nat]Added 303 Read/Feed constraints in 206 ms returned sat
[2023-03-16 01:26:54] [INFO ] Deduced a trap composed of 48 places in 526 ms of which 1 ms to minimize.
[2023-03-16 01:26:55] [INFO ] Deduced a trap composed of 14 places in 475 ms of which 1 ms to minimize.
[2023-03-16 01:26:55] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 0 ms to minimize.
[2023-03-16 01:26:56] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 0 ms to minimize.
[2023-03-16 01:26:56] [INFO ] Deduced a trap composed of 19 places in 544 ms of which 1 ms to minimize.
[2023-03-16 01:26:57] [INFO ] Deduced a trap composed of 100 places in 567 ms of which 0 ms to minimize.
[2023-03-16 01:26:57] [INFO ] Deduced a trap composed of 64 places in 411 ms of which 0 ms to minimize.
[2023-03-16 01:26:58] [INFO ] Deduced a trap composed of 56 places in 491 ms of which 0 ms to minimize.
[2023-03-16 01:26:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[0, 0, 1]
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 314 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:26:59] [INFO ] Computed 8 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 6295 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2241 ms. (steps per millisecond=446 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties (out of 3) seen :0
[2023-03-16 01:27:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:11] [INFO ] Computed 8 place invariants in 37 ms
[2023-03-16 01:27:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:12] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2023-03-16 01:27:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:27:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 01:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:12] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-16 01:27:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:27:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 323 ms returned sat
[2023-03-16 01:27:13] [INFO ] Deduced a trap composed of 30 places in 442 ms of which 1 ms to minimize.
[2023-03-16 01:27:14] [INFO ] Deduced a trap composed of 91 places in 471 ms of which 1 ms to minimize.
[2023-03-16 01:27:14] [INFO ] Deduced a trap composed of 18 places in 447 ms of which 0 ms to minimize.
[2023-03-16 01:27:15] [INFO ] Deduced a trap composed of 93 places in 486 ms of which 0 ms to minimize.
[2023-03-16 01:27:16] [INFO ] Deduced a trap composed of 60 places in 439 ms of which 1 ms to minimize.
[2023-03-16 01:27:17] [INFO ] Deduced a trap composed of 53 places in 375 ms of which 1 ms to minimize.
[2023-03-16 01:27:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4704 ms
[2023-03-16 01:27:18] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 312 ms.
[2023-03-16 01:27:18] [INFO ] Added : 4 causal constraints over 1 iterations in 855 ms. Result :sat
[2023-03-16 01:27:19] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:19] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2023-03-16 01:27:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:27:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 01:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:20] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2023-03-16 01:27:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 214 ms returned sat
[2023-03-16 01:27:21] [INFO ] Deduced a trap composed of 100 places in 461 ms of which 0 ms to minimize.
[2023-03-16 01:27:22] [INFO ] Deduced a trap composed of 44 places in 744 ms of which 1 ms to minimize.
[2023-03-16 01:27:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1570 ms
[2023-03-16 01:27:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 321 ms.
[2023-03-16 01:27:22] [INFO ] Added : 3 causal constraints over 1 iterations in 788 ms. Result :sat
[2023-03-16 01:27:23] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:23] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2023-03-16 01:27:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:27:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:24] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-16 01:27:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 142 ms returned sat
[2023-03-16 01:27:25] [INFO ] Deduced a trap composed of 76 places in 440 ms of which 0 ms to minimize.
[2023-03-16 01:27:25] [INFO ] Deduced a trap composed of 83 places in 425 ms of which 1 ms to minimize.
[2023-03-16 01:27:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1142 ms
[2023-03-16 01:27:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 321 ms.
[2023-03-16 01:27:26] [INFO ] Added : 4 causal constraints over 1 iterations in 728 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[0, 0, 1]
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:27:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:27] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-16 01:27:27] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-16 01:27:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:27] [INFO ] Computed 8 place invariants in 29 ms
[2023-03-16 01:27:28] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:27:29] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
[2023-03-16 01:27:30] [INFO ] Redundant transitions in 414 ms returned []
[2023-03-16 01:27:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:30] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-16 01:27:31] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:31] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-16 01:27:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:31] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:27:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:32] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-16 01:27:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:27:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:27:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:32] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-16 01:27:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:27:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 272 ms returned sat
[2023-03-16 01:27:33] [INFO ] Deduced a trap composed of 30 places in 318 ms of which 0 ms to minimize.
[2023-03-16 01:27:33] [INFO ] Deduced a trap composed of 91 places in 428 ms of which 0 ms to minimize.
[2023-03-16 01:27:34] [INFO ] Deduced a trap composed of 18 places in 427 ms of which 0 ms to minimize.
[2023-03-16 01:27:34] [INFO ] Deduced a trap composed of 93 places in 441 ms of which 11 ms to minimize.
[2023-03-16 01:27:35] [INFO ] Deduced a trap composed of 60 places in 418 ms of which 0 ms to minimize.
[2023-03-16 01:27:36] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 0 ms to minimize.
[2023-03-16 01:27:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4141 ms
[2023-03-16 01:27:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:37] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6393 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 1905 ms. (steps per millisecond=524 ) properties (out of 1) seen :0
[2023-03-16 01:27:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:45] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:27:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:46] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2023-03-16 01:27:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:27:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:46] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-03-16 01:27:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:27:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 308 ms returned sat
[2023-03-16 01:27:47] [INFO ] Deduced a trap composed of 30 places in 373 ms of which 1 ms to minimize.
[2023-03-16 01:27:47] [INFO ] Deduced a trap composed of 91 places in 383 ms of which 0 ms to minimize.
[2023-03-16 01:27:48] [INFO ] Deduced a trap composed of 18 places in 452 ms of which 1 ms to minimize.
[2023-03-16 01:27:49] [INFO ] Deduced a trap composed of 93 places in 474 ms of which 4 ms to minimize.
[2023-03-16 01:27:49] [INFO ] Deduced a trap composed of 60 places in 489 ms of which 0 ms to minimize.
[2023-03-16 01:27:50] [INFO ] Deduced a trap composed of 53 places in 371 ms of which 0 ms to minimize.
[2023-03-16 01:27:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4511 ms
[2023-03-16 01:27:51] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 311 ms.
[2023-03-16 01:27:52] [INFO ] Added : 4 causal constraints over 1 iterations in 800 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 80 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:27:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:52] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-16 01:27:53] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-16 01:27:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:53] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:27:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:27:55] [INFO ] Implicit Places using invariants and state equation in 2170 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
[2023-03-16 01:27:55] [INFO ] Redundant transitions in 267 ms returned []
[2023-03-16 01:27:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:55] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-16 01:27:56] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-02 in 25428 ms.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:56] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10001 steps, including 4 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
[2023-03-16 01:27:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:27:57] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-16 01:27:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:57] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2023-03-16 01:27:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:27:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:27:58] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2023-03-16 01:27:58] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:27:58] [INFO ] [Nat]Added 283 Read/Feed constraints in 222 ms returned sat
[2023-03-16 01:27:59] [INFO ] Deduced a trap composed of 100 places in 462 ms of which 0 ms to minimize.
[2023-03-16 01:27:59] [INFO ] Deduced a trap composed of 44 places in 469 ms of which 1 ms to minimize.
[2023-03-16 01:27:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1180 ms
[2023-03-16 01:28:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 306 ms.
[2023-03-16 01:28:00] [INFO ] Added : 3 causal constraints over 1 iterations in 705 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:00] [INFO ] Computed 8 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 10 resets, run finished after 5692 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties (out of 1) seen :0
[2023-03-16 01:28:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:08] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:28:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:28:09] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2023-03-16 01:28:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:28:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:28:09] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-03-16 01:28:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:28:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 156 ms returned sat
[2023-03-16 01:28:10] [INFO ] Deduced a trap composed of 100 places in 446 ms of which 0 ms to minimize.
[2023-03-16 01:28:10] [INFO ] Deduced a trap composed of 44 places in 390 ms of which 0 ms to minimize.
[2023-03-16 01:28:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1100 ms
[2023-03-16 01:28:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 268 ms.
[2023-03-16 01:28:11] [INFO ] Added : 3 causal constraints over 1 iterations in 709 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:28:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:11] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-16 01:28:12] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-16 01:28:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:12] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:28:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:28:14] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2324 ms to find 0 implicit places.
[2023-03-16 01:28:14] [INFO ] Redundant transitions in 222 ms returned []
[2023-03-16 01:28:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:14] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:28:15] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-08 in 18726 ms.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:15] [INFO ] Computed 8 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2023-03-16 01:28:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:15] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:28:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:28:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:28:16] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2023-03-16 01:28:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:28:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-16 01:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:28:16] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-03-16 01:28:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:28:16] [INFO ] [Nat]Added 283 Read/Feed constraints in 153 ms returned sat
[2023-03-16 01:28:17] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 0 ms to minimize.
[2023-03-16 01:28:17] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 0 ms to minimize.
[2023-03-16 01:28:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1021 ms
[2023-03-16 01:28:18] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 321 ms.
[2023-03-16 01:28:19] [INFO ] Deduced a trap composed of 45 places in 347 ms of which 1 ms to minimize.
[2023-03-16 01:28:19] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 1 ms to minimize.
[2023-03-16 01:28:20] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 0 ms to minimize.
[2023-03-16 01:28:20] [INFO ] Deduced a trap composed of 57 places in 284 ms of which 0 ms to minimize.
[2023-03-16 01:28:20] [INFO ] Deduced a trap composed of 57 places in 276 ms of which 0 ms to minimize.
[2023-03-16 01:28:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2216 ms
[2023-03-16 01:28:21] [INFO ] Added : 6 causal constraints over 2 iterations in 3254 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:21] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6263 ms. (steps per millisecond=159 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2021 ms. (steps per millisecond=494 ) properties (out of 1) seen :0
[2023-03-16 01:28:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:29] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:28:29] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2023-03-16 01:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:28:30] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2023-03-16 01:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:28:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:28:31] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2023-03-16 01:28:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:28:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 182 ms returned sat
[2023-03-16 01:28:31] [INFO ] Deduced a trap composed of 76 places in 391 ms of which 0 ms to minimize.
[2023-03-16 01:28:32] [INFO ] Deduced a trap composed of 83 places in 352 ms of which 0 ms to minimize.
[2023-03-16 01:28:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 989 ms
[2023-03-16 01:28:32] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 207 ms.
[2023-03-16 01:28:32] [INFO ] Added : 4 causal constraints over 1 iterations in 606 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 48 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 49 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:28:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:33] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-16 01:28:33] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-16 01:28:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:33] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:28:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:28:35] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2628 ms to find 0 implicit places.
[2023-03-16 01:28:35] [INFO ] Redundant transitions in 145 ms returned []
[2023-03-16 01:28:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:28:35] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-16 01:28:37] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-11 in 21393 ms.
[2023-03-16 01:28:37] [INFO ] Flatten gal took : 431 ms
[2023-03-16 01:28:37] [INFO ] Applying decomposition
[2023-03-16 01:28:38] [INFO ] Flatten gal took : 158 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4825006333674318359.txt' '-o' '/tmp/graph4825006333674318359.bin' '-w' '/tmp/graph4825006333674318359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4825006333674318359.bin' '-l' '-1' '-v' '-w' '/tmp/graph4825006333674318359.weights' '-q' '0' '-e' '0.001'
[2023-03-16 01:28:38] [INFO ] Decomposing Gal with order
[2023-03-16 01:28:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:28:39] [INFO ] Removed a total of 424 redundant transitions.
[2023-03-16 01:28:39] [INFO ] Flatten gal took : 385 ms
[2023-03-16 01:28:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 38 ms.
[2023-03-16 01:28:39] [INFO ] Time to serialize gal into /tmp/UpperBounds13833749640754057307.gal : 60 ms
[2023-03-16 01:28:39] [INFO ] Time to serialize properties into /tmp/UpperBounds9914580879733377723.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13833749640754057307.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9914580879733377723.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds9914580879733377723.prop.
Detected timeout of ITS tools.
[2023-03-16 01:49:22] [INFO ] Flatten gal took : 1132 ms
[2023-03-16 01:49:22] [INFO ] Time to serialize gal into /tmp/UpperBounds10974277327622352309.gal : 116 ms
[2023-03-16 01:49:22] [INFO ] Time to serialize properties into /tmp/UpperBounds18179460360398000688.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10974277327622352309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18179460360398000688.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds18179460360398000688.prop.
Detected timeout of ITS tools.
[2023-03-16 02:10:03] [INFO ] Flatten gal took : 910 ms
[2023-03-16 02:10:09] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-16 02:10:09] [INFO ] Transformed 269 places.
[2023-03-16 02:10:09] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 02:10:09] [INFO ] Time to serialize gal into /tmp/UpperBounds6240838777287442847.gal : 23 ms
[2023-03-16 02:10:09] [INFO ] Time to serialize properties into /tmp/UpperBounds4364919995491487106.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6240838777287442847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4364919995491487106.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4364919995491487106.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is BugTracking-PT-q8m002, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r063-tajo-167813711600049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m002.tgz
mv BugTracking-PT-q8m002 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;