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.r042-tajo-167813695700389.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 marciexred
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 r042-tajo-167813695700389
=====================================================================

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

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 14:41:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 14:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:41:54] [INFO ] Load time of PNML (sax parser for PT used): 605 ms
[2023-03-13 14:41:55] [INFO ] Transformed 754 places.
[2023-03-13 14:41:55] [INFO ] Transformed 27370 transitions.
[2023-03-13 14:41:55] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 792 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 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-13 14:41:55] [INFO ] Computed 10 place invariants in 60 ms
Incomplete random walk after 10001 steps, including 174 resets, run finished after 183 ms. (steps per millisecond=54 ) 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 55 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
[2023-03-13 14:41:55] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-13 14:41:55] [INFO ] Computed 10 place invariants in 32 ms
[2023-03-13 14:41:56] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-13 14:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:41:56] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2023-03-13 14:41:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:41:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 14:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:41:57] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2023-03-13 14:41:57] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 14:41:57] [INFO ] [Nat]Added 303 Read/Feed constraints in 115 ms returned sat
[2023-03-13 14:41:58] [INFO ] Deduced a trap composed of 20 places in 532 ms of which 23 ms to minimize.
[2023-03-13 14:41:58] [INFO ] Deduced a trap composed of 29 places in 508 ms of which 1 ms to minimize.
[2023-03-13 14:41:59] [INFO ] Deduced a trap composed of 14 places in 454 ms of which 1 ms to minimize.
[2023-03-13 14:42:00] [INFO ] Deduced a trap composed of 47 places in 509 ms of which 3 ms to minimize.
[2023-03-13 14:42:00] [INFO ] Deduced a trap composed of 59 places in 509 ms of which 1 ms to minimize.
[2023-03-13 14:42:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3084 ms
[2023-03-13 14:42:01] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 349 ms.
[2023-03-13 14:42:02] [INFO ] Deduced a trap composed of 65 places in 492 ms of which 1 ms to minimize.
[2023-03-13 14:42:02] [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-13 14:42:02] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 14:42:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:02] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2023-03-13 14:42:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:42:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 14:42:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:03] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2023-03-13 14:42:03] [INFO ] [Nat]Added 303 Read/Feed constraints in 188 ms returned sat
[2023-03-13 14:42:04] [INFO ] Deduced a trap composed of 61 places in 492 ms of which 0 ms to minimize.
[2023-03-13 14:42:04] [INFO ] Deduced a trap composed of 57 places in 450 ms of which 1 ms to minimize.
[2023-03-13 14:42:05] [INFO ] Deduced a trap composed of 58 places in 396 ms of which 0 ms to minimize.
[2023-03-13 14:42:05] [INFO ] Deduced a trap composed of 47 places in 410 ms of which 1 ms to minimize.
[2023-03-13 14:42:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2346 ms
[2023-03-13 14:42:06] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 453 ms.
[2023-03-13 14:42:07] [INFO ] Deduced a trap composed of 64 places in 458 ms of which 0 ms to minimize.
[2023-03-13 14:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 659 ms
[2023-03-13 14:42:07] [INFO ] Added : 7 causal constraints over 3 iterations in 1851 ms. Result :sat
[2023-03-13 14:42:07] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 14:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:08] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2023-03-13 14:42:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:42:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 14:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:09] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-13 14:42:09] [INFO ] [Nat]Added 303 Read/Feed constraints in 192 ms returned sat
[2023-03-13 14:42:09] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 1 ms to minimize.
[2023-03-13 14:42:09] [INFO ] Deduced a trap composed of 60 places in 310 ms of which 0 ms to minimize.
[2023-03-13 14:42:10] [INFO ] Deduced a trap composed of 47 places in 329 ms of which 1 ms to minimize.
[2023-03-13 14:42:10] [INFO ] Deduced a trap composed of 61 places in 326 ms of which 0 ms to minimize.
[2023-03-13 14:42:11] [INFO ] Deduced a trap composed of 60 places in 340 ms of which 1 ms to minimize.
[2023-03-13 14:42:11] [INFO ] Deduced a trap composed of 59 places in 321 ms of which 0 ms to minimize.
[2023-03-13 14:42:11] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-13 14:42:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2807 ms
[2023-03-13 14:42:12] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 313 ms.
[2023-03-13 14:42:13] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2023-03-13 14:42:13] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 313 ms
[2023-03-13 14:42:14] [INFO ] Deduced a trap composed of 15 places in 755 ms of which 0 ms to minimize.
[2023-03-13 14:42:14] [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: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)
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 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.14 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 313 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 314 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-13 14:42:14] [INFO ] Computed 8 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 6941 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2045 ms. (steps per millisecond=488 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2062 ms. (steps per millisecond=484 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1926 ms. (steps per millisecond=519 ) properties (out of 3) seen :0
[2023-03-13 14:42:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 14:42:27] [INFO ] Computed 8 place invariants in 38 ms
[2023-03-13 14:42:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:28] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-13 14:42:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:42:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 14:42:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:28] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-13 14:42:28] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:42:29] [INFO ] [Nat]Added 283 Read/Feed constraints in 167 ms returned sat
[2023-03-13 14:42:29] [INFO ] Deduced a trap composed of 54 places in 540 ms of which 0 ms to minimize.
[2023-03-13 14:42:30] [INFO ] Deduced a trap composed of 85 places in 512 ms of which 1 ms to minimize.
[2023-03-13 14:42:31] [INFO ] Deduced a trap composed of 129 places in 479 ms of which 0 ms to minimize.
[2023-03-13 14:42:31] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 0 ms to minimize.
[2023-03-13 14:42:32] [INFO ] Deduced a trap composed of 56 places in 398 ms of which 1 ms to minimize.
[2023-03-13 14:42:32] [INFO ] Deduced a trap composed of 103 places in 489 ms of which 0 ms to minimize.
[2023-03-13 14:42:33] [INFO ] Deduced a trap composed of 68 places in 466 ms of which 0 ms to minimize.
[2023-03-13 14:42:33] [INFO ] Deduced a trap composed of 62 places in 464 ms of which 1 ms to minimize.
[2023-03-13 14:42:34] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 1 ms to minimize.
[2023-03-13 14:42:35] [INFO ] Deduced a trap composed of 38 places in 460 ms of which 0 ms to minimize.
[2023-03-13 14:42:35] [INFO ] Deduced a trap composed of 59 places in 455 ms of which 0 ms to minimize.
[2023-03-13 14:42:36] [INFO ] Deduced a trap composed of 35 places in 436 ms of which 0 ms to minimize.
[2023-03-13 14:42:36] [INFO ] Deduced a trap composed of 56 places in 482 ms of which 1 ms to minimize.
[2023-03-13 14:42:37] [INFO ] Deduced a trap composed of 98 places in 486 ms of which 1 ms to minimize.
[2023-03-13 14:42:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8766 ms
[2023-03-13 14:42:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 330 ms.
[2023-03-13 14:42:38] [INFO ] Added : 3 causal constraints over 1 iterations in 794 ms. Result :sat
[2023-03-13 14:42:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:42:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:39] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2023-03-13 14:42:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:42:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:42:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:40] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2023-03-13 14:42:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 238 ms returned sat
[2023-03-13 14:42:40] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 1 ms to minimize.
[2023-03-13 14:42:41] [INFO ] Deduced a trap composed of 26 places in 345 ms of which 0 ms to minimize.
[2023-03-13 14:42:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 951 ms
[2023-03-13 14:42:41] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 376 ms.
[2023-03-13 14:42:42] [INFO ] Added : 2 causal constraints over 1 iterations in 799 ms. Result :sat
[2023-03-13 14:42:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:43] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2023-03-13 14:42:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:42:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:43] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2023-03-13 14:42:43] [INFO ] [Nat]Added 283 Read/Feed constraints in 120 ms returned sat
[2023-03-13 14:42:44] [INFO ] Deduced a trap composed of 76 places in 460 ms of which 1 ms to minimize.
[2023-03-13 14:42:44] [INFO ] Deduced a trap composed of 83 places in 477 ms of which 0 ms to minimize.
[2023-03-13 14:42:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1203 ms
[2023-03-13 14:42:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 286 ms.
[2023-03-13 14:42:45] [INFO ] Added : 4 causal constraints over 1 iterations in 521 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 REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 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 66 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 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 14:42:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:42:45] [INFO ] Invariant cache hit.
[2023-03-13 14:42:46] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-13 14:42:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:42:46] [INFO ] Invariant cache hit.
[2023-03-13 14:42:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:42:48] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
[2023-03-13 14:42:48] [INFO ] Redundant transitions in 304 ms returned []
[2023-03-13 14:42:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:42:48] [INFO ] Invariant cache hit.
[2023-03-13 14:42:49] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3855 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-13 14:42:49] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-13 14:42:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 14:42:49] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-13 14:42:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:50] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2023-03-13 14:42:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:42:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:42:50] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-13 14:42:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:42:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 195 ms returned sat
[2023-03-13 14:42:51] [INFO ] Deduced a trap composed of 54 places in 620 ms of which 0 ms to minimize.
[2023-03-13 14:42:52] [INFO ] Deduced a trap composed of 85 places in 607 ms of which 1 ms to minimize.
[2023-03-13 14:42:53] [INFO ] Deduced a trap composed of 129 places in 603 ms of which 1 ms to minimize.
[2023-03-13 14:42:53] [INFO ] Deduced a trap composed of 26 places in 443 ms of which 0 ms to minimize.
[2023-03-13 14:42:54] [INFO ] Deduced a trap composed of 56 places in 491 ms of which 0 ms to minimize.
[2023-03-13 14:42:55] [INFO ] Deduced a trap composed of 103 places in 478 ms of which 0 ms to minimize.
[2023-03-13 14:42:55] [INFO ] Deduced a trap composed of 68 places in 432 ms of which 0 ms to minimize.
[2023-03-13 14:42:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 88 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 90 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-13 14:42:55] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 5736 ms. (steps per millisecond=174 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1735 ms. (steps per millisecond=576 ) properties (out of 1) seen :0
[2023-03-13 14:43:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 14:43:03] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-13 14:43:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:03] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2023-03-13 14:43:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:43:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:04] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2023-03-13 14:43:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:43:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 175 ms returned sat
[2023-03-13 14:43:05] [INFO ] Deduced a trap composed of 54 places in 453 ms of which 1 ms to minimize.
[2023-03-13 14:43:05] [INFO ] Deduced a trap composed of 85 places in 440 ms of which 0 ms to minimize.
[2023-03-13 14:43:06] [INFO ] Deduced a trap composed of 129 places in 460 ms of which 0 ms to minimize.
[2023-03-13 14:43:06] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 0 ms to minimize.
[2023-03-13 14:43:07] [INFO ] Deduced a trap composed of 56 places in 389 ms of which 0 ms to minimize.
[2023-03-13 14:43:07] [INFO ] Deduced a trap composed of 103 places in 380 ms of which 1 ms to minimize.
[2023-03-13 14:43:08] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 1 ms to minimize.
[2023-03-13 14:43:08] [INFO ] Deduced a trap composed of 62 places in 363 ms of which 1 ms to minimize.
[2023-03-13 14:43:09] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 1 ms to minimize.
[2023-03-13 14:43:09] [INFO ] Deduced a trap composed of 38 places in 434 ms of which 0 ms to minimize.
[2023-03-13 14:43:10] [INFO ] Deduced a trap composed of 59 places in 403 ms of which 0 ms to minimize.
[2023-03-13 14:43:10] [INFO ] Deduced a trap composed of 35 places in 403 ms of which 2 ms to minimize.
[2023-03-13 14:43:11] [INFO ] Deduced a trap composed of 56 places in 416 ms of which 0 ms to minimize.
[2023-03-13 14:43:11] [INFO ] Deduced a trap composed of 98 places in 311 ms of which 1 ms to minimize.
[2023-03-13 14:43:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7318 ms
[2023-03-13 14:43:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 267 ms.
[2023-03-13 14:43:12] [INFO ] Added : 3 causal constraints over 1 iterations in 714 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 76 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 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 14:43:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:13] [INFO ] Invariant cache hit.
[2023-03-13 14:43:13] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-13 14:43:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:13] [INFO ] Invariant cache hit.
[2023-03-13 14:43:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:43:15] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2023-03-13 14:43:15] [INFO ] Redundant transitions in 185 ms returned []
[2023-03-13 14:43:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:15] [INFO ] Invariant cache hit.
[2023-03-13 14:43:16] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3683 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-02 in 27005 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-13 14:43:16] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-13 14:43:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 14:43:16] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-13 14:43:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:17] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-13 14:43:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:43:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:17] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2023-03-13 14:43:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:43:17] [INFO ] [Nat]Added 283 Read/Feed constraints in 167 ms returned sat
[2023-03-13 14:43:18] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 1 ms to minimize.
[2023-03-13 14:43:18] [INFO ] Deduced a trap composed of 26 places in 391 ms of which 0 ms to minimize.
[2023-03-13 14:43:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1059 ms
[2023-03-13 14:43:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 281 ms.
[2023-03-13 14:43:19] [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 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 53 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-13 14:43:19] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6580 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2001 ms. (steps per millisecond=499 ) properties (out of 1) seen :0
[2023-03-13 14:43:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 14:43:28] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-13 14:43:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:28] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2023-03-13 14:43:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:43:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:29] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-13 14:43:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:43:29] [INFO ] [Nat]Added 283 Read/Feed constraints in 240 ms returned sat
[2023-03-13 14:43:30] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 0 ms to minimize.
[2023-03-13 14:43:30] [INFO ] Deduced a trap composed of 26 places in 394 ms of which 1 ms to minimize.
[2023-03-13 14:43:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1072 ms
[2023-03-13 14:43:31] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 294 ms.
[2023-03-13 14:43:31] [INFO ] Added : 2 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 REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 14:43:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:32] [INFO ] Invariant cache hit.
[2023-03-13 14:43:32] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-13 14:43:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:32] [INFO ] Invariant cache hit.
[2023-03-13 14:43:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:43:34] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
[2023-03-13 14:43:34] [INFO ] Redundant transitions in 250 ms returned []
[2023-03-13 14:43:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:34] [INFO ] Invariant cache hit.
[2023-03-13 14:43:35] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3792 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-08 in 19160 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-13 14:43:35] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
[2023-03-13 14:43:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 14:43:35] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-13 14:43:35] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:36] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-13 14:43:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:43:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:37] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2023-03-13 14:43:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:43:37] [INFO ] [Nat]Added 283 Read/Feed constraints in 139 ms returned sat
[2023-03-13 14:43:37] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 0 ms to minimize.
[2023-03-13 14:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 549 ms
[2023-03-13 14:43:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 307 ms.
[2023-03-13 14:43:38] [INFO ] Added : 4 causal constraints over 1 iterations in 849 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 62 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 64 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-13 14:43:38] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6624 ms. (steps per millisecond=150 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2101 ms. (steps per millisecond=475 ) properties (out of 1) seen :0
[2023-03-13 14:43:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 14:43:47] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-13 14:43:47] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:48] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-13 14:43:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:43:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:43:48] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2023-03-13 14:43:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:43:48] [INFO ] [Nat]Added 283 Read/Feed constraints in 103 ms returned sat
[2023-03-13 14:43:49] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 2 ms to minimize.
[2023-03-13 14:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2023-03-13 14:43:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 276 ms.
[2023-03-13 14:43:50] [INFO ] Added : 4 causal constraints over 1 iterations in 814 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 92 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 92 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 96 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 14:43:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:50] [INFO ] Invariant cache hit.
[2023-03-13 14:43:50] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-13 14:43:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:50] [INFO ] Invariant cache hit.
[2023-03-13 14:43:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 14:43:52] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
[2023-03-13 14:43:52] [INFO ] Redundant transitions in 154 ms returned []
[2023-03-13 14:43:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 14:43:52] [INFO ] Invariant cache hit.
[2023-03-13 14:43:53] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3523 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-11 in 18102 ms.
[2023-03-13 14:43:54] [INFO ] Flatten gal took : 291 ms
[2023-03-13 14:43:54] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-13 14:43:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 15 ms.
Total runtime 120069 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BugTracking_PT_q8
(NrP: 269 NrTr: 3871 NrArc: 19045)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.091sec

net check time: 0m 0.003sec

init dd package: 0m 2.985sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10566296 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16081840 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.055sec

6273 13987 20407 27732 33382 38015 43051 46810 50764 52637 55330 58241 61628 61867 65220 68978 73824 77846 76354 105091 129831 136776 149954 150467 165965 162418 162902 163837 161264

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="marciexred"
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 marciexred"
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 r042-tajo-167813695700389"
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 ;