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.r101-tall-167814475500550.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 itstools
Input is DLCflexbar-PT-4b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475500550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 14:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 14:55 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.2K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 DLCflexbar-PT-4b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678288824808

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-4b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-08 15:20:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 15:20:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 15:20:26] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2023-03-08 15:20:26] [INFO ] Transformed 11440 places.
[2023-03-08 15:20:26] [INFO ] Transformed 17128 transitions.
[2023-03-08 15:20:26] [INFO ] Found NUPN structural information;
[2023-03-08 15:20:27] [INFO ] Parsed PT model containing 11440 places and 17128 transitions and 46731 arcs in 789 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 17128 rows 11440 cols
[2023-03-08 15:20:29] [INFO ] Computed 608 place invariants in 145 ms
[2023-03-08 15:20:29] [INFO ] Flatten gal took : 830 ms
[2023-03-08 15:20:29] [INFO ] Flatten gal took : 462 ms
[2023-03-08 15:20:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2709888069377832776.gal : 111 ms
[2023-03-08 15:20:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7462348903974051727.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2709888069377832776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7462348903974051727.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7462348903974051727.prop.
[2023-03-08 15:20:33] [INFO ] After 4074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 15:20:38] [INFO ] [Nat]Absence check using 608 positive place invariants in 1246 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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 15:20:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 15:20:58] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 222 out of 11440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11440/11440 places, 17128/17128 transitions.
Graph (trivial) has 10195 edges and 11440 vertex of which 850 / 11440 are part of one of the 65 SCC in 39 ms
Free SCC test removed 785 places
Drop transitions removed 888 transitions
Reduce isomorphic transitions removed 888 transitions.
Drop transitions removed 5015 transitions
Trivial Post-agglo rules discarded 5015 transitions
Performed 5015 trivial Post agglomeration. Transition count delta: 5015
Iterating post reduction 0 with 5015 rules applied. Total rules applied 5016 place count 10655 transition count 11225
Reduce places removed 5015 places and 0 transitions.
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 1 with 5289 rules applied. Total rules applied 10305 place count 5640 transition count 10951
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 2 with 210 rules applied. Total rules applied 10515 place count 5506 transition count 10875
Reduce places removed 35 places and 0 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 3 with 150 rules applied. Total rules applied 10665 place count 5471 transition count 10760
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 119 rules applied. Total rules applied 10784 place count 5356 transition count 10756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10785 place count 5355 transition count 10756
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 114 Pre rules applied. Total rules applied 10785 place count 5355 transition count 10642
Deduced a syphon composed of 114 places in 164 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 6 with 228 rules applied. Total rules applied 11013 place count 5241 transition count 10642
Discarding 1307 places :
Symmetric choice reduction at 6 with 1307 rule applications. Total rules 12320 place count 3934 transition count 9335
Iterating global reduction 6 with 1307 rules applied. Total rules applied 13627 place count 3934 transition count 9335
Performed 509 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 509 Pre rules applied. Total rules applied 13627 place count 3934 transition count 8826
Deduced a syphon composed of 509 places in 130 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 6 with 1018 rules applied. Total rules applied 14645 place count 3425 transition count 8826
Discarding 88 places :
Symmetric choice reduction at 6 with 88 rule applications. Total rules 14733 place count 3337 transition count 7309
Iterating global reduction 6 with 88 rules applied. Total rules applied 14821 place count 3337 transition count 7309
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 6 with 69 rules applied. Total rules applied 14890 place count 3337 transition count 7240
Performed 828 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 828 places in 3 ms
Reduce places removed 828 places and 0 transitions.
Iterating global reduction 7 with 1656 rules applied. Total rules applied 16546 place count 2509 transition count 6407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 16549 place count 2509 transition count 6404
Renaming transitions due to excessive name length > 1024 char.
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 16553 place count 2505 transition count 6208
Iterating global reduction 8 with 4 rules applied. Total rules applied 16557 place count 2505 transition count 6208
Performed 101 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 16759 place count 2404 transition count 6822
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 16762 place count 2404 transition count 6819
Discarding 29 places :
Symmetric choice reduction at 9 with 29 rule applications. Total rules 16791 place count 2375 transition count 6471
Iterating global reduction 9 with 29 rules applied. Total rules applied 16820 place count 2375 transition count 6471
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 9 with 109 rules applied. Total rules applied 16929 place count 2375 transition count 6362
Performed 101 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 17131 place count 2274 transition count 7057
Drop transitions removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 10 with 105 rules applied. Total rules applied 17236 place count 2274 transition count 6952
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 17244 place count 2266 transition count 6851
Iterating global reduction 11 with 8 rules applied. Total rules applied 17252 place count 2266 transition count 6851
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 11 with 38 rules applied. Total rules applied 17290 place count 2266 transition count 6813
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -197
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 12 with 44 rules applied. Total rules applied 17334 place count 2244 transition count 7010
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 12 with 31 rules applied. Total rules applied 17365 place count 2244 transition count 6979
Drop transitions removed 127 transitions
Redundant transition composition rules discarded 127 transitions
Iterating global reduction 13 with 127 rules applied. Total rules applied 17492 place count 2244 transition count 6852
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 17493 place count 2243 transition count 6851
Iterating global reduction 13 with 1 rules applied. Total rules applied 17494 place count 2243 transition count 6851
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 17495 place count 2242 transition count 6791
Iterating global reduction 13 with 1 rules applied. Total rules applied 17496 place count 2242 transition count 6791
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 17497 place count 2242 transition count 6790
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 17507 place count 2237 transition count 6785
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 17510 place count 2234 transition count 6617
Iterating global reduction 14 with 3 rules applied. Total rules applied 17513 place count 2234 transition count 6617
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 17516 place count 2234 transition count 6614
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 17518 place count 2233 transition count 6626
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 17519 place count 2233 transition count 6625
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 17520 place count 2233 transition count 6624
Free-agglomeration rule applied 1089 times with reduction of 556 identical transitions.
Iterating global reduction 16 with 1089 rules applied. Total rules applied 18609 place count 2233 transition count 4979
Reduce places removed 1089 places and 0 transitions.
Drop transitions removed 1558 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 1586 transitions.
Graph (complete) has 4108 edges and 1144 vertex of which 1135 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 16 with 2676 rules applied. Total rules applied 21285 place count 1135 transition count 3386
Drop transitions removed 21 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 17 with 29 rules applied. Total rules applied 21314 place count 1135 transition count 3357
Discarding 38 places :
Symmetric choice reduction at 18 with 38 rule applications. Total rules 21352 place count 1097 transition count 3265
Iterating global reduction 18 with 38 rules applied. Total rules applied 21390 place count 1097 transition count 3265
Drop transitions removed 279 transitions
Redundant transition composition rules discarded 279 transitions
Iterating global reduction 18 with 279 rules applied. Total rules applied 21669 place count 1097 transition count 2986
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 21671 place count 1095 transition count 2986
Discarding 80 places :
Symmetric choice reduction at 19 with 80 rule applications. Total rules 21751 place count 1015 transition count 2834
Iterating global reduction 19 with 80 rules applied. Total rules applied 21831 place count 1015 transition count 2834
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 21832 place count 1015 transition count 2833
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 21833 place count 1014 transition count 2833
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 21837 place count 1014 transition count 2829
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 21838 place count 1014 transition count 2828
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21839 place count 1013 transition count 2828
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 21 with 4 rules applied. Total rules applied 21843 place count 1013 transition count 3016
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 21 with 164 rules applied. Total rules applied 22007 place count 1009 transition count 2856
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 22 with 24 rules applied. Total rules applied 22031 place count 1009 transition count 2832
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 22032 place count 1009 transition count 2832
Applied a total of 22032 rules in 4864 ms. Remains 1009 /11440 variables (removed 10431) and now considering 2832/17128 (removed 14296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4869 ms. Remains : 1009/11440 places, 2832/17128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 13) seen :10
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 15:21:03] [INFO ] Flow matrix only has 1342 transitions (discarded 1490 similar events)
// Phase 1: matrix 1342 rows 1009 cols
[2023-03-08 15:21:03] [INFO ] Computed 483 place invariants in 14 ms
[2023-03-08 15:21:04] [INFO ] [Real]Absence check using 483 positive place invariants in 84 ms returned sat
[2023-03-08 15:21:04] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 15:21:04] [INFO ] [Nat]Absence check using 483 positive place invariants in 88 ms returned sat
[2023-03-08 15:21:05] [INFO ] After 714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 15:21:05] [INFO ] State equation strengthened by 359 read => feed constraints.
[2023-03-08 15:21:05] [INFO ] After 421ms SMT Verify possible using 359 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 15:21:05] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 4 ms to minimize.
[2023-03-08 15:21:05] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2023-03-08 15:21:06] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-08 15:21:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 551 ms
[2023-03-08 15:21:06] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-08 15:21:06] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-08 15:21:06] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2023-03-08 15:21:07] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2023-03-08 15:21:07] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2023-03-08 15:21:07] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2023-03-08 15:21:07] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2023-03-08 15:21:07] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2023-03-08 15:21:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1662 ms
[2023-03-08 15:21:08] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 0 ms to minimize.
[2023-03-08 15:21:08] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2023-03-08 15:21:08] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 0 ms to minimize.
[2023-03-08 15:21:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 785 ms
[2023-03-08 15:21:08] [INFO ] After 3794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 359 ms.
[2023-03-08 15:21:09] [INFO ] After 5173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 47 ms.
Support contains 102 out of 1009 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 2832/2832 transitions.
Graph (trivial) has 265 edges and 1009 vertex of which 26 / 1009 are part of one of the 11 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 26 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 994 transition count 2749
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 955 transition count 2747
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 953 transition count 2747
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 83 place count 953 transition count 2713
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 151 place count 919 transition count 2713
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 155 place count 919 transition count 2709
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 166 place count 908 transition count 2690
Iterating global reduction 4 with 11 rules applied. Total rules applied 177 place count 908 transition count 2690
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 4 with 49 rules applied. Total rules applied 226 place count 908 transition count 2641
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 226 place count 908 transition count 2640
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 907 transition count 2640
Performed 47 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 322 place count 860 transition count 2588
Drop transitions removed 229 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 244 transitions.
Graph (complete) has 2966 edges and 860 vertex of which 859 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 245 rules applied. Total rules applied 567 place count 859 transition count 2344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 567 place count 859 transition count 2343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 569 place count 858 transition count 2343
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 570 place count 858 transition count 2342
Discarding 42 places :
Symmetric choice reduction at 7 with 42 rule applications. Total rules 612 place count 816 transition count 2270
Iterating global reduction 7 with 42 rules applied. Total rules applied 654 place count 816 transition count 2270
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 660 place count 816 transition count 2264
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 684 place count 804 transition count 2317
Drop transitions removed 49 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 8 with 65 rules applied. Total rules applied 749 place count 804 transition count 2252
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 750 place count 803 transition count 2250
Iterating global reduction 9 with 1 rules applied. Total rules applied 751 place count 803 transition count 2250
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 758 place count 803 transition count 2243
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 10 with 61 rules applied. Total rules applied 819 place count 803 transition count 2182
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 826 place count 796 transition count 2149
Iterating global reduction 10 with 7 rules applied. Total rules applied 833 place count 796 transition count 2149
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 10 with 28 rules applied. Total rules applied 861 place count 796 transition count 2121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 863 place count 795 transition count 2120
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 873 place count 795 transition count 2110
Free-agglomeration rule applied 25 times.
Iterating global reduction 11 with 25 rules applied. Total rules applied 898 place count 795 transition count 2085
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Graph (complete) has 2609 edges and 770 vertex of which 767 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 143 rules applied. Total rules applied 1041 place count 767 transition count 1968
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1051 place count 767 transition count 1958
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1055 place count 763 transition count 1950
Iterating global reduction 13 with 4 rules applied. Total rules applied 1059 place count 763 transition count 1950
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 13 with 41 rules applied. Total rules applied 1100 place count 763 transition count 1909
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1102 place count 762 transition count 1915
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 14 with 6 rules applied. Total rules applied 1108 place count 762 transition count 1909
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1108 place count 762 transition count 1908
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1110 place count 761 transition count 1908
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1112 place count 761 transition count 1906
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1113 place count 760 transition count 1905
Iterating global reduction 15 with 1 rules applied. Total rules applied 1114 place count 760 transition count 1905
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 1118 place count 760 transition count 1905
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 1122 place count 760 transition count 1901
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1130 place count 756 transition count 1897
Applied a total of 1130 rules in 464 ms. Remains 756 /1009 variables (removed 253) and now considering 1897/2832 (removed 935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 756/1009 places, 1897/2832 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 149364 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149364 steps, saw 135537 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 15:21:13] [INFO ] Flow matrix only has 877 transitions (discarded 1020 similar events)
// Phase 1: matrix 877 rows 756 cols
[2023-03-08 15:21:13] [INFO ] Computed 431 place invariants in 10 ms
[2023-03-08 15:21:13] [INFO ] [Real]Absence check using 431 positive place invariants in 69 ms returned sat
[2023-03-08 15:21:13] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 15:21:13] [INFO ] [Nat]Absence check using 431 positive place invariants in 72 ms returned sat
[2023-03-08 15:21:14] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 15:21:14] [INFO ] State equation strengthened by 313 read => feed constraints.
[2023-03-08 15:21:14] [INFO ] After 430ms SMT Verify possible using 313 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 15:21:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-08 15:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-08 15:21:15] [INFO ] After 917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-08 15:21:15] [INFO ] After 2057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 102 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1897/1897 transitions.
Applied a total of 0 rules in 33 ms. Remains 756 /756 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 756/756 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1897/1897 transitions.
Applied a total of 0 rules in 33 ms. Remains 756 /756 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-08 15:21:15] [INFO ] Flow matrix only has 877 transitions (discarded 1020 similar events)
[2023-03-08 15:21:15] [INFO ] Invariant cache hit.
[2023-03-08 15:21:16] [INFO ] Implicit Places using invariants in 509 ms returned [202, 305, 397, 506, 612, 670, 743, 753, 754, 755]
Discarding 10 places :
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT only with invariants took 514 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 746/756 places, 1883/1897 transitions.
Graph (trivial) has 47 edges and 746 vertex of which 15 / 746 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 329 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 387 transitions.
Graph (complete) has 2172 edges and 736 vertex of which 671 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Drop transitions removed 48 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 671 transition count 1342
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 106 place count 671 transition count 1341
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 670 transition count 1341
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 178 place count 600 transition count 1226
Iterating global reduction 1 with 70 rules applied. Total rules applied 248 place count 600 transition count 1226
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 254 place count 597 transition count 1244
Drop transitions removed 195 transitions
Redundant transition composition rules discarded 195 transitions
Iterating global reduction 1 with 195 rules applied. Total rules applied 449 place count 597 transition count 1049
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 1618 edges and 593 vertex of which 591 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 5 rules applied. Total rules applied 454 place count 591 transition count 1049
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 464 place count 591 transition count 1039
Discarding 99 places :
Symmetric choice reduction at 3 with 99 rule applications. Total rules 563 place count 492 transition count 879
Iterating global reduction 3 with 99 rules applied. Total rules applied 662 place count 492 transition count 879
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 666 place count 492 transition count 879
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 669 place count 492 transition count 876
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 675 place count 489 transition count 873
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 676 place count 488 transition count 872
Applied a total of 676 rules in 166 ms. Remains 488 /746 variables (removed 258) and now considering 872/1883 (removed 1011) transitions.
[2023-03-08 15:21:16] [INFO ] Flow matrix only has 714 transitions (discarded 158 similar events)
// Phase 1: matrix 714 rows 488 cols
[2023-03-08 15:21:16] [INFO ] Computed 206 place invariants in 7 ms
[2023-03-08 15:21:16] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-08 15:21:16] [INFO ] Flow matrix only has 714 transitions (discarded 158 similar events)
[2023-03-08 15:21:16] [INFO ] Invariant cache hit.
[2023-03-08 15:21:16] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-08 15:21:17] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 488/756 places, 872/1897 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2143 ms. Remains : 488/756 places, 872/1897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 15:21:18] [INFO ] Flow matrix only has 714 transitions (discarded 158 similar events)
[2023-03-08 15:21:18] [INFO ] Invariant cache hit.
[2023-03-08 15:21:18] [INFO ] [Real]Absence check using 206 positive place invariants in 32 ms returned sat
[2023-03-08 15:21:18] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 15:21:18] [INFO ] [Nat]Absence check using 206 positive place invariants in 33 ms returned sat
[2023-03-08 15:21:18] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 15:21:18] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-08 15:21:18] [INFO ] After 152ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 15:21:18] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-08 15:21:19] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 55 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 872/872 transitions.
Graph (trivial) has 98 edges and 488 vertex of which 12 / 488 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1402 edges and 482 vertex of which 400 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.1 ms
Discarding 82 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (trivial) has 73 edges and 399 vertex of which 3 / 399 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 397 transition count 698
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 73 place count 390 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 389 transition count 694
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 74 place count 389 transition count 688
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 86 place count 383 transition count 688
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 383 transition count 685
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 91 place count 381 transition count 682
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 381 transition count 682
Performed 25 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 143 place count 356 transition count 643
Drop transitions removed 31 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 1034 edges and 356 vertex of which 351 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 4 with 60 rules applied. Total rules applied 203 place count 351 transition count 582
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 205 place count 351 transition count 580
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 218 place count 338 transition count 562
Iterating global reduction 6 with 13 rules applied. Total rules applied 231 place count 338 transition count 562
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 235 place count 336 transition count 560
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 239 place count 334 transition count 574
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 242 place count 334 transition count 571
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 254 place count 334 transition count 559
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 964 edges and 332 vertex of which 330 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 3 rules applied. Total rules applied 257 place count 330 transition count 559
Drop transitions removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 263 place count 330 transition count 553
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 264 place count 329 transition count 550
Iterating global reduction 9 with 1 rules applied. Total rules applied 265 place count 329 transition count 550
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 268 place count 329 transition count 547
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 270 place count 329 transition count 545
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 277 place count 327 transition count 540
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 281 place count 327 transition count 536
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 282 place count 326 transition count 535
Iterating global reduction 11 with 1 rules applied. Total rules applied 283 place count 326 transition count 535
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 285 place count 326 transition count 535
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 286 place count 326 transition count 534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 288 place count 325 transition count 533
Applied a total of 288 rules in 149 ms. Remains 325 /488 variables (removed 163) and now considering 533/872 (removed 339) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 325/488 places, 533/872 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 15:21:19] [INFO ] Flow matrix only has 438 transitions (discarded 95 similar events)
// Phase 1: matrix 438 rows 325 cols
[2023-03-08 15:21:19] [INFO ] Computed 147 place invariants in 21 ms
[2023-03-08 15:21:19] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 15:21:19] [INFO ] [Nat]Absence check using 147 positive place invariants in 23 ms returned sat
[2023-03-08 15:21:19] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:19] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-08 15:21:19] [INFO ] After 92ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:19] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 15:21:20] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 53 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 533/533 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 325 transition count 532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 324 transition count 532
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 322 transition count 530
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 322 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 321 transition count 529
Applied a total of 8 rules in 29 ms. Remains 321 /325 variables (removed 4) and now considering 529/533 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 321/325 places, 529/533 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 666388 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 666388 steps, saw 605380 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 15:21:23] [INFO ] Flow matrix only has 434 transitions (discarded 95 similar events)
// Phase 1: matrix 434 rows 321 cols
[2023-03-08 15:21:23] [INFO ] Computed 146 place invariants in 5 ms
[2023-03-08 15:21:23] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 15:21:23] [INFO ] [Nat]Absence check using 146 positive place invariants in 21 ms returned sat
[2023-03-08 15:21:23] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:23] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-08 15:21:23] [INFO ] After 95ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:23] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-08 15:21:23] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 53 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 529/529 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 321/321 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 529/529 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-08 15:21:23] [INFO ] Flow matrix only has 434 transitions (discarded 95 similar events)
[2023-03-08 15:21:23] [INFO ] Invariant cache hit.
[2023-03-08 15:21:24] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 15:21:24] [INFO ] Flow matrix only has 434 transitions (discarded 95 similar events)
[2023-03-08 15:21:24] [INFO ] Invariant cache hit.
[2023-03-08 15:21:24] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-08 15:21:24] [INFO ] Implicit Places using invariants and state equation in 573 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 783 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 320/321 places, 529/529 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 319 transition count 528
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 319 transition count 527
Applied a total of 3 rules in 14 ms. Remains 319 /320 variables (removed 1) and now considering 527/529 (removed 2) transitions.
[2023-03-08 15:21:24] [INFO ] Flow matrix only has 432 transitions (discarded 95 similar events)
// Phase 1: matrix 432 rows 319 cols
[2023-03-08 15:21:24] [INFO ] Computed 145 place invariants in 4 ms
[2023-03-08 15:21:24] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 15:21:24] [INFO ] Flow matrix only has 432 transitions (discarded 95 similar events)
[2023-03-08 15:21:24] [INFO ] Invariant cache hit.
[2023-03-08 15:21:25] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-08 15:21:25] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 319/321 places, 527/529 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1899 ms. Remains : 319/321 places, 527/529 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 701744 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 701744 steps, saw 634313 distinct states, run finished after 3002 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 15:21:28] [INFO ] Flow matrix only has 432 transitions (discarded 95 similar events)
[2023-03-08 15:21:28] [INFO ] Invariant cache hit.
[2023-03-08 15:21:28] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 15:21:29] [INFO ] [Nat]Absence check using 145 positive place invariants in 21 ms returned sat
[2023-03-08 15:21:29] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:29] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-08 15:21:29] [INFO ] After 126ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:29] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2023-03-08 15:21:29] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-08 15:21:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2023-03-08 15:21:29] [INFO ] After 583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-08 15:21:29] [INFO ] After 927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 53 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 527/527 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 527/527 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 319/319 places, 527/527 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 527/527 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2023-03-08 15:21:29] [INFO ] Flow matrix only has 432 transitions (discarded 95 similar events)
[2023-03-08 15:21:29] [INFO ] Invariant cache hit.
[2023-03-08 15:21:30] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-08 15:21:30] [INFO ] Flow matrix only has 432 transitions (discarded 95 similar events)
[2023-03-08 15:21:30] [INFO ] Invariant cache hit.
[2023-03-08 15:21:30] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-08 15:21:31] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2023-03-08 15:21:31] [INFO ] Redundant transitions in 53 ms returned [447, 509]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
[2023-03-08 15:21:31] [INFO ] Flow matrix only has 430 transitions (discarded 95 similar events)
// Phase 1: matrix 430 rows 319 cols
[2023-03-08 15:21:31] [INFO ] Computed 145 place invariants in 2 ms
[2023-03-08 15:21:31] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 319/319 places, 525/527 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 317 transition count 523
Applied a total of 4 rules in 12 ms. Remains 317 /319 variables (removed 2) and now considering 523/525 (removed 2) transitions.
[2023-03-08 15:21:31] [INFO ] Flow matrix only has 428 transitions (discarded 95 similar events)
// Phase 1: matrix 428 rows 317 cols
[2023-03-08 15:21:31] [INFO ] Computed 145 place invariants in 1 ms
[2023-03-08 15:21:31] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-08 15:21:31] [INFO ] Flow matrix only has 428 transitions (discarded 95 similar events)
[2023-03-08 15:21:31] [INFO ] Invariant cache hit.
[2023-03-08 15:21:31] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-08 15:21:32] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 317/319 places, 523/527 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2471 ms. Remains : 317/319 places, 523/527 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 731238 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 731238 steps, saw 661354 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 15:21:35] [INFO ] Flow matrix only has 428 transitions (discarded 95 similar events)
[2023-03-08 15:21:35] [INFO ] Invariant cache hit.
[2023-03-08 15:21:35] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 15:21:35] [INFO ] [Nat]Absence check using 145 positive place invariants in 21 ms returned sat
[2023-03-08 15:21:35] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:35] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-08 15:21:35] [INFO ] After 99ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:36] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 15:21:36] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 53 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 523/523 transitions.
Applied a total of 0 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 317/317 places, 523/523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 523/523 transitions.
Applied a total of 0 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-08 15:21:36] [INFO ] Flow matrix only has 428 transitions (discarded 95 similar events)
[2023-03-08 15:21:36] [INFO ] Invariant cache hit.
[2023-03-08 15:21:36] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-08 15:21:36] [INFO ] Flow matrix only has 428 transitions (discarded 95 similar events)
[2023-03-08 15:21:36] [INFO ] Invariant cache hit.
[2023-03-08 15:21:36] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-08 15:21:37] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-08 15:21:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 15:21:37] [INFO ] Flow matrix only has 428 transitions (discarded 95 similar events)
[2023-03-08 15:21:37] [INFO ] Invariant cache hit.
[2023-03-08 15:21:37] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1500 ms. Remains : 317/317 places, 523/523 transitions.
Graph (trivial) has 257 edges and 317 vertex of which 115 / 317 are part of one of the 57 SCC in 0 ms
Free SCC test removed 58 places
Drop transitions removed 204 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 301 transitions.
Graph (complete) has 510 edges and 259 vertex of which 178 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.0 ms
Discarding 81 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 178 transition count 218
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 174 transition count 216
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 12 place count 174 transition count 207
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 30 place count 165 transition count 207
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 39 place count 156 transition count 198
Iterating global reduction 2 with 9 rules applied. Total rules applied 48 place count 156 transition count 198
Performed 16 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 80 place count 140 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 88 place count 140 transition count 166
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 94 place count 134 transition count 160
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 134 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 133 transition count 159
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 132 place count 133 transition count 129
Reduce places removed 15 places and 0 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 3 with 16 rules applied. Total rules applied 148 place count 118 transition count 128
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 117 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 116 transition count 127
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 151 place count 116 transition count 122
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 161 place count 111 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 110 transition count 121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 110 transition count 120
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 110 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 168 place count 108 transition count 118
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 174 place count 108 transition count 118
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 175 place count 108 transition count 117
Applied a total of 175 rules in 38 ms. Remains 108 /317 variables (removed 209) and now considering 117/523 (removed 406) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 108 cols
[2023-03-08 15:21:37] [INFO ] Computed 35 place invariants in 2 ms
[2023-03-08 15:21:37] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 15:21:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 15:21:37] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 15:21:37] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:37] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-08 15:21:37] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-08 15:21:37] [INFO ] Flatten gal took : 4 ms
[2023-03-08 15:21:37] [INFO ] Flatten gal took : 4 ms
[2023-03-08 15:21:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10842491792509749553.gal : 11 ms
[2023-03-08 15:21:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10351484286515052036.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10842491792509749553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10351484286515052036.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10351484286515052036.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 49
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :49 after 9217
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9217 after 1.99067e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.99067e+06 after 1.59253e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.59253e+07 after 1.23866e+12
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.56847e+17,1.16006,4700,2,547,11,4644,7,0,618,4296,0
Total reachable state count : 256847406113949744

Verifying 1 reachability properties.
Invariant property DLCflexbar-PT-4b-ReachabilityCardinality-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DLCflexbar-PT-4b-ReachabilityCardinality-08,1.78577e+15,1.40014,19912,2,43179,11,73640,7,0,695,88659,0
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 15:21:39] [INFO ] Flatten gal took : 393 ms
[2023-03-08 15:21:39] [INFO ] Applying decomposition
[2023-03-08 15:21:40] [INFO ] Flatten gal took : 407 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6573977805641216654.txt' '-o' '/tmp/graph6573977805641216654.bin' '-w' '/tmp/graph6573977805641216654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6573977805641216654.bin' '-l' '-1' '-v' '-w' '/tmp/graph6573977805641216654.weights' '-q' '0' '-e' '0.001'
[2023-03-08 15:21:42] [INFO ] Decomposing Gal with order
[2023-03-08 15:21:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 15:21:51] [INFO ] Removed a total of 12236 redundant transitions.
[2023-03-08 15:21:51] [INFO ] Flatten gal took : 822 ms
[2023-03-08 15:21:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 362 labels/synchronizations in 163 ms.
[2023-03-08 15:21:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16344556994861532539.gal : 147 ms
[2023-03-08 15:21:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12285923437927207746.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16344556994861532539.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12285923437927207746.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12285923437927207746.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 32657
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :7 after 16
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :16 after 33
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :33 after 75
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :75 after 221284
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :221284 after 1.44146e+10
ITS-tools command line returned an error code 137
[2023-03-08 15:28:05] [INFO ] Flatten gal took : 740 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13208073435609653500
[2023-03-08 15:28:06] [INFO ] Applying decomposition
[2023-03-08 15:28:06] [INFO ] Computing symmetric may disable matrix : 523 transitions.
[2023-03-08 15:28:06] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 15:28:06] [INFO ] Computing symmetric may enable matrix : 523 transitions.
[2023-03-08 15:28:06] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 15:28:06] [INFO ] Flatten gal took : 407 ms
[2023-03-08 15:28:06] [INFO ] Computing Do-Not-Accords matrix : 523 transitions.
[2023-03-08 15:28:06] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 15:28:06] [INFO ] Built C files in 680ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13208073435609653500
Running compilation step : cd /tmp/ltsmin13208073435609653500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5571308262739225204.txt' '-o' '/tmp/graph5571308262739225204.bin' '-w' '/tmp/graph5571308262739225204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5571308262739225204.bin' '-l' '-1' '-v' '-w' '/tmp/graph5571308262739225204.weights' '-q' '0' '-e' '0.001'
[2023-03-08 15:28:07] [INFO ] Decomposing Gal with order
[2023-03-08 15:28:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 15:28:08] [INFO ] Removed a total of 1739 redundant transitions.
[2023-03-08 15:28:08] [INFO ] Flatten gal took : 161 ms
Compilation finished in 9762 ms.
Running link step : cd /tmp/ltsmin13208073435609653500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 623 ms.
Running LTSmin : cd /tmp/ltsmin13208073435609653500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DLCflexbarPT4bReachabilityCardinality08==true'
[2023-03-08 15:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 9043 ms.
[2023-03-08 15:28:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1734273646452556676.gal : 49 ms
[2023-03-08 15:28:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5044371772661154366.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1734273646452556676.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5044371772661154366.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5044371772661154366.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 1.7025e+14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.24224e+15 after 2.88338e+23
Invariant property DLCflexbar-PT-4b-ReachabilityCardinality-08 does not hold.
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.1324e+38,0.303687,18656,1139,382,41108,1936,1124,40118,211,2348,0
Total reachable state count : 113239684263589001594827613160958066688

Verifying 1 reachability properties.
Invariant property DLCflexbar-PT-4b-ReachabilityCardinality-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DLCflexbar-PT-4b-ReachabilityCardinality-08,1.63618e+36,0.411601,18656,13504,137,41108,1936,1340,40118,232,2348,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 472165 ms.

BK_STOP 1678289300487

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DLCflexbar-PT-4b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DLCflexbar-PT-4b, 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 r101-tall-167814475500550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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