fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r176-tajo-158987871700307
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for PolyORBLF-COL-S02J06T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15746.340 3600000.00 6369546.00 4129.60 FTF?FTTT?FFTTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871700307.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-COL-S02J06T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871700307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 4.2K Apr 12 05:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 05:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 11 04:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 04:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 154K Mar 24 05:37 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 PolyORBLF-COL-S02J06T10-CTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591141978734

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:53:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:53:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 23:53:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 794 ms
[2020-06-02 23:53:01] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,

[2020-06-02 23:53:01] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-02 23:53:01] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-02 23:53:01] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-02 23:53:01] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-02 23:53:01] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-02 23:53:01] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-02 23:53:01] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 26 ms.
[2020-06-02 23:53:01] [INFO ] Computed order based on color domains.
[2020-06-02 23:53:01] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1652 transitions in 29 ms.
[2020-06-02 23:53:01] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 75 ms.
Incomplete random walk after 100000 steps, including 14 resets, run finished after 843 ms. (steps per millisecond=118 ) properties seen :[0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0]
[2020-06-02 23:53:02] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2020-06-02 23:53:02] [INFO ] Computed 58 place invariants in 108 ms
[2020-06-02 23:53:02] [INFO ] [Real]Absence check using 14 positive place invariants in 47 ms returned sat
[2020-06-02 23:53:02] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 76 ms returned sat
[2020-06-02 23:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:05] [INFO ] [Real]Absence check using state equation in 2918 ms returned sat
[2020-06-02 23:53:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:53:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2020-06-02 23:53:05] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 43 ms returned unsat
[2020-06-02 23:53:05] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-06-02 23:53:05] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 51 ms returned unsat
[2020-06-02 23:53:05] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-06-02 23:53:06] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 72 ms returned sat
[2020-06-02 23:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:09] [INFO ] [Real]Absence check using state equation in 3412 ms returned sat
[2020-06-02 23:53:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:53:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 36 ms returned sat
[2020-06-02 23:53:09] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 52 ms returned sat
[2020-06-02 23:53:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:13] [INFO ] [Nat]Absence check using state equation in 3554 ms returned sat
[2020-06-02 23:53:13] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-02 23:53:14] [INFO ] [Nat]Added 130 Read/Feed constraints in 1225 ms returned sat
[2020-06-02 23:53:14] [INFO ] Deduced a trap composed of 73 places in 108 ms
[2020-06-02 23:53:15] [INFO ] Deduced a trap composed of 73 places in 116 ms
[2020-06-02 23:53:15] [INFO ] Deduced a trap composed of 73 places in 133 ms
[2020-06-02 23:53:15] [INFO ] Deduced a trap composed of 73 places in 192 ms
[2020-06-02 23:53:16] [INFO ] Deduced a trap composed of 73 places in 149 ms
[2020-06-02 23:53:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1717 ms
[2020-06-02 23:53:16] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 220 ms.
[2020-06-02 23:53:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t363 0) (and (and (> t223 0) (< o223 o363)) (or (and (> t290 0) (< o290 o363)) (and (> t291 0) (< o291 o363)) (and (> t292 0) (< o292 o363)) (and (> t293 0) (< o293 o363)) (and (> t294 0) (< o294 o363)) (and (> t295 0) (< o295 o363)) (and (> t296 0) (< o296 o363)) (and (> t297 0) (< o297 o363)) (and (> t298 0) (< o298 o363)) (and (> t299 0) (< o299 o363)) (and (> t300 0) (< o300 o363)) (and (> t301 0) (< o301 o363)) (and (> t302 0) (< o302 o363)) (and (> t303 0) (< o303 o363)) (and (> t304 0) (< o304 o363)) (and (> t305 0) (< o305 o363)) (and (> t306 0) (< o306 o363)) (and (> t307 0) (< o307 o363)) (and (> t308 0) (< o308 o363)) (and (> t309 0) (< o309 o363)) (and (> t310 0) (< o310 o363)) (and (> t311 0) (< o311 o363)) (and (> t312 0) (< o312 o363)) (and (> t313 0) (< o313 o363)) (and (> t314 0) (< o314 o363)) (and (> t315 0) (< o315 o363)) (and (> t316 0) (< o316 o363)) (and (> t317 0) (< o317 o363)) (and (> t318 0) (< o318 o363)) (and (> t319 0) (< o319 o363)) (and (> t320 0) (< o320 o363)) (and (> t321 0) (< o321 o363)) (and (> t322 0) (< o322 o363)) (and (> t323 0) (< o323 o363)) (and (> t324 0) (< o324 o363)) (and (> t325 0) (< o325 o363)) (and (> t326 0) (< o326 o363)) (and (> t327 0) (< o327 o363)) (and (> t328 0) (< o328 o363)) (and (> t329 0) (< o329 o363)) (and (> t330 0) (< o330 o363)) (and (> t331 0) (< o331 o363)) (and (> t332 0) (< o332 o363)) (and (> t333 0) (< o333 o363)) (and (> t334 0) (< o334 o363)) (and (> t335 0) (< o335 o363)) (and (> t336 0) (< o336 o363)) (and (> t337 0) (< o337 o363)) (and (> t338 0) (< o338 o363)) (and (> t339 0) (< o339 o363)) (and (> t340 0) (< o340 o363)) (and (> t341 0) (< o341 o363)) (and (> t342 0) (< o342 o363)) (and (> t343 0) (< o343 o363)) (and (> t344 0) (< o344 o363)) (and (> t345 0) (< o345 o363)) (and (> t346 0) (< o346 o363)) (and (> t347 0) (< o347 o363)) (and (> t348 0) (< o348 o363)) (and (> t349 0) (< o349 o363)) (and (> t350 0) (< o350 o363)) (and (> t351 0) (< o351 o363)) (and (> t352 0) (< o352 o363)) (and (> t353 0) (< o353 o363)) (and (> t354 0) (< o354 o363)) (and (> t355 0) (< o355 o363)) (and (> t356 0) (< o356 o363)) (and (> t357 0) (< o357 o363)) (and (> t358 0) (< o358 o363)) (and (> t359 0) (< o359 o363)))))") while checking expression at index 2
[2020-06-02 23:53:29] [INFO ] [Real]Absence check using 14 positive place invariants in 40 ms returned sat
[2020-06-02 23:53:29] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 102 ms returned sat
[2020-06-02 23:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:32] [INFO ] [Real]Absence check using state equation in 2937 ms returned sat
[2020-06-02 23:53:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:53:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 36 ms returned sat
[2020-06-02 23:53:32] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 72 ms returned sat
[2020-06-02 23:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:35] [INFO ] [Nat]Absence check using state equation in 2855 ms returned sat
[2020-06-02 23:53:37] [INFO ] [Nat]Added 130 Read/Feed constraints in 1718 ms returned sat
[2020-06-02 23:53:39] [INFO ] Deduced a trap composed of 73 places in 1791 ms
[2020-06-02 23:53:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:53:43] [INFO ] Deduced a trap composed of 73 places in 167 ms
[2020-06-02 23:53:43] [INFO ] Deduced a trap composed of 73 places in 181 ms
[2020-06-02 23:53:43] [INFO ] Deduced a trap composed of 73 places in 125 ms
[2020-06-02 23:53:43] [INFO ] Deduced a trap composed of 74 places in 81 ms
[2020-06-02 23:53:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 7142 ms
[2020-06-02 23:53:44] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 136 ms.
[2020-06-02 23:53:52] [INFO ] Added : 175 causal constraints over 35 iterations in 8078 ms. Result :(error "Failed to check-sat")
[2020-06-02 23:53:52] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2020-06-02 23:53:52] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 54 ms returned unsat
[2020-06-02 23:53:53] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-06-02 23:53:53] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 50 ms returned unsat
[2020-06-02 23:53:53] [INFO ] [Real]Absence check using 14 positive place invariants in 33 ms returned sat
[2020-06-02 23:53:53] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 37 ms returned unsat
[2020-06-02 23:53:53] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-06-02 23:53:53] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 67 ms returned unsat
[2020-06-02 23:53:53] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-06-02 23:53:53] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 52 ms returned sat
[2020-06-02 23:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:56] [INFO ] [Real]Absence check using state equation in 2911 ms returned sat
[2020-06-02 23:53:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:53:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2020-06-02 23:53:56] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 70 ms returned sat
[2020-06-02 23:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:59] [INFO ] [Nat]Absence check using state equation in 2824 ms returned sat
[2020-06-02 23:54:00] [INFO ] [Nat]Added 130 Read/Feed constraints in 1364 ms returned sat
[2020-06-02 23:54:01] [INFO ] Deduced a trap composed of 73 places in 515 ms
[2020-06-02 23:54:02] [INFO ] Deduced a trap composed of 136 places in 452 ms
[2020-06-02 23:54:02] [INFO ] Deduced a trap composed of 473 places in 532 ms
[2020-06-02 23:54:04] [INFO ] Deduced a trap composed of 74 places in 145 ms
[2020-06-02 23:54:05] [INFO ] Deduced a trap composed of 73 places in 56 ms
[2020-06-02 23:54:06] [INFO ] Deduced a trap composed of 74 places in 104 ms
[2020-06-02 23:54:06] [INFO ] Deduced a trap composed of 74 places in 41 ms
[2020-06-02 23:54:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6025 ms
[2020-06-02 23:54:07] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 183 ms.
[2020-06-02 23:54:16] [INFO ] Added : 260 causal constraints over 52 iterations in 9618 ms. Result :unknown
[2020-06-02 23:54:16] [INFO ] [Real]Absence check using 14 positive place invariants in 43 ms returned sat
[2020-06-02 23:54:16] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 80 ms returned sat
[2020-06-02 23:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:54:20] [INFO ] [Real]Absence check using state equation in 3490 ms returned sat
[2020-06-02 23:54:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:54:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 30 ms returned sat
[2020-06-02 23:54:20] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 50 ms returned unsat
[2020-06-02 23:54:20] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-06-02 23:54:20] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 38 ms returned unsat
[2020-06-02 23:54:20] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-06-02 23:54:20] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 49 ms returned unsat
[2020-06-02 23:54:20] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-06-02 23:54:20] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 49 ms returned sat
[2020-06-02 23:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:54:24] [INFO ] [Real]Absence check using state equation in 3473 ms returned sat
[2020-06-02 23:54:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:54:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 45 ms returned sat
[2020-06-02 23:54:24] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 70 ms returned sat
[2020-06-02 23:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:54:29] [INFO ] [Nat]Absence check using state equation in 4487 ms returned sat
[2020-06-02 23:54:29] [INFO ] [Nat]Added 130 Read/Feed constraints in 602 ms returned sat
[2020-06-02 23:54:29] [INFO ] Deduced a trap composed of 73 places in 119 ms
[2020-06-02 23:54:32] [INFO ] Deduced a trap composed of 482 places in 1730 ms
[2020-06-02 23:54:32] [INFO ] Deduced a trap composed of 453 places in 461 ms
[2020-06-02 23:54:33] [INFO ] Deduced a trap composed of 435 places in 480 ms
[2020-06-02 23:54:33] [INFO ] Deduced a trap composed of 433 places in 436 ms
[2020-06-02 23:54:34] [INFO ] Deduced a trap composed of 454 places in 467 ms
[2020-06-02 23:54:34] [INFO ] Deduced a trap composed of 450 places in 493 ms
[2020-06-02 23:54:35] [INFO ] Deduced a trap composed of 465 places in 497 ms
[2020-06-02 23:54:35] [INFO ] Deduced a trap composed of 444 places in 463 ms
[2020-06-02 23:54:36] [INFO ] Deduced a trap composed of 423 places in 426 ms
[2020-06-02 23:54:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7362 ms
[2020-06-02 23:54:37] [INFO ] Computed and/alt/rep : 1650/32798/1630 causal constraints in 182 ms.
[2020-06-02 23:54:44] [INFO ] Added : 180 causal constraints over 36 iterations in 7360 ms. Result :(error "Failed to check-sat")
[2020-06-02 23:54:44] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-06-02 23:54:44] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 74 ms returned sat
[2020-06-02 23:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:54:48] [INFO ] [Real]Absence check using state equation in 3596 ms returned sat
[2020-06-02 23:54:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:54:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-06-02 23:54:48] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
[2020-06-02 23:54:48] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 23:54:48] [INFO ] Flatten gal took : 298 ms
[2020-06-02 23:54:49] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 23:54:49] [INFO ] Flatten gal took : 202 ms
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:54:49] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-02 23:54:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 39 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBLF-COL-S02J06T10 @ 3570 seconds

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 169544 kB
After kill :
MemTotal: 16427456 kB
MemFree: 160864 kB

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

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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is PolyORBLF-COL-S02J06T10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871700307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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