fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r235-tall-167856422400854
Last Updated
May 14, 2023

About the Execution of Smart+red for MultiCrashLeafsetExtension-PT-S24C08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2005.020 3600000.00 3678178.00 7576.20 FFTTTTFTFF?TT?TT normal

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.r235-tall-167856422400854.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 MultiCrashLeafsetExtension-PT-S24C08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422400854
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 12K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 02:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 26 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15M 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 MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678711628298

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=MultiCrashLeafsetExtension-PT-S24C08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 12:47:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 12:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 12:47:10] [INFO ] Load time of PNML (sax parser for PT used): 521 ms
[2023-03-13 12:47:10] [INFO ] Transformed 15180 places.
[2023-03-13 12:47:10] [INFO ] Transformed 22267 transitions.
[2023-03-13 12:47:10] [INFO ] Parsed PT model containing 15180 places and 22267 transitions and 84086 arcs in 1001 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 121 resets, run finished after 688 ms. (steps per millisecond=14 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 10706 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10706 steps, saw 5348 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-13 12:47:15] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15180 cols
[2023-03-13 12:47:16] [INFO ] Computed 1137 place invariants in 1653 ms
[2023-03-13 12:47:21] [INFO ] After 4702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 12:47:25] [INFO ] [Nat]Absence check using 70 positive place invariants in 79 ms returned sat
[2023-03-13 12:47:26] [INFO ] [Nat]Absence check using 70 positive and 1067 generalized place invariants in 831 ms returned sat
[2023-03-13 12:47:46] [INFO ] After 18957ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :3
[2023-03-13 12:47:46] [INFO ] State equation strengthened by 6802 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-13 12:47:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 12:47:46] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 57 out of 15180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15180/15180 places, 22267/22267 transitions.
Graph (complete) has 49169 edges and 15180 vertex of which 15136 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.43 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions removed 4760 transitions
Trivial Post-agglo rules discarded 4760 transitions
Performed 4760 trivial Post agglomeration. Transition count delta: 4760
Iterating post reduction 0 with 4760 rules applied. Total rules applied 4761 place count 15136 transition count 17507
Reduce places removed 4760 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 4776 rules applied. Total rules applied 9537 place count 10376 transition count 17491
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 9553 place count 10360 transition count 17491
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 9553 place count 10360 transition count 17093
Deduced a syphon composed of 398 places in 17 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 10349 place count 9962 transition count 17093
Discarding 4360 places :
Symmetric choice reduction at 3 with 4360 rule applications. Total rules 14709 place count 5602 transition count 12733
Iterating global reduction 3 with 4360 rules applied. Total rules applied 19069 place count 5602 transition count 12733
Discarding 511 places :
Symmetric choice reduction at 3 with 511 rule applications. Total rules 19580 place count 5091 transition count 8645
Iterating global reduction 3 with 511 rules applied. Total rules applied 20091 place count 5091 transition count 8645
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 17 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20141 place count 5066 transition count 8620
Free-agglomeration rule (complex) applied 369 times.
Iterating global reduction 3 with 369 rules applied. Total rules applied 20510 place count 5066 transition count 11688
Reduce places removed 369 places and 0 transitions.
Iterating post reduction 3 with 369 rules applied. Total rules applied 20879 place count 4697 transition count 11688
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 21279 place count 4697 transition count 11688
Applied a total of 21279 rules in 5610 ms. Remains 4697 /15180 variables (removed 10483) and now considering 11688/22267 (removed 10579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5625 ms. Remains : 4697/15180 places, 11688/22267 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 582 ms. (steps per millisecond=17 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 12:47:53] [INFO ] Flow matrix only has 10804 transitions (discarded 884 similar events)
// Phase 1: matrix 10804 rows 4697 cols
[2023-03-13 12:47:53] [INFO ] Computed 1093 place invariants in 309 ms
[2023-03-13 12:47:54] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 12:47:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 113 ms returned sat
[2023-03-13 12:47:55] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 286 ms returned sat
[2023-03-13 12:48:02] [INFO ] After 7296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 12:48:02] [INFO ] State equation strengthened by 6662 read => feed constraints.
[2023-03-13 12:48:09] [INFO ] After 7147ms SMT Verify possible using 6662 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 12:48:18] [INFO ] Deduced a trap composed of 478 places in 5982 ms of which 14 ms to minimize.
[2023-03-13 12:48:19] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 6476 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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-13 12:48:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 12:48:19] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 56 out of 4697 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4697/4697 places, 11688/11688 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4697 transition count 11688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 4696 transition count 11687
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 4696 transition count 11687
Applied a total of 3 rules in 1491 ms. Remains 4696 /4697 variables (removed 1) and now considering 11687/11688 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1491 ms. Remains : 4696/4697 places, 11687/11688 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 3) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 12:48:21] [INFO ] Flow matrix only has 10803 transitions (discarded 884 similar events)
// Phase 1: matrix 10803 rows 4696 cols
[2023-03-13 12:48:21] [INFO ] Computed 1093 place invariants in 312 ms
[2023-03-13 12:48:22] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 12:48:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2023-03-13 12:48:23] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 315 ms returned sat
[2023-03-13 12:48:30] [INFO ] After 7186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 12:48:30] [INFO ] State equation strengthened by 6662 read => feed constraints.
[2023-03-13 12:48:35] [INFO ] After 5120ms SMT Verify possible using 6662 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 12:48:42] [INFO ] Deduced a trap composed of 580 places in 6084 ms of which 7 ms to minimize.
[2023-03-13 12:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7500 ms
[2023-03-13 12:48:44] [INFO ] After 14342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1104 ms.
[2023-03-13 12:48:46] [INFO ] After 23788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 35 out of 4696 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4696/4696 places, 11687/11687 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 4696 transition count 11676
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 4685 transition count 11676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 4684 transition count 11675
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 4684 transition count 11675
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 31 place count 4684 transition count 11738
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 38 place count 4677 transition count 11738
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 4672 transition count 11733
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 4672 transition count 11733
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 59 place count 4672 transition count 11733
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 70 place count 4661 transition count 11722
Iterating global reduction 3 with 11 rules applied. Total rules applied 81 place count 4661 transition count 11722
Applied a total of 81 rules in 2679 ms. Remains 4661 /4696 variables (removed 35) and now considering 11722/11687 (removed -35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2679 ms. Remains : 4661/4696 places, 11722/11687 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 22432 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22432 steps, saw 10347 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 12:48:52] [INFO ] Flow matrix only has 10837 transitions (discarded 885 similar events)
// Phase 1: matrix 10837 rows 4661 cols
[2023-03-13 12:48:52] [INFO ] Computed 1093 place invariants in 305 ms
[2023-03-13 12:48:53] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 12:48:53] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-13 12:48:54] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 304 ms returned sat
[2023-03-13 12:49:01] [INFO ] After 7413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 12:49:01] [INFO ] State equation strengthened by 6732 read => feed constraints.
[2023-03-13 12:49:06] [INFO ] After 4720ms SMT Verify possible using 6732 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 12:49:09] [INFO ] After 7392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1632 ms.
[2023-03-13 12:49:10] [INFO ] After 17589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 35 out of 4661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4661/4661 places, 11722/11722 transitions.
Applied a total of 0 rules in 627 ms. Remains 4661 /4661 variables (removed 0) and now considering 11722/11722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 627 ms. Remains : 4661/4661 places, 11722/11722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4661/4661 places, 11722/11722 transitions.
Applied a total of 0 rules in 638 ms. Remains 4661 /4661 variables (removed 0) and now considering 11722/11722 (removed 0) transitions.
[2023-03-13 12:49:12] [INFO ] Flow matrix only has 10837 transitions (discarded 885 similar events)
[2023-03-13 12:49:12] [INFO ] Invariant cache hit.
[2023-03-13 12:49:16] [INFO ] Implicit Places using invariants in 4333 ms returned []
Implicit Place search using SMT only with invariants took 4338 ms to find 0 implicit places.
[2023-03-13 12:49:16] [INFO ] Flow matrix only has 10837 transitions (discarded 885 similar events)
[2023-03-13 12:49:16] [INFO ] Invariant cache hit.
[2023-03-13 12:49:22] [INFO ] Dead Transitions using invariants and state equation in 6231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11212 ms. Remains : 4661/4661 places, 11722/11722 transitions.
Graph (trivial) has 3412 edges and 4661 vertex of which 25 / 4661 are part of one of the 1 SCC in 10 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 39490 edges and 4637 vertex of which 4615 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node10DetectsThatNode13CanReplaceNode12.Node13IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 241 rules applied. Total rules applied 243 place count 4229 transition count 9996
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 238 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 1 with 716 rules applied. Total rules applied 959 place count 3989 transition count 9520
Ensure Unique test removed 1 places
Reduce places removed 238 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 237 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 2 with 672 rules applied. Total rules applied 1631 place count 3751 transition count 9086
Ensure Unique test removed 40 places
Reduce places removed 237 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 3 with 627 rules applied. Total rules applied 2258 place count 3514 transition count 8696
Ensure Unique test removed 2 places
Reduce places removed 195 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 157 transitions
Reduce isomorphic transitions removed 193 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 4 with 545 rules applied. Total rules applied 2803 place count 3319 transition count 8346
Ensure Unique test removed 36 places
Reduce places removed 193 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 155 transitions
Reduce isomorphic transitions removed 157 transitions.
Drop transitions removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 5 with 504 rules applied. Total rules applied 3307 place count 3126 transition count 8035
Ensure Unique test removed 2 places
Reduce places removed 156 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 154 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 6 with 432 rules applied. Total rules applied 3739 place count 2970 transition count 7759
Ensure Unique test removed 31 places
Reduce places removed 153 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 7 with 395 rules applied. Total rules applied 4134 place count 2817 transition count 7517
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Drop transitions removed 26 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 8 with 336 rules applied. Total rules applied 4470 place count 2695 transition count 7303
Ensure Unique test removed 26 places
Reduce places removed 120 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 9 with 306 rules applied. Total rules applied 4776 place count 2575 transition count 7117
Ensure Unique test removed 2 places
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 10 with 254 rules applied. Total rules applied 5030 place count 2481 transition count 6957
Ensure Unique test removed 24 places
Reduce places removed 92 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 11 with 226 rules applied. Total rules applied 5256 place count 2389 transition count 6823
Ensure Unique test removed 2 places
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 12 with 179 rules applied. Total rules applied 5435 place count 2321 transition count 6712
Ensure Unique test removed 20 places
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 13 with 153 rules applied. Total rules applied 5588 place count 2256 transition count 6624
Ensure Unique test removed 2 places
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 14 with 115 rules applied. Total rules applied 5703 place count 2211 transition count 6554
Ensure Unique test removed 15 places
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 15 with 94 rules applied. Total rules applied 5797 place count 2169 transition count 6502
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 16 with 66 rules applied. Total rules applied 5863 place count 2142 transition count 6463
Ensure Unique test removed 11 places
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 17 with 52 rules applied. Total rules applied 5915 place count 2117 transition count 6436
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 18 with 33 rules applied. Total rules applied 5948 place count 2103 transition count 6417
Ensure Unique test removed 7 places
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 19 with 23 rules applied. Total rules applied 5971 place count 2090 transition count 6407
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 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 20 with 11 rules applied. Total rules applied 5982 place count 2084 transition count 6402
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 21 with 12 rules applied. Total rules applied 5994 place count 2080 transition count 6394
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 22 with 15 rules applied. Total rules applied 6009 place count 2072 transition count 6387
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 398 Pre rules applied. Total rules applied 6009 place count 2072 transition count 5989
Deduced a syphon composed of 398 places in 2 ms
Ensure Unique test removed 378 places
Reduce places removed 776 places and 0 transitions.
Iterating global reduction 23 with 1174 rules applied. Total rules applied 7183 place count 1296 transition count 5989
Discarding 386 places :
Symmetric choice reduction at 23 with 386 rule applications. Total rules 7569 place count 910 transition count 5603
Iterating global reduction 23 with 386 rules applied. Total rules applied 7955 place count 910 transition count 5603
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 7955 place count 910 transition count 5602
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7957 place count 909 transition count 5602
Discarding 344 places :
Symmetric choice reduction at 23 with 344 rule applications. Total rules 8301 place count 565 transition count 2850
Iterating global reduction 23 with 344 rules applied. Total rules applied 8645 place count 565 transition count 2850
Ensure Unique test removed 344 transitions
Reduce isomorphic transitions removed 344 transitions.
Iterating post reduction 23 with 344 rules applied. Total rules applied 8989 place count 565 transition count 2506
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 24 with 134 rules applied. Total rules applied 9123 place count 498 transition count 2439
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 24 with 43 rules applied. Total rules applied 9166 place count 498 transition count 2396
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 25 with 26 rules applied. Total rules applied 9192 place count 498 transition count 2370
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 25 with 17 rules applied. Total rules applied 9209 place count 498 transition count 2353
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 26 with 18 rules applied. Total rules applied 9227 place count 481 transition count 2352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 9228 place count 480 transition count 2352
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 28 with 8 rules applied. Total rules applied 9236 place count 480 transition count 2344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 28 with 8 rules applied. Total rules applied 9244 place count 472 transition count 2344
Partial Free-agglomeration rule applied 1698 times.
Drop transitions removed 1698 transitions
Iterating global reduction 29 with 1698 rules applied. Total rules applied 10942 place count 472 transition count 2344
Discarding 19 places :
Symmetric choice reduction at 29 with 19 rule applications. Total rules 10961 place count 453 transition count 2192
Iterating global reduction 29 with 19 rules applied. Total rules applied 10980 place count 453 transition count 2192
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 29 with 19 rules applied. Total rules applied 10999 place count 453 transition count 2173
Partial Post-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 30 with 9 rules applied. Total rules applied 11008 place count 453 transition count 2173
Applied a total of 11008 rules in 9226 ms. Remains 453 /4661 variables (removed 4208) and now considering 2173/11722 (removed 9549) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2173 rows 453 cols
[2023-03-13 12:49:32] [INFO ] Computed 75 place invariants in 93 ms
[2023-03-13 12:49:32] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 12:49:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-13 12:49:32] [INFO ] [Nat]Absence check using 4 positive and 71 generalized place invariants in 13 ms returned sat
[2023-03-13 12:49:32] [INFO ] After 571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 12:49:32] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-13 12:49:33] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 12:49:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-13 12:49:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4661 places, 11722 transitions and 72081 arcs took 72 ms.
[2023-03-13 12:49:34] [INFO ] Flatten gal took : 750 ms
Total runtime 144418 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S24C08
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: 4661 places, 11722 transitions, 72081 arcs.
Final Score: 1.5461037323E7
Took : 211 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-10 (reachable &!potential( ( ( ( 5 ) <= (tk(P3758)) ) | ( ( (tk(P2836)) <= ( 0 ) ) & ( ( ( ( (tk(P1918)) <= (tk(P1462)) ) | (! ( (tk(P958)) <= ( 0 ) )) ) | ( ( ( ( (! ( (tk(P3085)) <= ( 8 ) )) & ( ( 8 ) <= (tk(P1652)) ) ) & ( ( (tk(P3534)) <= (tk(P3153)) ) & ( (tk(P2988)) <= (tk(P802)) ) ) ) & ( ( (! ( ( 2 ) <= (tk(P1065)) )) & (! ( ( 5 ) <= (tk(P1912)) )) ) & ( ( (tk(P2053)) <= ( 4 ) ) & ( ( ( 4 ) <= (tk(P876)) ) & (! ( (tk(P3707)) <= ( 2 ) )) ) ) ) ) | ( ( (tk(P163)) <= (tk(P2041)) ) & ( (! ( (tk(P3368)) <= ( 1 ) )) | ( ( ( 1 ) <= (tk(P2664)) ) & ( ( 5 ) <= (tk(P3857)) ) ) ) ) ) ) & ( ( ( (tk(P2039)) <= (tk(P4110)) ) | ( ( (tk(P1461)) <= ( 8 ) ) | ( ( 1 ) <= (tk(P584)) ) ) ) | ( ( ( (tk(P2056)) <= (tk(P1908)) ) | ( (tk(P522)) <= (tk(P1861)) ) ) | ( ( (! ( ( 4 ) <= (tk(P3639)) )) & ( (tk(P4362)) <= ( 6 ) ) ) | ( ( (tk(P3462)) <= ( 6 ) ) & ( (! ( (tk(P4022)) <= ( 8 ) )) | ( ( 5 ) <= (tk(P902)) ) ) ) ) ) ) ) ) )))
PROPERTY: MultiCrashLeafsetExtension-PT-S24C08-ReachabilityCardinality-13 (reachable & potential((! ( (tk(P2836)) <= (tk(P4588)) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15032576 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16069712 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="MultiCrashLeafsetExtension-PT-S24C08"
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 MultiCrashLeafsetExtension-PT-S24C08, 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 r235-tall-167856422400854"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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