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.r037-tajo-167813690300389.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 itstools
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 r037-tajo-167813690300389
=====================================================================

--------------------
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 1678352121562

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 08:55:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 08:55:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:55:24] [INFO ] Load time of PNML (sax parser for PT used): 706 ms
[2023-03-09 08:55:24] [INFO ] Transformed 754 places.
[2023-03-09 08:55:24] [INFO ] Transformed 27370 transitions.
[2023-03-09 08:55:24] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 894 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 474 places in 106 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-09 08:55:25] [INFO ] Computed 10 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 223 resets, run finished after 191 ms. (steps per millisecond=52 ) 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 54 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
[2023-03-09 08:55:25] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-09 08:55:25] [INFO ] Computed 10 place invariants in 37 ms
[2023-03-09 08:55:25] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-09 08:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:26] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2023-03-09 08:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 08:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:26] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2023-03-09 08:55:26] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 08:55:26] [INFO ] [Nat]Added 303 Read/Feed constraints in 133 ms returned sat
[2023-03-09 08:55:27] [INFO ] Deduced a trap composed of 20 places in 699 ms of which 6 ms to minimize.
[2023-03-09 08:55:28] [INFO ] Deduced a trap composed of 29 places in 624 ms of which 1 ms to minimize.
[2023-03-09 08:55:29] [INFO ] Deduced a trap composed of 14 places in 787 ms of which 2 ms to minimize.
[2023-03-09 08:55:29] [INFO ] Deduced a trap composed of 47 places in 392 ms of which 2 ms to minimize.
[2023-03-09 08:55:30] [INFO ] Deduced a trap composed of 59 places in 594 ms of which 1 ms to minimize.
[2023-03-09 08:55:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3767 ms
[2023-03-09 08:55:31] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 396 ms.
[2023-03-09 08:55:31] [INFO ] Deduced a trap composed of 15 places in 706 ms of which 1 ms to minimize.
[2023-03-09 08:55:31] [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
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-09 08:55:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 08:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:32] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2023-03-09 08:55:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 70 ms returned sat
[2023-03-09 08:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:33] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2023-03-09 08:55:33] [INFO ] [Nat]Added 303 Read/Feed constraints in 274 ms returned sat
[2023-03-09 08:55:34] [INFO ] Deduced a trap composed of 61 places in 570 ms of which 1 ms to minimize.
[2023-03-09 08:55:34] [INFO ] Deduced a trap composed of 57 places in 450 ms of which 1 ms to minimize.
[2023-03-09 08:55:35] [INFO ] Deduced a trap composed of 58 places in 406 ms of which 1 ms to minimize.
[2023-03-09 08:55:35] [INFO ] Deduced a trap composed of 47 places in 450 ms of which 1 ms to minimize.
[2023-03-09 08:55:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2577 ms
[2023-03-09 08:55:36] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 477 ms.
[2023-03-09 08:55:37] [INFO ] Deduced a trap composed of 64 places in 646 ms of which 0 ms to minimize.
[2023-03-09 08:55:37] [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
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-09 08:55:37] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-09 08:55:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:38] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2023-03-09 08:55:38] [INFO ] [Real]Added 303 Read/Feed constraints in 54 ms returned sat
[2023-03-09 08:55:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 08:55:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:39] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2023-03-09 08:55:39] [INFO ] [Nat]Added 303 Read/Feed constraints in 246 ms returned sat
[2023-03-09 08:55:40] [INFO ] Deduced a trap composed of 59 places in 369 ms of which 0 ms to minimize.
[2023-03-09 08:55:40] [INFO ] Deduced a trap composed of 58 places in 345 ms of which 0 ms to minimize.
[2023-03-09 08:55:40] [INFO ] Deduced a trap composed of 17 places in 322 ms of which 0 ms to minimize.
[2023-03-09 08:55:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1431 ms
[2023-03-09 08:55:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 319 ms.
[2023-03-09 08:55:41] [INFO ] Added : 8 causal constraints over 2 iterations in 863 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[0, 0, 2]
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 4 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 437 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. 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-09 08:55:42] [INFO ] Computed 8 place invariants in 52 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7021 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1956 ms. (steps per millisecond=511 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 2141 ms. (steps per millisecond=467 ) properties (out of 3) seen :0
[2023-03-09 08:55:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 08:55:55] [INFO ] Computed 8 place invariants in 36 ms
[2023-03-09 08:55:55] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2023-03-09 08:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:56] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-09 08:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:57] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2023-03-09 08:55:57] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:55:57] [INFO ] [Nat]Added 283 Read/Feed constraints in 163 ms returned sat
[2023-03-09 08:55:58] [INFO ] Deduced a trap composed of 54 places in 520 ms of which 1 ms to minimize.
[2023-03-09 08:55:58] [INFO ] Deduced a trap composed of 85 places in 574 ms of which 0 ms to minimize.
[2023-03-09 08:55:59] [INFO ] Deduced a trap composed of 129 places in 513 ms of which 0 ms to minimize.
[2023-03-09 08:55:59] [INFO ] Deduced a trap composed of 26 places in 420 ms of which 1 ms to minimize.
[2023-03-09 08:56:00] [INFO ] Deduced a trap composed of 56 places in 406 ms of which 0 ms to minimize.
[2023-03-09 08:56:00] [INFO ] Deduced a trap composed of 103 places in 511 ms of which 1 ms to minimize.
[2023-03-09 08:56:01] [INFO ] Deduced a trap composed of 68 places in 416 ms of which 2 ms to minimize.
[2023-03-09 08:56:01] [INFO ] Deduced a trap composed of 62 places in 463 ms of which 1 ms to minimize.
[2023-03-09 08:56:02] [INFO ] Deduced a trap composed of 14 places in 460 ms of which 0 ms to minimize.
[2023-03-09 08:56:03] [INFO ] Deduced a trap composed of 38 places in 484 ms of which 0 ms to minimize.
[2023-03-09 08:56:03] [INFO ] Deduced a trap composed of 59 places in 469 ms of which 1 ms to minimize.
[2023-03-09 08:56:04] [INFO ] Deduced a trap composed of 35 places in 407 ms of which 0 ms to minimize.
[2023-03-09 08:56:04] [INFO ] Deduced a trap composed of 56 places in 317 ms of which 1 ms to minimize.
[2023-03-09 08:56:05] [INFO ] Deduced a trap composed of 98 places in 346 ms of which 0 ms to minimize.
[2023-03-09 08:56:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8178 ms
[2023-03-09 08:56:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 275 ms.
[2023-03-09 08:56:06] [INFO ] Added : 3 causal constraints over 1 iterations in 668 ms. Result :sat
[2023-03-09 08:56:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:06] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2023-03-09 08:56:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:07] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2023-03-09 08:56:07] [INFO ] [Nat]Added 283 Read/Feed constraints in 242 ms returned sat
[2023-03-09 08:56:08] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 1 ms to minimize.
[2023-03-09 08:56:08] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 0 ms to minimize.
[2023-03-09 08:56:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1079 ms
[2023-03-09 08:56:09] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 261 ms.
[2023-03-09 08:56:09] [INFO ] Added : 2 causal constraints over 1 iterations in 611 ms. Result :sat
[2023-03-09 08:56:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:10] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2023-03-09 08:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:11] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2023-03-09 08:56:11] [INFO ] [Nat]Added 283 Read/Feed constraints in 143 ms returned sat
[2023-03-09 08:56:11] [INFO ] Deduced a trap composed of 35 places in 410 ms of which 1 ms to minimize.
[2023-03-09 08:56:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 597 ms
[2023-03-09 08:56:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 355 ms.
[2023-03-09 08:56:12] [INFO ] Added : 4 causal constraints over 1 iterations in 825 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[0, 0, 2]
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 93 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 83 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 08:56:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:56:13] [INFO ] Invariant cache hit.
[2023-03-09 08:56:13] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-09 08:56:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:56:13] [INFO ] Invariant cache hit.
[2023-03-09 08:56:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:56:16] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
[2023-03-09 08:56:16] [INFO ] Redundant transitions in 473 ms returned []
[2023-03-09 08:56:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:56:16] [INFO ] Invariant cache hit.
[2023-03-09 08:56:17] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4741 ms. 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-09 08:56:18] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2023-03-09 08:56:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 08:56:18] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-09 08:56:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:18] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-09 08:56:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:19] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2023-03-09 08:56:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:56:19] [INFO ] [Nat]Added 283 Read/Feed constraints in 198 ms returned sat
[2023-03-09 08:56:20] [INFO ] Deduced a trap composed of 54 places in 450 ms of which 2 ms to minimize.
[2023-03-09 08:56:20] [INFO ] Deduced a trap composed of 85 places in 468 ms of which 1 ms to minimize.
[2023-03-09 08:56:21] [INFO ] Deduced a trap composed of 129 places in 592 ms of which 2 ms to minimize.
[2023-03-09 08:56:21] [INFO ] Deduced a trap composed of 26 places in 558 ms of which 6 ms to minimize.
[2023-03-09 08:56:22] [INFO ] Deduced a trap composed of 56 places in 568 ms of which 0 ms to minimize.
[2023-03-09 08:56:23] [INFO ] Deduced a trap composed of 103 places in 561 ms of which 1 ms to minimize.
[2023-03-09 08:56:23] [INFO ] Deduced a trap composed of 68 places in 515 ms of which 0 ms to minimize.
[2023-03-09 08:56: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 0
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 68 ms. 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-09 08:56:23] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 7518 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2350 ms. (steps per millisecond=425 ) properties (out of 1) seen :0
[2023-03-09 08:56:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 08:56:33] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-09 08:56:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:34] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2023-03-09 08:56:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:35] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2023-03-09 08:56:35] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:56:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 182 ms returned sat
[2023-03-09 08:56:35] [INFO ] Deduced a trap composed of 54 places in 539 ms of which 0 ms to minimize.
[2023-03-09 08:56:36] [INFO ] Deduced a trap composed of 85 places in 511 ms of which 1 ms to minimize.
[2023-03-09 08:56:37] [INFO ] Deduced a trap composed of 129 places in 657 ms of which 1 ms to minimize.
[2023-03-09 08:56:37] [INFO ] Deduced a trap composed of 26 places in 505 ms of which 1 ms to minimize.
[2023-03-09 08:56:38] [INFO ] Deduced a trap composed of 56 places in 527 ms of which 1 ms to minimize.
[2023-03-09 08:56:39] [INFO ] Deduced a trap composed of 103 places in 519 ms of which 0 ms to minimize.
[2023-03-09 08:56:39] [INFO ] Deduced a trap composed of 68 places in 469 ms of which 0 ms to minimize.
[2023-03-09 08:56:40] [INFO ] Deduced a trap composed of 62 places in 399 ms of which 0 ms to minimize.
[2023-03-09 08:56:40] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 1 ms to minimize.
[2023-03-09 08:56:41] [INFO ] Deduced a trap composed of 38 places in 504 ms of which 1 ms to minimize.
[2023-03-09 08:56:41] [INFO ] Deduced a trap composed of 59 places in 320 ms of which 1 ms to minimize.
[2023-03-09 08:56:42] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 1 ms to minimize.
[2023-03-09 08:56:43] [INFO ] Deduced a trap composed of 56 places in 347 ms of which 1 ms to minimize.
[2023-03-09 08:56:43] [INFO ] Deduced a trap composed of 98 places in 443 ms of which 0 ms to minimize.
[2023-03-09 08:56:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8665 ms
[2023-03-09 08:56:44] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 338 ms.
[2023-03-09 08:56:44] [INFO ] Added : 3 causal constraints over 1 iterations in 788 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 REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 74 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 79 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 08:56:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:56:45] [INFO ] Invariant cache hit.
[2023-03-09 08:56:45] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-09 08:56:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:56:45] [INFO ] Invariant cache hit.
[2023-03-09 08:56:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:56:48] [INFO ] Implicit Places using invariants and state equation in 2499 ms returned []
Implicit Place search using SMT with State Equation took 2999 ms to find 0 implicit places.
[2023-03-09 08:56:48] [INFO ] Redundant transitions in 233 ms returned []
[2023-03-09 08:56:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:56:48] [INFO ] Invariant cache hit.
[2023-03-09 08:56:49] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4410 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-02 in 31461 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-09 08:56:49] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2023-03-09 08:56:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 08:56:49] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-09 08:56:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:50] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-09 08:56:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:56:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:50] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2023-03-09 08:56:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:56:50] [INFO ] [Nat]Added 283 Read/Feed constraints in 229 ms returned sat
[2023-03-09 08:56:51] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 1 ms to minimize.
[2023-03-09 08:56:52] [INFO ] Deduced a trap composed of 26 places in 406 ms of which 1 ms to minimize.
[2023-03-09 08:56:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1148 ms
[2023-03-09 08:56:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 256 ms.
[2023-03-09 08:56:52] [INFO ] Added : 2 causal constraints over 1 iterations in 573 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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 68 ms. 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-09 08:56:52] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 6466 ms. (steps per millisecond=154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1959 ms. (steps per millisecond=510 ) properties (out of 1) seen :0
[2023-03-09 08:57:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 08:57:01] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-09 08:57:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:01] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2023-03-09 08:57:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:02] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2023-03-09 08:57:02] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:57:02] [INFO ] [Nat]Added 283 Read/Feed constraints in 204 ms returned sat
[2023-03-09 08:57:03] [INFO ] Deduced a trap composed of 17 places in 408 ms of which 1 ms to minimize.
[2023-03-09 08:57:03] [INFO ] Deduced a trap composed of 26 places in 378 ms of which 1 ms to minimize.
[2023-03-09 08:57:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1020 ms
[2023-03-09 08:57:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 213 ms.
[2023-03-09 08:57:04] [INFO ] Added : 2 causal constraints over 1 iterations in 646 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 REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 08:57:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:04] [INFO ] Invariant cache hit.
[2023-03-09 08:57:05] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-09 08:57:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:05] [INFO ] Invariant cache hit.
[2023-03-09 08:57:05] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:57:07] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
[2023-03-09 08:57:07] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-09 08:57:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:07] [INFO ] Invariant cache hit.
[2023-03-09 08:57:08] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4033 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-08 in 19166 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-09 08:57:08] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2023-03-09 08:57:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 08:57:08] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-09 08:57:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:09] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-09 08:57:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:09] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2023-03-09 08:57:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:57:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 125 ms returned sat
[2023-03-09 08:57:10] [INFO ] Deduced a trap composed of 35 places in 334 ms of which 1 ms to minimize.
[2023-03-09 08:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 483 ms
[2023-03-09 08:57:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 224 ms.
[2023-03-09 08:57:11] [INFO ] Added : 4 causal constraints over 1 iterations in 567 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 REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. 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-09 08:57:11] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 11 resets, run finished after 6808 ms. (steps per millisecond=146 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1952 ms. (steps per millisecond=512 ) properties (out of 1) seen :0
[2023-03-09 08:57:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 08:57:20] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-09 08:57:20] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:20] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2023-03-09 08:57:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:57:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:21] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-09 08:57:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:57:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 136 ms returned sat
[2023-03-09 08:57:22] [INFO ] Deduced a trap composed of 76 places in 413 ms of which 1 ms to minimize.
[2023-03-09 08:57:22] [INFO ] Deduced a trap composed of 83 places in 380 ms of which 1 ms to minimize.
[2023-03-09 08:57:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1007 ms
[2023-03-09 08:57:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 217 ms.
[2023-03-09 08:57:23] [INFO ] Added : 4 causal constraints over 1 iterations in 459 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 REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY 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-09 08:57:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:23] [INFO ] Invariant cache hit.
[2023-03-09 08:57:23] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-09 08:57:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:23] [INFO ] Invariant cache hit.
[2023-03-09 08:57:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:57:25] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2023-03-09 08:57:25] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-09 08:57:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:25] [INFO ] Invariant cache hit.
[2023-03-09 08:57:26] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3637 ms. 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-09 08:57:26] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7579 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2154 ms. (steps per millisecond=464 ) properties (out of 1) seen :1
[2023-03-09 08:57:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 08:57:36] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-09 08:57:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:37] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2023-03-09 08:57:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:38] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2023-03-09 08:57:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:57:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 168 ms returned sat
[2023-03-09 08:57:38] [INFO ] Deduced a trap composed of 76 places in 433 ms of which 1 ms to minimize.
[2023-03-09 08:57:39] [INFO ] Deduced a trap composed of 83 places in 277 ms of which 0 ms to minimize.
[2023-03-09 08:57:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 935 ms
[2023-03-09 08:57:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 211 ms.
[2023-03-09 08:57:39] [INFO ] Added : 4 causal constraints over 1 iterations in 481 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 REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 101 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 79 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 08:57:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:39] [INFO ] Invariant cache hit.
[2023-03-09 08:57:40] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-09 08:57:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:40] [INFO ] Invariant cache hit.
[2023-03-09 08:57:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 08:57:42] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
[2023-03-09 08:57:42] [INFO ] Redundant transitions in 162 ms returned []
[2023-03-09 08:57:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 08:57:42] [INFO ] Invariant cache hit.
[2023-03-09 08:57:43] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4075 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-11 in 35314 ms.
[2023-03-09 08:57:44] [INFO ] Flatten gal took : 474 ms
[2023-03-09 08:57:44] [INFO ] Applying decomposition
[2023-03-09 08:57:45] [INFO ] Flatten gal took : 208 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1266988306908609596.txt' '-o' '/tmp/graph1266988306908609596.bin' '-w' '/tmp/graph1266988306908609596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1266988306908609596.bin' '-l' '-1' '-v' '-w' '/tmp/graph1266988306908609596.weights' '-q' '0' '-e' '0.001'
[2023-03-09 08:57:45] [INFO ] Decomposing Gal with order
[2023-03-09 08:57:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 08:57:46] [INFO ] Removed a total of 424 redundant transitions.
[2023-03-09 08:57:46] [INFO ] Flatten gal took : 364 ms
[2023-03-09 08:57:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 25 ms.
[2023-03-09 08:57:46] [INFO ] Time to serialize gal into /tmp/UpperBounds10598727237332096457.gal : 60 ms
[2023-03-09 08:57:46] [INFO ] Time to serialize properties into /tmp/UpperBounds14523203441950853426.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10598727237332096457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14523203441950853426.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds14523203441950853426.prop.
Detected timeout of ITS tools.
[2023-03-09 09:18:37] [INFO ] Flatten gal took : 1372 ms
[2023-03-09 09:18:38] [INFO ] Time to serialize gal into /tmp/UpperBounds7152479596508365984.gal : 163 ms
[2023-03-09 09:18:38] [INFO ] Time to serialize properties into /tmp/UpperBounds2594557883829639815.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7152479596508365984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2594557883829639815.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds2594557883829639815.prop.
Detected timeout of ITS tools.
[2023-03-09 09:39:25] [INFO ] Flatten gal took : 871 ms
[2023-03-09 09:39:31] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-09 09:39:31] [INFO ] Transformed 269 places.
[2023-03-09 09:39:31] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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-09 09:39:31] [INFO ] Time to serialize gal into /tmp/UpperBounds9664823642253591705.gal : 25 ms
[2023-03-09 09:39:31] [INFO ] Time to serialize properties into /tmp/UpperBounds12931893176184382863.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9664823642253591705.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12931893176184382863.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12931893176184382863.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5358632 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16198060 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r037-tajo-167813690300389"
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 ;