Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r491-tall-167912710500453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Szymanski-PT-b02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710500453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.6K Feb 26 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M Mar 5 18:23 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 Szymanski-PT-b02-UpperBounds-00
FORMULA_NAME Szymanski-PT-b02-UpperBounds-01
FORMULA_NAME Szymanski-PT-b02-UpperBounds-02
FORMULA_NAME Szymanski-PT-b02-UpperBounds-03
FORMULA_NAME Szymanski-PT-b02-UpperBounds-04
FORMULA_NAME Szymanski-PT-b02-UpperBounds-05
FORMULA_NAME Szymanski-PT-b02-UpperBounds-06
FORMULA_NAME Szymanski-PT-b02-UpperBounds-07
FORMULA_NAME Szymanski-PT-b02-UpperBounds-08
FORMULA_NAME Szymanski-PT-b02-UpperBounds-09
FORMULA_NAME Szymanski-PT-b02-UpperBounds-10
FORMULA_NAME Szymanski-PT-b02-UpperBounds-11
FORMULA_NAME Szymanski-PT-b02-UpperBounds-12
FORMULA_NAME Szymanski-PT-b02-UpperBounds-13
FORMULA_NAME Szymanski-PT-b02-UpperBounds-14
FORMULA_NAME Szymanski-PT-b02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679254698440

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b02
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 19:38:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 19:38:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:38:20] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2023-03-19 19:38:20] [INFO ] Transformed 568 places.
[2023-03-19 19:38:20] [INFO ] Transformed 8320 transitions.
[2023-03-19 19:38:20] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 463 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 19:38:20] [INFO ] Computed 3 place invariants in 83 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :4
FORMULA Szymanski-PT-b02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :2
FORMULA Szymanski-PT-b02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
[2023-03-19 19:38:21] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 19:38:21] [INFO ] Computed 3 place invariants in 30 ms
[2023-03-19 19:38:21] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-19 19:38:21] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 19:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:22] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2023-03-19 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:38:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 19:38:22] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:23] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2023-03-19 19:38:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:38:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 19:38:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 4023 ms returned unknown
[2023-03-19 19:38:27] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-19 19:38:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-19 19:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:27] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2023-03-19 19:38:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:38:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 19:38:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:28] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2023-03-19 19:38:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 19:38:32] [INFO ] [Nat]Added 147 Read/Feed constraints in 4393 ms returned unknown
[2023-03-19 19:38:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 19:38:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:33] [INFO ] [Real]Absence check using state equation in 612 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 2] Max seen :[0, 0, 2]
FORMULA Szymanski-PT-b02-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 461 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:38:34] [INFO ] Computed 3 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3484 ms. (steps per millisecond=287 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 2) seen :0
[2023-03-19 19:38:40] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:38:40] [INFO ] Computed 3 place invariants in 23 ms
[2023-03-19 19:38:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:40] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2023-03-19 19:38:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:38:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:38:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:41] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2023-03-19 19:38:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:38:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 19:38:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 6040 ms returned unknown
[2023-03-19 19:38:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:48] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-19 19:38:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:38:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:38:48] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2023-03-19 19:38:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 19:38:54] [INFO ] [Nat]Added 147 Read/Feed constraints in 5842 ms returned sat
[2023-03-19 19:38:55] [INFO ] Deduced a trap composed of 84 places in 593 ms of which 7 ms to minimize.
[2023-03-19 19:38:55] [INFO ] Deduced a trap composed of 129 places in 659 ms of which 1 ms to minimize.
[2023-03-19 19:38:56] [INFO ] Deduced a trap composed of 78 places in 650 ms of which 1 ms to minimize.
[2023-03-19 19:38:57] [INFO ] Deduced a trap composed of 129 places in 664 ms of which 4 ms to minimize.
[2023-03-19 19:38:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2873 ms
[2023-03-19 19:38:58] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 566 ms.
[2023-03-19 19:38:58] [INFO ] Added : 0 causal constraints over 0 iterations in 726 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 411 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 242 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 19:39:01] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:01] [INFO ] Invariant cache hit.
[2023-03-19 19:39:02] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-19 19:39:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:02] [INFO ] Invariant cache hit.
[2023-03-19 19:39:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:39:04] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
[2023-03-19 19:39:05] [INFO ] Redundant transitions in 975 ms returned []
[2023-03-19 19:39:05] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:05] [INFO ] Invariant cache hit.
[2023-03-19 19:39:08] [INFO ] Dead Transitions using invariants and state equation in 2569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6584 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b02-UpperBounds-00
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:39:08] [INFO ] Computed 3 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-19 19:39:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:39:08] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-19 19:39:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:39:08] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-19 19:39:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:39:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:39:09] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2023-03-19 19:39:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:39:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 19:39:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 4200 ms returned sat
[2023-03-19 19:39:14] [INFO ] Deduced a trap composed of 129 places in 602 ms of which 1 ms to minimize.
[2023-03-19 19:39: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 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 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 217 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:39:14] [INFO ] Computed 3 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3311 ms. (steps per millisecond=302 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1322 ms. (steps per millisecond=756 ) properties (out of 1) seen :0
[2023-03-19 19:39:19] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:39:19] [INFO ] Computed 3 place invariants in 19 ms
[2023-03-19 19:39:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 19:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:39:19] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-19 19:39:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:39:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:39:20] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2023-03-19 19:39:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:39:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 19:39:24] [INFO ] [Nat]Added 147 Read/Feed constraints in 3964 ms returned sat
[2023-03-19 19:39:24] [INFO ] Deduced a trap composed of 129 places in 584 ms of which 0 ms to minimize.
[2023-03-19 19:39:25] [INFO ] Deduced a trap composed of 129 places in 609 ms of which 0 ms to minimize.
[2023-03-19 19:39:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1433 ms
[2023-03-19 19:39:26] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 351 ms.
[2023-03-19 19:39:26] [INFO ] Added : 2 causal constraints over 1 iterations in 596 ms. Result :sat
Minimization took 2051 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 19:39:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:29] [INFO ] Invariant cache hit.
[2023-03-19 19:39:29] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-19 19:39:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:29] [INFO ] Invariant cache hit.
[2023-03-19 19:39:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:39:31] [INFO ] Implicit Places using invariants and state equation in 2143 ms returned []
Implicit Place search using SMT with State Equation took 2669 ms to find 0 implicit places.
[2023-03-19 19:39:32] [INFO ] Redundant transitions in 636 ms returned []
[2023-03-19 19:39:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:32] [INFO ] Invariant cache hit.
[2023-03-19 19:39:34] [INFO ] Dead Transitions using invariants and state equation in 2533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6031 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b02-UpperBounds-00 in 26675 ms.
Starting property specific reduction for Szymanski-PT-b02-UpperBounds-07
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:39:34] [INFO ] Computed 3 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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-19 19:39:34] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:39:35] [INFO ] Computed 3 place invariants in 18 ms
[2023-03-19 19:39:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-19 19:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:39:35] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-19 19:39:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:39:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 19:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:39:36] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2023-03-19 19:39:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:39:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 19:39:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 4437 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:39:40] [INFO ] Computed 3 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3588 ms. (steps per millisecond=278 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1272 ms. (steps per millisecond=786 ) properties (out of 1) seen :0
[2023-03-19 19:39:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 19:39:45] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-19 19:39:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:39:46] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2023-03-19 19:39:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:39:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 19:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:39:46] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2023-03-19 19:39:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:39:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 19:39:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 6040 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 19:39:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:53] [INFO ] Invariant cache hit.
[2023-03-19 19:39:53] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-19 19:39:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:53] [INFO ] Invariant cache hit.
[2023-03-19 19:39:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:39:56] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 2899 ms to find 0 implicit places.
[2023-03-19 19:39:56] [INFO ] Redundant transitions in 886 ms returned []
[2023-03-19 19:39:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 19:39:56] [INFO ] Invariant cache hit.
[2023-03-19 19:39:59] [INFO ] Dead Transitions using invariants and state equation in 2467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6450 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b02-UpperBounds-07 in 24575 ms.
[2023-03-19 19:40:00] [INFO ] Flatten gal took : 547 ms
[2023-03-19 19:40:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-19 19:40:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7808 transitions and 31360 arcs took 36 ms.
Total runtime 99986 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Szymanski (PT), instance b02
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 305 places, 7808 transitions, 31360 arcs.
Final Score: 102660.048
Took : 124 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1679256591317

--------------------
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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 695 Killed ${SMART}/smart ${INPUT_SM}

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="Szymanski-PT-b02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Szymanski-PT-b02, 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 r491-tall-167912710500453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b02.tgz
mv Szymanski-PT-b02 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 ;