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.r043-tajo-167813697200670.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 smartxred
Input is CANConstruction-PT-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697200670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678799132327

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:05:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 13:05:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:05:34] [INFO ] Load time of PNML (sax parser for PT used): 452 ms
[2023-03-14 13:05:34] [INFO ] Transformed 10642 places.
[2023-03-14 13:05:35] [INFO ] Transformed 20160 transitions.
[2023-03-14 13:05:35] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 682 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 16) seen :4
FORMULA CANConstruction-PT-070-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 20160 rows 10642 cols
[2023-03-14 13:05:36] [INFO ] Computed 141 place invariants in 293 ms
[2023-03-14 13:05:40] [INFO ] [Real]Absence check using 71 positive place invariants in 291 ms returned sat
[2023-03-14 13:05:40] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 96 ms returned sat
[2023-03-14 13:05:41] [INFO ] After 4863ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-14 13:05:45] [INFO ] [Nat]Absence check using 71 positive place invariants in 265 ms returned sat
[2023-03-14 13:05:45] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 91 ms returned sat
[2023-03-14 13:06:06] [INFO ] After 18876ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-14 13:06:06] [INFO ] State equation strengthened by 9730 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-14 13:06:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:06:06] [INFO ] After 25328ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:11
FORMULA CANConstruction-PT-070-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-070-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 170 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 10642 transition count 19695
Reduce places removed 465 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 474 rules applied. Total rules applied 939 place count 10177 transition count 19686
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 948 place count 10168 transition count 19686
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 948 place count 10168 transition count 19682
Deduced a syphon composed of 4 places in 22 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 956 place count 10164 transition count 19682
Discarding 4688 places :
Symmetric choice reduction at 3 with 4688 rule applications. Total rules 5644 place count 5476 transition count 10306
Iterating global reduction 3 with 4688 rules applied. Total rules applied 10332 place count 5476 transition count 10306
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 10462 place count 5411 transition count 10241
Free-agglomeration rule applied 45 times.
Iterating global reduction 3 with 45 rules applied. Total rules applied 10507 place count 5411 transition count 10196
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 10552 place count 5366 transition count 10196
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 10557 place count 5366 transition count 10191
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 10562 place count 5361 transition count 10191
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 5 with 96 rules applied. Total rules applied 10658 place count 5361 transition count 10191
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 10660 place count 5361 transition count 10191
Applied a total of 10660 rules in 8526 ms. Remains 5361 /10642 variables (removed 5281) and now considering 10191/20160 (removed 9969) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8529 ms. Remains : 5361/10642 places, 10191/20160 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 10) seen :2
FORMULA CANConstruction-PT-070-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 10191 rows 5361 cols
[2023-03-14 13:06:15] [INFO ] Computed 141 place invariants in 88 ms
[2023-03-14 13:06:17] [INFO ] [Real]Absence check using 71 positive place invariants in 143 ms returned sat
[2023-03-14 13:06:17] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 44 ms returned sat
[2023-03-14 13:06:17] [INFO ] After 1302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 13:06:18] [INFO ] [Nat]Absence check using 71 positive place invariants in 210 ms returned sat
[2023-03-14 13:06:18] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 58 ms returned sat
[2023-03-14 13:06:25] [INFO ] After 5801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 13:06:25] [INFO ] State equation strengthened by 9837 read => feed constraints.
[2023-03-14 13:06:31] [INFO ] After 5909ms SMT Verify possible using 9837 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-14 13:06:37] [INFO ] After 12214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3928 ms.
[2023-03-14 13:06:41] [INFO ] After 24186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
FORMULA CANConstruction-PT-070-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 95 ms.
Support contains 121 out of 5361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5361/5361 places, 10191/10191 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5361 transition count 10190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5360 transition count 10190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 5357 transition count 10184
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 5357 transition count 10184
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 50 place count 5336 transition count 10163
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 5334 transition count 10164
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 5334 transition count 10164
Applied a total of 55 rules in 4646 ms. Remains 5334 /5361 variables (removed 27) and now considering 10164/10191 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4646 ms. Remains : 5334/5361 places, 10164/10191 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 70903 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70903 steps, saw 58617 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10164 rows 5334 cols
[2023-03-14 13:06:49] [INFO ] Computed 141 place invariants in 98 ms
[2023-03-14 13:06:51] [INFO ] [Real]Absence check using 71 positive place invariants in 121 ms returned sat
[2023-03-14 13:06:51] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 55 ms returned sat
[2023-03-14 13:06:51] [INFO ] After 1331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:06:52] [INFO ] [Nat]Absence check using 71 positive place invariants in 165 ms returned sat
[2023-03-14 13:06:52] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 55 ms returned sat
[2023-03-14 13:06:58] [INFO ] After 5525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:06:58] [INFO ] State equation strengthened by 9864 read => feed constraints.
[2023-03-14 13:07:04] [INFO ] After 6052ms SMT Verify possible using 9864 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:07:09] [INFO ] After 10895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3561 ms.
[2023-03-14 13:07:12] [INFO ] After 21701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
FORMULA CANConstruction-PT-070-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 106 ms.
Support contains 120 out of 5334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5334/5334 places, 10164/10164 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5333 transition count 10163
Applied a total of 2 rules in 1658 ms. Remains 5333 /5334 variables (removed 1) and now considering 10163/10164 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1659 ms. Remains : 5333/5334 places, 10163/10164 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 72668 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72668 steps, saw 59092 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10163 rows 5333 cols
[2023-03-14 13:07:18] [INFO ] Computed 141 place invariants in 98 ms
[2023-03-14 13:07:19] [INFO ] After 846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 13:07:20] [INFO ] [Nat]Absence check using 71 positive place invariants in 148 ms returned sat
[2023-03-14 13:07:20] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 63 ms returned sat
[2023-03-14 13:07:26] [INFO ] After 5229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 13:07:26] [INFO ] State equation strengthened by 9865 read => feed constraints.
[2023-03-14 13:07:30] [INFO ] After 4576ms SMT Verify possible using 9865 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:07:34] [INFO ] After 8429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2968 ms.
[2023-03-14 13:07:37] [INFO ] After 18374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 120 out of 5333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5333/5333 places, 10163/10163 transitions.
Applied a total of 0 rules in 1090 ms. Remains 5333 /5333 variables (removed 0) and now considering 10163/10163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1090 ms. Remains : 5333/5333 places, 10163/10163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5333/5333 places, 10163/10163 transitions.
Applied a total of 0 rules in 887 ms. Remains 5333 /5333 variables (removed 0) and now considering 10163/10163 (removed 0) transitions.
[2023-03-14 13:07:39] [INFO ] Invariant cache hit.
[2023-03-14 13:07:43] [INFO ] Implicit Places using invariants in 3754 ms returned []
Implicit Place search using SMT only with invariants took 3757 ms to find 0 implicit places.
[2023-03-14 13:07:43] [INFO ] Invariant cache hit.
[2023-03-14 13:07:48] [INFO ] Dead Transitions using invariants and state equation in 5397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10046 ms. Remains : 5333/5333 places, 10163/10163 transitions.
Graph (trivial) has 9562 edges and 5333 vertex of which 4327 / 5333 are part of one of the 62 SCC in 19 ms
Free SCC test removed 4265 places
Drop transitions removed 8446 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 8449 transitions.
Graph (complete) has 2188 edges and 1068 vertex of which 874 are kept as prefixes of interest. Removing 194 places using SCC suffix rule.2 ms
Discarding 194 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Ensure Unique test removed 1 places
Drop transitions removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 615 rules applied. Total rules applied 617 place count 873 transition count 1032
Reduce places removed 476 places and 0 transitions.
Ensure Unique test removed 468 transitions
Reduce isomorphic transitions removed 468 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Iterating post reduction 1 with 1030 rules applied. Total rules applied 1647 place count 396 transition count 479
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 2 with 151 rules applied. Total rules applied 1798 place count 311 transition count 413
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1798 place count 311 transition count 402
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1820 place count 300 transition count 402
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1829 place count 291 transition count 393
Iterating global reduction 3 with 9 rules applied. Total rules applied 1838 place count 291 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1840 place count 291 transition count 391
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1840 place count 291 transition count 388
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1846 place count 288 transition count 388
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1850 place count 286 transition count 386
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1858 place count 282 transition count 388
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1862 place count 282 transition count 384
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 1863 place count 281 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1864 place count 280 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 1865 place count 280 transition count 383
Free-agglomeration rule applied 33 times.
Iterating global reduction 5 with 33 rules applied. Total rules applied 1898 place count 280 transition count 350
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 1934 place count 246 transition count 348
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1935 place count 246 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1936 place count 245 transition count 347
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 1956 place count 245 transition count 347
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1971 place count 230 transition count 332
Iterating global reduction 7 with 15 rules applied. Total rules applied 1986 place count 230 transition count 332
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 7 with 27 rules applied. Total rules applied 2013 place count 203 transition count 305
Applied a total of 2013 rules in 169 ms. Remains 203 /5333 variables (removed 5130) and now considering 305/10163 (removed 9858) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 305 rows 203 cols
[2023-03-14 13:07:48] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-14 13:07:49] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 13:07:49] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 13:07:49] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 13:07:49] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 13:07:49] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-14 13:07:49] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:07:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-14 13:07:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5333 places, 10163 transitions and 40509 arcs took 52 ms.
[2023-03-14 13:07:50] [INFO ] Flatten gal took : 468 ms
Total runtime 135824 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANConstruction (PT), instance 070
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 5333 places, 10163 transitions, 40509 arcs.
Final Score: 1.5503072172E7
Took : 93 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANConstruction-PT-070-ReachabilityCardinality-06 (reachable &!potential( ( ( ( (tk(P606)) <= ( 0 ) ) | ( ( (tk(P3837)) <= (tk(P909)) ) | ( ( ( (tk(P4129)) <= ( 1 ) ) & ( (tk(P555)) <= (tk(P346)) ) ) & ( ( ( 1 ) <= (tk(P4494)) ) & ( ( ( 1 ) <= (tk(P4817)) ) | ( ( ( 1 ) <= (tk(P4711)) ) | ( ( (tk(P4981)) <= ( 0 ) ) & ( (tk(P4094)) <= ( 0 ) ) ) ) ) ) ) ) ) | ( ( ( (! ( (tk(P1750)) <= (tk(P4534)) )) & (! ( (tk(P5220)) <= (tk(P1490)) )) ) & ( (! ( (tk(P1120)) <= (tk(P604)) )) & ( (tk(P5169)) <= (tk(P168)) ) ) ) | ( ( ( ( 1 ) <= (tk(P4067)) ) & ( ( (tk(P4463)) <= (tk(P3706)) ) | ( (tk(P4487)) <= (tk(P3660)) ) ) ) | ( (! ( (tk(P2964)) <= ( 1 ) )) & (! ( (tk(P1102)) <= ( 1 ) )) ) ) ) )))
PROPERTY: CANConstruction-PT-070-ReachabilityCardinality-08 (reachable & potential(( ( (! ( (tk(P2404)) <= (tk(P1278)) )) & ( ( ( ( (! ( ( 1 ) <= (tk(P2139)) )) & ( ( 1 ) <= (tk(P4722)) ) ) & ( ( (tk(P3335)) <= (tk(P3003)) ) & ( (! ( ( 1 ) <= (tk(P3553)) )) & ( ( 1 ) <= (tk(P2377)) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P2607)) )) & (! ( (tk(P3465)) <= (tk(P4451)) )) ) & ( (! ( ( 1 ) <= (tk(P4184)) )) & ( (! ( ( 1 ) <= (tk(P2072)) )) & ( ( ( (tk(P3915)) <= (tk(P724)) ) & ( (tk(P4411)) <= (tk(P283)) ) ) | ( ( (! ( (tk(P27)) <= (tk(P120)) )) & (! ( (tk(P2097)) <= ( 1 ) )) ) | ( (! ( (tk(P4081)) <= ( 0 ) )) & (! ( ( 1 ) <= (tk(P4737)) )) ) ) ) ) ) ) ) | ( (! ( (tk(P4747)) <= ( 1 ) )) & ( ( (! ( (tk(P3628)) <= (tk(P1900)) )) | (! ( (tk(P15)) <= ( 0 ) )) ) | ( (! ( ( 1 ) <= (tk(P364)) )) | ( ( 1 ) <= (tk(P352)) ) ) ) ) ) ) & ( ( ( (tk(P2739)) <= ( 1 ) ) | ( ( (tk(P3551)) <= (tk(P2388)) ) | ( ( ( 1 ) <= (tk(P5121)) ) & ( (tk(P1973)) <= (tk(P265)) ) ) ) ) & ( (! ( (tk(P4914)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P4426)) )) ) ) )))
PROPERTY: CANConstruction-PT-070-ReachabilityCardinality-12 (reachable &!potential( ( ( ( (! ( ( 1 ) <= (tk(P1812)) )) | (! ( (tk(P4118)) <= ( 0 ) )) ) | ( (! ( (tk(P521)) <= (tk(P3772)) )) | ( ( ( 1 ) <= (tk(P270)) ) | (! ( (tk(P836)) <= (tk(P5062)) )) ) ) ) | ( ( ( (! ( (tk(P3533)) <= (tk(P690)) )) & (! ( (tk(P629)) <= (tk(P3639)) )) ) | ( ( (tk(P678)) <= (tk(P2715)) ) & (! ( (tk(P2457)) <= ( 0 ) )) ) ) | ( ( ( (! ( ( 1 ) <= (tk(P2873)) )) & (! ( (tk(P708)) <= (tk(P3717)) )) ) & ( ( (tk(P2810)) <= ( 0 ) ) & ( ( (tk(P3348)) <= ( 0 ) ) | ( (! ( ( 1 ) <= (tk(P4233)) )) & (! ( ( 1 ) <= (tk(P2609)) )) ) ) ) ) | ( ( ( (tk(P1933)) <= (tk(P2491)) ) & ( (tk(P2683)) <= ( 1 ) ) ) | ( (! ( (tk(P4209)) <= (tk(P3931)) )) & ( (! ( (tk(P48)) <= ( 1 ) )) | (! ( (tk(P3644)) <= (tk(P70)) )) ) ) ) ) ) )))
PROPERTY: CANConstruction-PT-070-ReachabilityCardinality-13 (reachable &!potential( ( ( (! ( ( 1 ) <= (tk(P1685)) )) | ( (! ( (tk(P5123)) <= (tk(P916)) )) | ( (tk(P4919)) <= (tk(P4655)) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P3557)) ) & ( (! ( (tk(P4393)) <= (tk(P3647)) )) | (! ( (tk(P2708)) <= (tk(P2765)) )) ) ) & ( ( ( (! ( ( 1 ) <= (tk(P3762)) )) | ( (tk(P4167)) <= ( 0 ) ) ) | ( ( (! ( ( 1 ) <= (tk(P1851)) )) & (! ( (tk(P2807)) <= ( 0 ) )) ) | ( ( ( 1 ) <= (tk(P1411)) ) & ( ( (tk(P148)) <= (tk(P3589)) ) & ( ( ( 1 ) <= (tk(P1477)) ) | ( (tk(P5109)) <= ( 1 ) ) ) ) ) ) ) & ( (! ( (tk(P2091)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P4314)) ) | ( ( 1 ) <= (tk(P852)) ) ) ) ) ) | ( ( ( (tk(P4595)) <= (tk(P768)) ) & ( ( (tk(P2973)) <= ( 0 ) ) | ( (tk(P336)) <= (tk(P3981)) ) ) ) | ( (! ( ( 1 ) <= (tk(P3339)) )) & ( (tk(P817)) <= ( 0 ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12913268 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16087048 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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="CANConstruction-PT-070"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANConstruction-PT-070, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697200670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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