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.r139-smll-167819421600038.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 Dekker-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819421600038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 01:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 01:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 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 5.9M 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 Dekker-PT-100-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678300007664

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=Dekker-PT-100
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-08 18:26:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 18:26:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:26:51] [INFO ] Load time of PNML (sax parser for PT used): 728 ms
[2023-03-08 18:26:51] [INFO ] Transformed 500 places.
[2023-03-08 18:26:51] [INFO ] Transformed 10200 transitions.
[2023-03-08 18:26:51] [INFO ] Found NUPN structural information;
[2023-03-08 18:26:51] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 922 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 944 ms. (steps per millisecond=10 ) properties (out of 11) seen :7
FORMULA Dekker-PT-100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 18:26:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2023-03-08 18:26:53] [INFO ] Computed 300 place invariants in 26 ms
[2023-03-08 18:26:53] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 18:26:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 70 ms returned sat
[2023-03-08 18:26:54] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 31 ms returned sat
[2023-03-08 18:26:54] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 18:26:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 18:26:55] [INFO ] After 265ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 18:26:56] [INFO ] Deduced a trap composed of 4 places in 830 ms of which 19 ms to minimize.
[2023-03-08 18:26:56] [INFO ] Deduced a trap composed of 4 places in 810 ms of which 1 ms to minimize.
[2023-03-08 18:26:57] [INFO ] Deduced a trap composed of 6 places in 671 ms of which 2 ms to minimize.
[2023-03-08 18:26:58] [INFO ] Deduced a trap composed of 4 places in 686 ms of which 2 ms to minimize.
[2023-03-08 18:26:58] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 2 ms to minimize.
[2023-03-08 18:26:59] [INFO ] Deduced a trap composed of 4 places in 655 ms of which 0 ms to minimize.
[2023-03-08 18:27:00] [INFO ] Deduced a trap composed of 4 places in 501 ms of which 0 ms to minimize.
[2023-03-08 18:27:00] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 2 ms to minimize.
[2023-03-08 18:27:01] [INFO ] Deduced a trap composed of 4 places in 787 ms of which 1 ms to minimize.
[2023-03-08 18:27:02] [INFO ] Deduced a trap composed of 4 places in 726 ms of which 1 ms to minimize.
[2023-03-08 18:27:03] [INFO ] Deduced a trap composed of 4 places in 719 ms of which 1 ms to minimize.
[2023-03-08 18:27:03] [INFO ] Deduced a trap composed of 4 places in 687 ms of which 1 ms to minimize.
[2023-03-08 18:27:04] [INFO ] Deduced a trap composed of 4 places in 679 ms of which 1 ms to minimize.
[2023-03-08 18:27:05] [INFO ] Deduced a trap composed of 4 places in 685 ms of which 1 ms to minimize.
[2023-03-08 18:27:05] [INFO ] Trap strengthening procedure interrupted after too many repetitions 10022 ms
[2023-03-08 18:27:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 10022 ms
[2023-03-08 18:27:05] [INFO ] After 10570ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-08 18:27:05] [INFO ] After 11763ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA Dekker-PT-100-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 8 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 1436 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1440 ms. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 134633 steps, run timeout after 3002 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134633 steps, saw 124564 distinct states, run finished after 3005 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 18:27:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 18:27:11] [INFO ] Invariant cache hit.
[2023-03-08 18:27:11] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 18:27:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 51 ms returned sat
[2023-03-08 18:27:11] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2023-03-08 18:27:11] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 18:27:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 18:27:12] [INFO ] After 346ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 18:27:13] [INFO ] Deduced a trap composed of 4 places in 907 ms of which 1 ms to minimize.
[2023-03-08 18:27:14] [INFO ] Deduced a trap composed of 4 places in 746 ms of which 1 ms to minimize.
[2023-03-08 18:27:15] [INFO ] Deduced a trap composed of 4 places in 749 ms of which 0 ms to minimize.
[2023-03-08 18:27:15] [INFO ] Deduced a trap composed of 4 places in 714 ms of which 1 ms to minimize.
[2023-03-08 18:27:16] [INFO ] Deduced a trap composed of 4 places in 690 ms of which 0 ms to minimize.
[2023-03-08 18:27:17] [INFO ] Deduced a trap composed of 4 places in 772 ms of which 1 ms to minimize.
[2023-03-08 18:27:17] [INFO ] Deduced a trap composed of 4 places in 675 ms of which 1 ms to minimize.
[2023-03-08 18:27:18] [INFO ] Deduced a trap composed of 4 places in 770 ms of which 0 ms to minimize.
[2023-03-08 18:27:19] [INFO ] Deduced a trap composed of 4 places in 776 ms of which 1 ms to minimize.
[2023-03-08 18:27:20] [INFO ] Deduced a trap composed of 6 places in 747 ms of which 1 ms to minimize.
[2023-03-08 18:27:21] [INFO ] Deduced a trap composed of 4 places in 740 ms of which 1 ms to minimize.
[2023-03-08 18:27:21] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 2 ms to minimize.
[2023-03-08 18:27:22] [INFO ] Deduced a trap composed of 4 places in 739 ms of which 1 ms to minimize.
[2023-03-08 18:27:23] [INFO ] Deduced a trap composed of 6 places in 731 ms of which 0 ms to minimize.
[2023-03-08 18:27:24] [INFO ] Deduced a trap composed of 4 places in 701 ms of which 1 ms to minimize.
[2023-03-08 18:27:24] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 1 ms to minimize.
[2023-03-08 18:27:25] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 1 ms to minimize.
[2023-03-08 18:27:26] [INFO ] Deduced a trap composed of 4 places in 654 ms of which 0 ms to minimize.
[2023-03-08 18:27:26] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 1 ms to minimize.
[2023-03-08 18:27:27] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 2 ms to minimize.
[2023-03-08 18:27:27] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2023-03-08 18:27:28] [INFO ] Deduced a trap composed of 6 places in 599 ms of which 1 ms to minimize.
[2023-03-08 18:27:29] [INFO ] Deduced a trap composed of 4 places in 574 ms of which 1 ms to minimize.
[2023-03-08 18:27:29] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 1 ms to minimize.
[2023-03-08 18:27:30] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 1 ms to minimize.
[2023-03-08 18:27:30] [INFO ] Deduced a trap composed of 5 places in 547 ms of which 1 ms to minimize.
[2023-03-08 18:27:31] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 1 ms to minimize.
[2023-03-08 18:27:31] [INFO ] Deduced a trap composed of 5 places in 549 ms of which 1 ms to minimize.
[2023-03-08 18:27:32] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 1 ms to minimize.
[2023-03-08 18:27:32] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 1 ms to minimize.
[2023-03-08 18:27:33] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 0 ms to minimize.
[2023-03-08 18:27:33] [INFO ] Deduced a trap composed of 4 places in 463 ms of which 1 ms to minimize.
[2023-03-08 18:27:34] [INFO ] Deduced a trap composed of 6 places in 506 ms of which 2 ms to minimize.
[2023-03-08 18:27:35] [INFO ] Deduced a trap composed of 4 places in 479 ms of which 1 ms to minimize.
[2023-03-08 18:27:35] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 1 ms to minimize.
[2023-03-08 18:27:35] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 1 ms to minimize.
[2023-03-08 18:27:36] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-08 18:27:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 18:27:36] [INFO ] After 25264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 15 ms.
Support contains 7 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 847 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 847 ms. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 670 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 18:27:38] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 18:27:38] [INFO ] Invariant cache hit.
[2023-03-08 18:27:47] [INFO ] Implicit Places using invariants in 9280 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 9308 ms to find 99 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 401/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 664 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10646 ms. Remains : 401/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 159277 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159277 steps, saw 147104 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 18:27:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2023-03-08 18:27:51] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-08 18:27:51] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 18:27:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 46 ms returned sat
[2023-03-08 18:27:51] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 18:27:52] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 18:27:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 18:27:52] [INFO ] After 204ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 18:27:52] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2023-03-08 18:27:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-08 18:27:53] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 0 ms to minimize.
[2023-03-08 18:27:53] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 1 ms to minimize.
[2023-03-08 18:27:54] [INFO ] Deduced a trap composed of 4 places in 719 ms of which 1 ms to minimize.
[2023-03-08 18:27:55] [INFO ] Deduced a trap composed of 4 places in 712 ms of which 5 ms to minimize.
[2023-03-08 18:27:56] [INFO ] Deduced a trap composed of 4 places in 644 ms of which 1 ms to minimize.
[2023-03-08 18:27:56] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 1 ms to minimize.
[2023-03-08 18:27:57] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 1 ms to minimize.
[2023-03-08 18:27:58] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 1 ms to minimize.
[2023-03-08 18:27:58] [INFO ] Deduced a trap composed of 4 places in 592 ms of which 1 ms to minimize.
[2023-03-08 18:27:59] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 0 ms to minimize.
[2023-03-08 18:27:59] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 2 ms to minimize.
[2023-03-08 18:27:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 7141 ms
[2023-03-08 18:27:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7142 ms
[2023-03-08 18:27:59] [INFO ] After 7607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-08 18:27:59] [INFO ] After 8274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 7 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 733 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 401/401 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 509 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 18:28:01] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 18:28:01] [INFO ] Invariant cache hit.
[2023-03-08 18:28:03] [INFO ] Implicit Places using invariants in 2609 ms returned []
Implicit Place search using SMT only with invariants took 2611 ms to find 0 implicit places.
[2023-03-08 18:28:03] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 18:28:03] [INFO ] Invariant cache hit.
[2023-03-08 18:28:10] [INFO ] Dead Transitions using invariants and state equation in 6848 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9970 ms. Remains : 401/401 places, 10200/10200 transitions.
Graph (complete) has 605 edges and 401 vertex of which 25 are kept as prefixes of interest. Removing 376 places using SCC suffix rule.4 ms
Discarding 376 places :
Also discarding 9588 output transitions
Drop transitions removed 9588 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Iterating post reduction 0 with 589 rules applied. Total rules applied 590 place count 24 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 602 place count 16 transition count 20
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 606 place count 16 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 607 place count 16 transition count 15
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 610 place count 14 transition count 14
Applied a total of 610 rules in 40 ms. Remains 14 /401 variables (removed 387) and now considering 14/10200 (removed 10186) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 18:28:10] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-08 18:28:10] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 18:28:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-08 18:28:10] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 18:28:10] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 18:28:10] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-08 18:28:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-08 18:28:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 401 places, 10200 transitions and 70201 arcs took 77 ms.
[2023-03-08 18:28:12] [INFO ] Flatten gal took : 1104 ms
Total runtime 81671 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Dekker (PT), instance 100
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: 401 places, 10200 transitions, 70201 arcs.
Final Score: 180829.897
Took : 320 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Dekker-PT-100-ReachabilityCardinality-04 (reachable &!potential( ( ( ( (tk(P302)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P302)) ) ) | ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) )))
PROPERTY: Dekker-PT-100-ReachabilityCardinality-05 (reachable & potential(( ( (tk(P282)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P282)) ) )))
PROPERTY: Dekker-PT-100-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (tk(P361)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P361)) ) ) | ( ( ( (tk(P312)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P312)) ) ) | ( ( ( (tk(P311)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P311)) ) ) & ( ( (tk(P357)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P357)) ) ) ) ) )))

BK_STOP 1678302904478

--------------------
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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 788 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="Dekker-PT-100"
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 Dekker-PT-100, 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 r139-smll-167819421600038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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